./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-multidimensional/copy-partial-3-u.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-multidimensional/copy-partial-3-u.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 52a248b2b2cf395cf0c12ea6447af889ed3691d7fa3d2de2504a7728d19c705b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:20:54,903 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:20:54,905 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:20:54,936 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:20:54,937 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:20:54,939 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:20:54,940 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:20:54,942 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:20:54,944 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:20:54,947 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:20:54,947 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:20:54,948 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:20:54,949 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:20:54,950 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:20:54,951 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:20:54,953 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:20:54,954 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:20:54,955 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:20:54,956 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:20:54,960 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:20:54,961 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:20:54,962 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:20:54,963 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:20:54,964 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:20:54,968 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:20:54,969 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:20:54,969 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:20:54,970 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:20:54,970 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:20:54,971 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:20:54,971 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:20:54,972 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:20:54,973 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:20:54,974 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:20:54,974 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:20:54,975 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:20:54,975 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:20:54,975 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:20:54,975 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:20:54,976 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:20:54,976 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:20:54,977 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:20:55,001 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:20:55,001 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:20:55,001 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:20:55,001 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:20:55,002 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:20:55,002 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:20:55,003 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:20:55,003 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:20:55,003 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:20:55,003 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:20:55,004 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:20:55,004 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:20:55,004 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:20:55,004 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:20:55,004 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:20:55,004 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:20:55,005 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:20:55,005 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:20:55,005 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:20:55,005 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:20:55,005 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:20:55,005 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:20:55,006 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:20:55,006 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:20:55,006 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:20:55,006 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:20:55,006 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:20:55,007 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:20:55,007 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:20:55,007 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:20:55,007 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:20:55,008 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:20:55,008 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:20:55,008 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 -> 52a248b2b2cf395cf0c12ea6447af889ed3691d7fa3d2de2504a7728d19c705b [2022-02-20 14:20:55,206 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:20:55,230 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:20:55,232 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:20:55,232 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:20:55,233 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:20:55,234 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-multidimensional/copy-partial-3-u.c [2022-02-20 14:20:55,279 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28e50d17d/d052a0b1e3d64be1a76c4be67382cccc/FLAGe608d61e7 [2022-02-20 14:20:55,630 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:20:55,631 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/copy-partial-3-u.c [2022-02-20 14:20:55,636 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28e50d17d/d052a0b1e3d64be1a76c4be67382cccc/FLAGe608d61e7 [2022-02-20 14:20:55,644 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28e50d17d/d052a0b1e3d64be1a76c4be67382cccc [2022-02-20 14:20:55,646 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:20:55,647 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:20:55,649 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:20:55,649 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:20:55,659 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:20:55,660 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:20:55" (1/1) ... [2022-02-20 14:20:55,661 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@711a6483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:20:55, skipping insertion in model container [2022-02-20 14:20:55,661 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:20:55" (1/1) ... [2022-02-20 14:20:55,666 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:20:55,679 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:20:55,811 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-multidimensional/copy-partial-3-u.c[414,427] [2022-02-20 14:20:55,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:20:55,840 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:20:55,848 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-multidimensional/copy-partial-3-u.c[414,427] [2022-02-20 14:20:55,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:20:55,868 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:20:55,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:20:55 WrapperNode [2022-02-20 14:20:55,874 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:20:55,874 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:20:55,875 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:20:55,875 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:20:55,879 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:20:55" (1/1) ... [2022-02-20 14:20:55,885 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:20:55" (1/1) ... [2022-02-20 14:20:55,922 INFO L137 Inliner]: procedures = 15, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 132 [2022-02-20 14:20:55,926 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:20:55,926 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:20:55,927 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:20:55,927 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:20:55,932 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:20:55" (1/1) ... [2022-02-20 14:20:55,932 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:20:55" (1/1) ... [2022-02-20 14:20:55,942 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:20:55" (1/1) ... [2022-02-20 14:20:55,944 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:20:55" (1/1) ... [2022-02-20 14:20:55,948 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:20:55" (1/1) ... [2022-02-20 14:20:55,961 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:20:55" (1/1) ... [2022-02-20 14:20:55,962 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:20:55" (1/1) ... [2022-02-20 14:20:55,966 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:20:55,967 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:20:55,967 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:20:55,967 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:20:55,971 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:20:55" (1/1) ... [2022-02-20 14:20:55,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:20:55,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:20:55,996 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:20:56,014 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:20:56,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:20:56,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:20:56,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:20:56,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:20:56,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:20:56,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:20:56,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:20:56,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:20:56,091 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:20:56,092 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:20:56,298 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:20:56,303 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:20:56,303 INFO L299 CfgBuilder]: Removed 12 assume(true) statements. [2022-02-20 14:20:56,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:20:56 BoogieIcfgContainer [2022-02-20 14:20:56,305 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:20:56,306 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:20:56,306 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:20:56,312 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:20:56,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:20:55" (1/3) ... [2022-02-20 14:20:56,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ed4216b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:20:56, skipping insertion in model container [2022-02-20 14:20:56,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:20:55" (2/3) ... [2022-02-20 14:20:56,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ed4216b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:20:56, skipping insertion in model container [2022-02-20 14:20:56,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:20:56" (3/3) ... [2022-02-20 14:20:56,315 INFO L111 eAbstractionObserver]: Analyzing ICFG copy-partial-3-u.c [2022-02-20 14:20:56,320 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:20:56,320 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:20:56,350 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:20:56,355 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:20:56,355 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:20:56,375 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 34 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:20:56,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 14:20:56,380 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:20:56,380 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:20:56,381 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:20:56,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:20:56,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1247519481, now seen corresponding path program 1 times [2022-02-20 14:20:56,397 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:20:56,397 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452131157] [2022-02-20 14:20:56,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:20:56,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:20:56,481 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:20:56,485 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1163598242] [2022-02-20 14:20:56,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:20:56,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:20:56,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:20:56,488 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:20:56,489 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:20:56,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:20:56,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 14:20:56,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:20:56,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:20:56,663 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#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(19, 2);call #Ultimate.allocInit(12, 3); {38#true} is VALID [2022-02-20 14:20:56,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~p~0#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;main_~n~0#1 := 1000;main_~p~0#1 := 500;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~n~0#1 * main_~n~0#1);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~n~0#1 * main_~n~0#1);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~p~0#1 < main_~n~0#1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {38#true} is VALID [2022-02-20 14:20:56,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {39#false} is VALID [2022-02-20 14:20:56,664 INFO L290 TraceCheckUtils]: 3: Hoare triple {39#false} assume { :end_inline_assume_abort_if_not } true;main_~i~0#1 := 0;main_~j~0#1 := 0;main_~k~0#1 := 0; {39#false} is VALID [2022-02-20 14:20:56,665 INFO L290 TraceCheckUtils]: 4: Hoare triple {39#false} assume !(main_~i~0#1 < main_~n~0#1); {39#false} is VALID [2022-02-20 14:20:56,665 INFO L290 TraceCheckUtils]: 5: Hoare triple {39#false} main_~i~0#1 := 0;main_~j~0#1 := 0;main_~k~0#1 := 0; {39#false} is VALID [2022-02-20 14:20:56,665 INFO L290 TraceCheckUtils]: 6: Hoare triple {39#false} assume !true; {39#false} is VALID [2022-02-20 14:20:56,666 INFO L290 TraceCheckUtils]: 7: Hoare triple {39#false} main_~i~0#1 := main_~p~0#1; {39#false} is VALID [2022-02-20 14:20:56,666 INFO L290 TraceCheckUtils]: 8: Hoare triple {39#false} assume !true; {39#false} is VALID [2022-02-20 14:20:56,666 INFO L290 TraceCheckUtils]: 9: Hoare triple {39#false} main_~i~0#1 := 0;main_~j~0#1 := 0;main_~k~0#1 := 0; {39#false} is VALID [2022-02-20 14:20:56,667 INFO L290 TraceCheckUtils]: 10: Hoare triple {39#false} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0;main_~k~0#1 := 0; {39#false} is VALID [2022-02-20 14:20:56,667 INFO L290 TraceCheckUtils]: 11: Hoare triple {39#false} assume !!(main_~j~0#1 < main_~n~0#1);main_~k~0#1 := 0; {39#false} is VALID [2022-02-20 14:20:56,667 INFO L290 TraceCheckUtils]: 12: Hoare triple {39#false} assume !!(main_~k~0#1 < main_~n~0#1);call main_#t~mem7#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);call main_#t~mem8#1 := read~int(main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 == main_#t~mem8#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {39#false} is VALID [2022-02-20 14:20:56,667 INFO L290 TraceCheckUtils]: 13: Hoare triple {39#false} assume 0 == __VERIFIER_assert_~cond#1; {39#false} is VALID [2022-02-20 14:20:56,668 INFO L290 TraceCheckUtils]: 14: Hoare triple {39#false} assume !false; {39#false} is VALID [2022-02-20 14:20:56,669 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:20:56,670 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:20:56,670 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:20:56,670 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452131157] [2022-02-20 14:20:56,670 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:20:56,671 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163598242] [2022-02-20 14:20:56,671 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163598242] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:20:56,671 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:20:56,672 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 14:20:56,673 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290994908] [2022-02-20 14:20:56,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:20:56,679 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 14:20:56,680 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:20:56,683 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:20:56,699 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:20:56,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 14:20:56,701 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:20:56,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 14:20:56,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:20:56,722 INFO L87 Difference]: Start difference. First operand has 35 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 34 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:20:56,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:20:56,778 INFO L93 Difference]: Finished difference Result 67 states and 116 transitions. [2022-02-20 14:20:56,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 14:20:56,779 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 14:20:56,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:20:56,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:20:56,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 116 transitions. [2022-02-20 14:20:56,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:20:56,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 116 transitions. [2022-02-20 14:20:56,800 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 116 transitions. [2022-02-20 14:20:56,902 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:20:56,910 INFO L225 Difference]: With dead ends: 67 [2022-02-20 14:20:56,910 INFO L226 Difference]: Without dead ends: 31 [2022-02-20 14:20:56,919 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 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:20:56,925 INFO L933 BasicCegarLoop]: 46 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, 46 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:20:56,926 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:20:56,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-02-20 14:20:56,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-02-20 14:20:56,945 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:20:56,946 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 30 states have (on average 1.4) internal successors, (42), 30 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:20:56,947 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 30 states have (on average 1.4) internal successors, (42), 30 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:20:56,947 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 30 states have (on average 1.4) internal successors, (42), 30 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:20:56,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:20:56,950 INFO L93 Difference]: Finished difference Result 31 states and 42 transitions. [2022-02-20 14:20:56,950 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2022-02-20 14:20:56,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:20:56,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:20:56,950 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 30 states have (on average 1.4) internal successors, (42), 30 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 31 states. [2022-02-20 14:20:56,951 INFO L87 Difference]: Start difference. First operand has 31 states, 30 states have (on average 1.4) internal successors, (42), 30 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 31 states. [2022-02-20 14:20:56,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:20:56,952 INFO L93 Difference]: Finished difference Result 31 states and 42 transitions. [2022-02-20 14:20:56,953 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2022-02-20 14:20:56,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:20:56,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:20:56,953 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:20:56,953 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:20:56,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.4) internal successors, (42), 30 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:20:56,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2022-02-20 14:20:56,956 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 15 [2022-02-20 14:20:56,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:20:56,956 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2022-02-20 14:20:56,956 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:20:56,956 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2022-02-20 14:20:56,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 14:20:56,957 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:20:56,957 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:20:56,977 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:20:57,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-02-20 14:20:57,177 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:20:57,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:20:57,178 INFO L85 PathProgramCache]: Analyzing trace with hash -5605811, now seen corresponding path program 1 times [2022-02-20 14:20:57,178 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:20:57,178 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285561118] [2022-02-20 14:20:57,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:20:57,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:20:57,190 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:20:57,190 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [879243754] [2022-02-20 14:20:57,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:20:57,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:20:57,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:20:57,192 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:20:57,193 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:20:57,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:20:57,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 14:20:57,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:20:57,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:20:57,357 INFO L290 TraceCheckUtils]: 0: Hoare triple {285#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(19, 2);call #Ultimate.allocInit(12, 3); {285#true} is VALID [2022-02-20 14:20:57,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {285#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~p~0#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;main_~n~0#1 := 1000;main_~p~0#1 := 500;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~n~0#1 * main_~n~0#1);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~n~0#1 * main_~n~0#1);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~p~0#1 < main_~n~0#1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {293#(<= 1000 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:20:57,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {293#(<= 1000 |ULTIMATE.start_main_~n~0#1|)} assume !(0 == assume_abort_if_not_~cond#1); {293#(<= 1000 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:20:57,359 INFO L290 TraceCheckUtils]: 3: Hoare triple {293#(<= 1000 |ULTIMATE.start_main_~n~0#1|)} assume { :end_inline_assume_abort_if_not } true;main_~i~0#1 := 0;main_~j~0#1 := 0;main_~k~0#1 := 0; {300#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 0))} is VALID [2022-02-20 14:20:57,359 INFO L290 TraceCheckUtils]: 4: Hoare triple {300#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 0))} assume !(main_~i~0#1 < main_~n~0#1); {286#false} is VALID [2022-02-20 14:20:57,360 INFO L290 TraceCheckUtils]: 5: Hoare triple {286#false} main_~i~0#1 := 0;main_~j~0#1 := 0;main_~k~0#1 := 0; {286#false} is VALID [2022-02-20 14:20:57,360 INFO L290 TraceCheckUtils]: 6: Hoare triple {286#false} assume !(main_~i~0#1 < main_~p~0#1); {286#false} is VALID [2022-02-20 14:20:57,360 INFO L290 TraceCheckUtils]: 7: Hoare triple {286#false} main_~i~0#1 := main_~p~0#1; {286#false} is VALID [2022-02-20 14:20:57,360 INFO L290 TraceCheckUtils]: 8: Hoare triple {286#false} assume !(main_~i~0#1 < main_~n~0#1); {286#false} is VALID [2022-02-20 14:20:57,360 INFO L290 TraceCheckUtils]: 9: Hoare triple {286#false} main_~i~0#1 := 0;main_~j~0#1 := 0;main_~k~0#1 := 0; {286#false} is VALID [2022-02-20 14:20:57,360 INFO L290 TraceCheckUtils]: 10: Hoare triple {286#false} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0;main_~k~0#1 := 0; {286#false} is VALID [2022-02-20 14:20:57,361 INFO L290 TraceCheckUtils]: 11: Hoare triple {286#false} assume !!(main_~j~0#1 < main_~n~0#1);main_~k~0#1 := 0; {286#false} is VALID [2022-02-20 14:20:57,361 INFO L290 TraceCheckUtils]: 12: Hoare triple {286#false} assume !!(main_~k~0#1 < main_~n~0#1);call main_#t~mem7#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);call main_#t~mem8#1 := read~int(main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 == main_#t~mem8#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {286#false} is VALID [2022-02-20 14:20:57,361 INFO L290 TraceCheckUtils]: 13: Hoare triple {286#false} assume 0 == __VERIFIER_assert_~cond#1; {286#false} is VALID [2022-02-20 14:20:57,361 INFO L290 TraceCheckUtils]: 14: Hoare triple {286#false} assume !false; {286#false} is VALID [2022-02-20 14:20:57,361 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:20:57,361 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:20:57,362 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:20:57,362 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285561118] [2022-02-20 14:20:57,362 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:20:57,362 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879243754] [2022-02-20 14:20:57,362 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879243754] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:20:57,362 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:20:57,362 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 14:20:57,363 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554557397] [2022-02-20 14:20:57,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:20:57,363 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 14:20:57,364 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:20:57,364 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:20:57,375 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:20:57,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:20:57,375 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:20:57,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:20:57,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:20:57,376 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:20:57,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:20:57,531 INFO L93 Difference]: Finished difference Result 73 states and 100 transitions. [2022-02-20 14:20:57,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 14:20:57,531 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 14:20:57,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:20:57,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:20:57,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2022-02-20 14:20:57,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:20:57,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2022-02-20 14:20:57,537 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 100 transitions. [2022-02-20 14:20:57,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:20:57,620 INFO L225 Difference]: With dead ends: 73 [2022-02-20 14:20:57,620 INFO L226 Difference]: Without dead ends: 51 [2022-02-20 14:20:57,621 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:20:57,623 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 61 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:20:57,624 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 33 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:20:57,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-02-20 14:20:57,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2022-02-20 14:20:57,646 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:20:57,647 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 32 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 31 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:20:57,648 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 32 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 31 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:20:57,648 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 32 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 31 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:20:57,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:20:57,653 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-02-20 14:20:57,653 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-02-20 14:20:57,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:20:57,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:20:57,656 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 31 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 51 states. [2022-02-20 14:20:57,656 INFO L87 Difference]: Start difference. First operand has 32 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 31 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 51 states. [2022-02-20 14:20:57,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:20:57,661 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-02-20 14:20:57,661 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-02-20 14:20:57,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:20:57,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:20:57,663 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:20:57,663 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:20:57,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 31 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:20:57,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2022-02-20 14:20:57,665 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 15 [2022-02-20 14:20:57,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:20:57,665 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2022-02-20 14:20:57,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:20:57,665 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2022-02-20 14:20:57,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 14:20:57,670 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:20:57,672 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:20:57,696 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:20:57,895 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,SelfDestructingSolverStorable1 [2022-02-20 14:20:57,895 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:20:57,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:20:57,897 INFO L85 PathProgramCache]: Analyzing trace with hash -785961326, now seen corresponding path program 1 times [2022-02-20 14:20:57,897 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:20:57,898 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498542211] [2022-02-20 14:20:57,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:20:57,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:20:57,908 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:20:57,909 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2111967592] [2022-02-20 14:20:57,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:20:57,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:20:57,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:20:57,922 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:20:57,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 14:20:57,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:20:57,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 14:20:57,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:20:57,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:20:58,031 INFO L290 TraceCheckUtils]: 0: Hoare triple {587#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(19, 2);call #Ultimate.allocInit(12, 3); {587#true} is VALID [2022-02-20 14:20:58,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {587#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~p~0#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;main_~n~0#1 := 1000;main_~p~0#1 := 500;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~n~0#1 * main_~n~0#1);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~n~0#1 * main_~n~0#1);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~p~0#1 < main_~n~0#1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {595#(<= 1000 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:20:58,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {595#(<= 1000 |ULTIMATE.start_main_~n~0#1|)} assume !(0 == assume_abort_if_not_~cond#1); {595#(<= 1000 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:20:58,033 INFO L290 TraceCheckUtils]: 3: Hoare triple {595#(<= 1000 |ULTIMATE.start_main_~n~0#1|)} assume { :end_inline_assume_abort_if_not } true;main_~i~0#1 := 0;main_~j~0#1 := 0;main_~k~0#1 := 0; {595#(<= 1000 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:20:58,034 INFO L290 TraceCheckUtils]: 4: Hoare triple {595#(<= 1000 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0;main_~k~0#1 := 0; {605#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:20:58,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {605#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !(main_~j~0#1 < main_~n~0#1); {588#false} is VALID [2022-02-20 14:20:58,034 INFO L290 TraceCheckUtils]: 6: Hoare triple {588#false} main_~i~0#1 := 1 + main_~i~0#1; {588#false} is VALID [2022-02-20 14:20:58,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {588#false} assume !(main_~i~0#1 < main_~n~0#1); {588#false} is VALID [2022-02-20 14:20:58,035 INFO L290 TraceCheckUtils]: 8: Hoare triple {588#false} main_~i~0#1 := 0;main_~j~0#1 := 0;main_~k~0#1 := 0; {588#false} is VALID [2022-02-20 14:20:58,035 INFO L290 TraceCheckUtils]: 9: Hoare triple {588#false} assume !(main_~i~0#1 < main_~p~0#1); {588#false} is VALID [2022-02-20 14:20:58,035 INFO L290 TraceCheckUtils]: 10: Hoare triple {588#false} main_~i~0#1 := main_~p~0#1; {588#false} is VALID [2022-02-20 14:20:58,035 INFO L290 TraceCheckUtils]: 11: Hoare triple {588#false} assume !(main_~i~0#1 < main_~n~0#1); {588#false} is VALID [2022-02-20 14:20:58,035 INFO L290 TraceCheckUtils]: 12: Hoare triple {588#false} main_~i~0#1 := 0;main_~j~0#1 := 0;main_~k~0#1 := 0; {588#false} is VALID [2022-02-20 14:20:58,036 INFO L290 TraceCheckUtils]: 13: Hoare triple {588#false} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0;main_~k~0#1 := 0; {588#false} is VALID [2022-02-20 14:20:58,036 INFO L290 TraceCheckUtils]: 14: Hoare triple {588#false} assume !!(main_~j~0#1 < main_~n~0#1);main_~k~0#1 := 0; {588#false} is VALID [2022-02-20 14:20:58,036 INFO L290 TraceCheckUtils]: 15: Hoare triple {588#false} assume !!(main_~k~0#1 < main_~n~0#1);call main_#t~mem7#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);call main_#t~mem8#1 := read~int(main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 == main_#t~mem8#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {588#false} is VALID [2022-02-20 14:20:58,036 INFO L290 TraceCheckUtils]: 16: Hoare triple {588#false} assume 0 == __VERIFIER_assert_~cond#1; {588#false} is VALID [2022-02-20 14:20:58,036 INFO L290 TraceCheckUtils]: 17: Hoare triple {588#false} assume !false; {588#false} is VALID [2022-02-20 14:20:58,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:20:58,037 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:20:58,037 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:20:58,037 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498542211] [2022-02-20 14:20:58,037 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:20:58,037 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111967592] [2022-02-20 14:20:58,037 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111967592] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:20:58,038 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:20:58,038 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 14:20:58,038 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703380564] [2022-02-20 14:20:58,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:20:58,038 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 14:20:58,038 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:20:58,039 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:20:58,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:20:58,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:20:58,051 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:20:58,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:20:58,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:20:58,051 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:20:58,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:20:58,191 INFO L93 Difference]: Finished difference Result 78 states and 108 transitions. [2022-02-20 14:20:58,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 14:20:58,191 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 14:20:58,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:20:58,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:20:58,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-02-20 14:20:58,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:20:58,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-02-20 14:20:58,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 108 transitions. [2022-02-20 14:20:58,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:20:58,284 INFO L225 Difference]: With dead ends: 78 [2022-02-20 14:20:58,284 INFO L226 Difference]: Without dead ends: 51 [2022-02-20 14:20:58,284 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:20:58,285 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 76 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:20:58,286 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 32 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:20:58,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-02-20 14:20:58,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 34. [2022-02-20 14:20:58,311 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:20:58,311 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 34 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:20:58,312 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 34 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:20:58,312 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 34 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:20:58,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:20:58,313 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-02-20 14:20:58,314 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-02-20 14:20:58,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:20:58,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:20:58,314 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 51 states. [2022-02-20 14:20:58,314 INFO L87 Difference]: Start difference. First operand has 34 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 51 states. [2022-02-20 14:20:58,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:20:58,316 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-02-20 14:20:58,316 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-02-20 14:20:58,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:20:58,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:20:58,316 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:20:58,316 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:20:58,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:20:58,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2022-02-20 14:20:58,318 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 18 [2022-02-20 14:20:58,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:20:58,318 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-02-20 14:20:58,318 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:20:58,318 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-02-20 14:20:58,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 14:20:58,319 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:20:58,319 INFO L514 BasicCegarLoop]: trace histogram [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:20:58,338 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:20:58,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:20:58,532 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:20:58,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:20:58,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1148207861, now seen corresponding path program 1 times [2022-02-20 14:20:58,533 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:20:58,533 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711343779] [2022-02-20 14:20:58,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:20:58,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:20:58,548 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:20:58,549 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [162112888] [2022-02-20 14:20:58,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:20:58,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:20:58,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:20:58,550 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:20:58,552 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:20:58,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:20:58,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 14:20:58,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:20:58,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:20:58,670 INFO L290 TraceCheckUtils]: 0: Hoare triple {911#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(19, 2);call #Ultimate.allocInit(12, 3); {911#true} is VALID [2022-02-20 14:20:58,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {911#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~p~0#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;main_~n~0#1 := 1000;main_~p~0#1 := 500;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~n~0#1 * main_~n~0#1);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~n~0#1 * main_~n~0#1);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~p~0#1 < main_~n~0#1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {919#(<= 1000 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:20:58,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {919#(<= 1000 |ULTIMATE.start_main_~n~0#1|)} assume !(0 == assume_abort_if_not_~cond#1); {919#(<= 1000 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:20:58,676 INFO L290 TraceCheckUtils]: 3: Hoare triple {919#(<= 1000 |ULTIMATE.start_main_~n~0#1|)} assume { :end_inline_assume_abort_if_not } true;main_~i~0#1 := 0;main_~j~0#1 := 0;main_~k~0#1 := 0; {919#(<= 1000 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:20:58,676 INFO L290 TraceCheckUtils]: 4: Hoare triple {919#(<= 1000 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0;main_~k~0#1 := 0; {919#(<= 1000 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:20:58,677 INFO L290 TraceCheckUtils]: 5: Hoare triple {919#(<= 1000 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);main_~k~0#1 := 0; {932#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 0))} is VALID [2022-02-20 14:20:58,677 INFO L290 TraceCheckUtils]: 6: Hoare triple {932#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 0))} assume !(main_~k~0#1 < main_~n~0#1); {912#false} is VALID [2022-02-20 14:20:58,678 INFO L290 TraceCheckUtils]: 7: Hoare triple {912#false} main_~j~0#1 := 1 + main_~j~0#1; {912#false} is VALID [2022-02-20 14:20:58,678 INFO L290 TraceCheckUtils]: 8: Hoare triple {912#false} assume !(main_~j~0#1 < main_~n~0#1); {912#false} is VALID [2022-02-20 14:20:58,678 INFO L290 TraceCheckUtils]: 9: Hoare triple {912#false} main_~i~0#1 := 1 + main_~i~0#1; {912#false} is VALID [2022-02-20 14:20:58,678 INFO L290 TraceCheckUtils]: 10: Hoare triple {912#false} assume !(main_~i~0#1 < main_~n~0#1); {912#false} is VALID [2022-02-20 14:20:58,678 INFO L290 TraceCheckUtils]: 11: Hoare triple {912#false} main_~i~0#1 := 0;main_~j~0#1 := 0;main_~k~0#1 := 0; {912#false} is VALID [2022-02-20 14:20:58,678 INFO L290 TraceCheckUtils]: 12: Hoare triple {912#false} assume !(main_~i~0#1 < main_~p~0#1); {912#false} is VALID [2022-02-20 14:20:58,679 INFO L290 TraceCheckUtils]: 13: Hoare triple {912#false} main_~i~0#1 := main_~p~0#1; {912#false} is VALID [2022-02-20 14:20:58,679 INFO L290 TraceCheckUtils]: 14: Hoare triple {912#false} assume !(main_~i~0#1 < main_~n~0#1); {912#false} is VALID [2022-02-20 14:20:58,679 INFO L290 TraceCheckUtils]: 15: Hoare triple {912#false} main_~i~0#1 := 0;main_~j~0#1 := 0;main_~k~0#1 := 0; {912#false} is VALID [2022-02-20 14:20:58,679 INFO L290 TraceCheckUtils]: 16: Hoare triple {912#false} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0;main_~k~0#1 := 0; {912#false} is VALID [2022-02-20 14:20:58,679 INFO L290 TraceCheckUtils]: 17: Hoare triple {912#false} assume !!(main_~j~0#1 < main_~n~0#1);main_~k~0#1 := 0; {912#false} is VALID [2022-02-20 14:20:58,680 INFO L290 TraceCheckUtils]: 18: Hoare triple {912#false} assume !!(main_~k~0#1 < main_~n~0#1);call main_#t~mem7#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);call main_#t~mem8#1 := read~int(main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 == main_#t~mem8#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {912#false} is VALID [2022-02-20 14:20:58,680 INFO L290 TraceCheckUtils]: 19: Hoare triple {912#false} assume 0 == __VERIFIER_assert_~cond#1; {912#false} is VALID [2022-02-20 14:20:58,680 INFO L290 TraceCheckUtils]: 20: Hoare triple {912#false} assume !false; {912#false} is VALID [2022-02-20 14:20:58,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:20:58,680 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:20:58,681 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:20:58,681 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711343779] [2022-02-20 14:20:58,684 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:20:58,684 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162112888] [2022-02-20 14:20:58,684 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162112888] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:20:58,685 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:20:58,685 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 14:20:58,685 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189125472] [2022-02-20 14:20:58,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:20:58,687 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 14:20:58,687 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:20:58,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:20:58,699 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:20:58,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:20:58,700 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:20:58,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:20:58,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:20:58,701 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:20:58,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:20:58,831 INFO L93 Difference]: Finished difference Result 80 states and 109 transitions. [2022-02-20 14:20:58,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 14:20:58,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 14:20:58,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:20:58,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:20:58,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2022-02-20 14:20:58,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:20:58,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2022-02-20 14:20:58,834 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 107 transitions. [2022-02-20 14:20:58,910 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:20:58,911 INFO L225 Difference]: With dead ends: 80 [2022-02-20 14:20:58,911 INFO L226 Difference]: Without dead ends: 51 [2022-02-20 14:20:58,911 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:20:58,912 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 45 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:20:58,912 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 39 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:20:58,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-02-20 14:20:58,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 36. [2022-02-20 14:20:58,947 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:20:58,948 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 36 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 35 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:20:58,948 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 36 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 35 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:20:58,948 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 36 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 35 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:20:58,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:20:58,949 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2022-02-20 14:20:58,949 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 67 transitions. [2022-02-20 14:20:58,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:20:58,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:20:58,950 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 35 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 51 states. [2022-02-20 14:20:58,950 INFO L87 Difference]: Start difference. First operand has 36 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 35 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 51 states. [2022-02-20 14:20:58,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:20:58,951 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2022-02-20 14:20:58,951 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 67 transitions. [2022-02-20 14:20:58,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:20:58,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:20:58,952 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:20:58,952 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:20:58,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 35 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:20:58,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2022-02-20 14:20:58,953 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 21 [2022-02-20 14:20:58,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:20:58,953 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2022-02-20 14:20:58,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:20:58,953 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-02-20 14:20:58,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 14:20:58,954 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:20:58,954 INFO L514 BasicCegarLoop]: trace histogram [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:20:58,984 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:20:59,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:20:59,182 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:20:59,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:20:59,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1730545667, now seen corresponding path program 1 times [2022-02-20 14:20:59,183 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:20:59,183 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694730724] [2022-02-20 14:20:59,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:20:59,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:20:59,193 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:20:59,193 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1913717001] [2022-02-20 14:20:59,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:20:59,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:20:59,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:20:59,195 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:20:59,196 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:20:59,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:20:59,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 14:20:59,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:20:59,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:20:59,351 INFO L290 TraceCheckUtils]: 0: Hoare triple {1253#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(19, 2);call #Ultimate.allocInit(12, 3); {1253#true} is VALID [2022-02-20 14:20:59,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {1253#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~p~0#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;main_~n~0#1 := 1000;main_~p~0#1 := 500;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~n~0#1 * main_~n~0#1);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~n~0#1 * main_~n~0#1);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~p~0#1 < main_~n~0#1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1261#(<= 1000 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:20:59,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {1261#(<= 1000 |ULTIMATE.start_main_~n~0#1|)} assume !(0 == assume_abort_if_not_~cond#1); {1261#(<= 1000 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:20:59,353 INFO L290 TraceCheckUtils]: 3: Hoare triple {1261#(<= 1000 |ULTIMATE.start_main_~n~0#1|)} assume { :end_inline_assume_abort_if_not } true;main_~i~0#1 := 0;main_~j~0#1 := 0;main_~k~0#1 := 0; {1261#(<= 1000 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:20:59,353 INFO L290 TraceCheckUtils]: 4: Hoare triple {1261#(<= 1000 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0;main_~k~0#1 := 0; {1261#(<= 1000 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:20:59,353 INFO L290 TraceCheckUtils]: 5: Hoare triple {1261#(<= 1000 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);main_~k~0#1 := 0; {1274#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 0))} is VALID [2022-02-20 14:20:59,354 INFO L290 TraceCheckUtils]: 6: Hoare triple {1274#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 0))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {1278#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 1))} is VALID [2022-02-20 14:20:59,355 INFO L290 TraceCheckUtils]: 7: Hoare triple {1278#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 1))} assume !(main_~k~0#1 < main_~n~0#1); {1254#false} is VALID [2022-02-20 14:20:59,355 INFO L290 TraceCheckUtils]: 8: Hoare triple {1254#false} main_~j~0#1 := 1 + main_~j~0#1; {1254#false} is VALID [2022-02-20 14:20:59,355 INFO L290 TraceCheckUtils]: 9: Hoare triple {1254#false} assume !(main_~j~0#1 < main_~n~0#1); {1254#false} is VALID [2022-02-20 14:20:59,355 INFO L290 TraceCheckUtils]: 10: Hoare triple {1254#false} main_~i~0#1 := 1 + main_~i~0#1; {1254#false} is VALID [2022-02-20 14:20:59,355 INFO L290 TraceCheckUtils]: 11: Hoare triple {1254#false} assume !(main_~i~0#1 < main_~n~0#1); {1254#false} is VALID [2022-02-20 14:20:59,356 INFO L290 TraceCheckUtils]: 12: Hoare triple {1254#false} main_~i~0#1 := 0;main_~j~0#1 := 0;main_~k~0#1 := 0; {1254#false} is VALID [2022-02-20 14:20:59,356 INFO L290 TraceCheckUtils]: 13: Hoare triple {1254#false} assume !(main_~i~0#1 < main_~p~0#1); {1254#false} is VALID [2022-02-20 14:20:59,356 INFO L290 TraceCheckUtils]: 14: Hoare triple {1254#false} main_~i~0#1 := main_~p~0#1; {1254#false} is VALID [2022-02-20 14:20:59,356 INFO L290 TraceCheckUtils]: 15: Hoare triple {1254#false} assume !(main_~i~0#1 < main_~n~0#1); {1254#false} is VALID [2022-02-20 14:20:59,356 INFO L290 TraceCheckUtils]: 16: Hoare triple {1254#false} main_~i~0#1 := 0;main_~j~0#1 := 0;main_~k~0#1 := 0; {1254#false} is VALID [2022-02-20 14:20:59,356 INFO L290 TraceCheckUtils]: 17: Hoare triple {1254#false} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0;main_~k~0#1 := 0; {1254#false} is VALID [2022-02-20 14:20:59,357 INFO L290 TraceCheckUtils]: 18: Hoare triple {1254#false} assume !!(main_~j~0#1 < main_~n~0#1);main_~k~0#1 := 0; {1254#false} is VALID [2022-02-20 14:20:59,357 INFO L290 TraceCheckUtils]: 19: Hoare triple {1254#false} assume !!(main_~k~0#1 < main_~n~0#1);call main_#t~mem7#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);call main_#t~mem8#1 := read~int(main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 == main_#t~mem8#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1254#false} is VALID [2022-02-20 14:20:59,357 INFO L290 TraceCheckUtils]: 20: Hoare triple {1254#false} assume 0 == __VERIFIER_assert_~cond#1; {1254#false} is VALID [2022-02-20 14:20:59,357 INFO L290 TraceCheckUtils]: 21: Hoare triple {1254#false} assume !false; {1254#false} is VALID [2022-02-20 14:20:59,357 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:20:59,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:20:59,430 INFO L290 TraceCheckUtils]: 21: Hoare triple {1254#false} assume !false; {1254#false} is VALID [2022-02-20 14:20:59,431 INFO L290 TraceCheckUtils]: 20: Hoare triple {1254#false} assume 0 == __VERIFIER_assert_~cond#1; {1254#false} is VALID [2022-02-20 14:20:59,431 INFO L290 TraceCheckUtils]: 19: Hoare triple {1254#false} assume !!(main_~k~0#1 < main_~n~0#1);call main_#t~mem7#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);call main_#t~mem8#1 := read~int(main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 == main_#t~mem8#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1254#false} is VALID [2022-02-20 14:20:59,431 INFO L290 TraceCheckUtils]: 18: Hoare triple {1254#false} assume !!(main_~j~0#1 < main_~n~0#1);main_~k~0#1 := 0; {1254#false} is VALID [2022-02-20 14:20:59,431 INFO L290 TraceCheckUtils]: 17: Hoare triple {1254#false} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0;main_~k~0#1 := 0; {1254#false} is VALID [2022-02-20 14:20:59,431 INFO L290 TraceCheckUtils]: 16: Hoare triple {1254#false} main_~i~0#1 := 0;main_~j~0#1 := 0;main_~k~0#1 := 0; {1254#false} is VALID [2022-02-20 14:20:59,432 INFO L290 TraceCheckUtils]: 15: Hoare triple {1254#false} assume !(main_~i~0#1 < main_~n~0#1); {1254#false} is VALID [2022-02-20 14:20:59,432 INFO L290 TraceCheckUtils]: 14: Hoare triple {1254#false} main_~i~0#1 := main_~p~0#1; {1254#false} is VALID [2022-02-20 14:20:59,432 INFO L290 TraceCheckUtils]: 13: Hoare triple {1254#false} assume !(main_~i~0#1 < main_~p~0#1); {1254#false} is VALID [2022-02-20 14:20:59,432 INFO L290 TraceCheckUtils]: 12: Hoare triple {1254#false} main_~i~0#1 := 0;main_~j~0#1 := 0;main_~k~0#1 := 0; {1254#false} is VALID [2022-02-20 14:20:59,432 INFO L290 TraceCheckUtils]: 11: Hoare triple {1254#false} assume !(main_~i~0#1 < main_~n~0#1); {1254#false} is VALID [2022-02-20 14:20:59,432 INFO L290 TraceCheckUtils]: 10: Hoare triple {1254#false} main_~i~0#1 := 1 + main_~i~0#1; {1254#false} is VALID [2022-02-20 14:20:59,432 INFO L290 TraceCheckUtils]: 9: Hoare triple {1254#false} assume !(main_~j~0#1 < main_~n~0#1); {1254#false} is VALID [2022-02-20 14:20:59,433 INFO L290 TraceCheckUtils]: 8: Hoare triple {1254#false} main_~j~0#1 := 1 + main_~j~0#1; {1254#false} is VALID [2022-02-20 14:20:59,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {1366#(< |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~n~0#1|)} assume !(main_~k~0#1 < main_~n~0#1); {1254#false} is VALID [2022-02-20 14:20:59,434 INFO L290 TraceCheckUtils]: 6: Hoare triple {1370#(< (+ |ULTIMATE.start_main_~k~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {1366#(< |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:20:59,434 INFO L290 TraceCheckUtils]: 5: Hoare triple {1374#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);main_~k~0#1 := 0; {1370#(< (+ |ULTIMATE.start_main_~k~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:20:59,435 INFO L290 TraceCheckUtils]: 4: Hoare triple {1374#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0;main_~k~0#1 := 0; {1374#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:20:59,435 INFO L290 TraceCheckUtils]: 3: Hoare triple {1374#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume { :end_inline_assume_abort_if_not } true;main_~i~0#1 := 0;main_~j~0#1 := 0;main_~k~0#1 := 0; {1374#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:20:59,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {1374#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !(0 == assume_abort_if_not_~cond#1); {1374#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:20:59,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {1253#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~p~0#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;main_~n~0#1 := 1000;main_~p~0#1 := 500;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~n~0#1 * main_~n~0#1);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~n~0#1 * main_~n~0#1);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~p~0#1 < main_~n~0#1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1374#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:20:59,436 INFO L290 TraceCheckUtils]: 0: Hoare triple {1253#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(19, 2);call #Ultimate.allocInit(12, 3); {1253#true} is VALID [2022-02-20 14:20:59,436 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:20:59,437 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:20:59,437 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694730724] [2022-02-20 14:20:59,437 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:20:59,437 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913717001] [2022-02-20 14:20:59,437 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913717001] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:20:59,437 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:20:59,437 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-02-20 14:20:59,437 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442372671] [2022-02-20 14:20:59,438 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:20:59,438 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-20 14:20:59,438 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:20:59,438 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:20:59,455 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:20:59,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 14:20:59,456 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:20:59,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 14:20:59,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-02-20 14:20:59,456 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:20:59,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:20:59,917 INFO L93 Difference]: Finished difference Result 126 states and 174 transitions. [2022-02-20 14:20:59,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 14:20:59,917 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-20 14:20:59,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:20:59,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:20:59,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 170 transitions. [2022-02-20 14:20:59,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:20:59,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 170 transitions. [2022-02-20 14:20:59,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 170 transitions. [2022-02-20 14:21:00,037 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:21:00,038 INFO L225 Difference]: With dead ends: 126 [2022-02-20 14:21:00,038 INFO L226 Difference]: Without dead ends: 95 [2022-02-20 14:21:00,039 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=50, Unknown=0, NotChecked=0, Total=90 [2022-02-20 14:21:00,039 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 270 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:21:00,039 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [270 Valid, 71 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:21:00,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-02-20 14:21:00,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 48. [2022-02-20 14:21:00,096 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:21:00,096 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 48 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 47 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:00,096 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 48 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 47 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:00,096 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 48 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 47 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:00,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:21:00,098 INFO L93 Difference]: Finished difference Result 95 states and 126 transitions. [2022-02-20 14:21:00,098 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 126 transitions. [2022-02-20 14:21:00,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:21:00,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:21:00,099 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 47 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 95 states. [2022-02-20 14:21:00,099 INFO L87 Difference]: Start difference. First operand has 48 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 47 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 95 states. [2022-02-20 14:21:00,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:21:00,101 INFO L93 Difference]: Finished difference Result 95 states and 126 transitions. [2022-02-20 14:21:00,101 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 126 transitions. [2022-02-20 14:21:00,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:21:00,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:21:00,101 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:21:00,101 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:21:00,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 47 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:00,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2022-02-20 14:21:00,103 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 62 transitions. Word has length 22 [2022-02-20 14:21:00,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:21:00,103 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 62 transitions. [2022-02-20 14:21:00,103 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:00,103 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 62 transitions. [2022-02-20 14:21:00,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 14:21:00,103 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:21:00,104 INFO L514 BasicCegarLoop]: trace histogram [4, 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:21:00,120 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:21:00,320 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:21:00,320 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:21:00,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:21:00,320 INFO L85 PathProgramCache]: Analyzing trace with hash 340179723, now seen corresponding path program 2 times [2022-02-20 14:21:00,321 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:21:00,321 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639847865] [2022-02-20 14:21:00,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:21:00,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:21:00,336 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:21:00,337 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [895750727] [2022-02-20 14:21:00,337 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:21:00,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:21:00,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:21:00,338 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:21:00,353 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:21:00,394 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-20 14:21:00,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:21:00,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 14:21:00,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:21:00,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:21:00,497 INFO L290 TraceCheckUtils]: 0: Hoare triple {1849#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(19, 2);call #Ultimate.allocInit(12, 3); {1849#true} is VALID [2022-02-20 14:21:00,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {1849#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~p~0#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;main_~n~0#1 := 1000;main_~p~0#1 := 500;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~n~0#1 * main_~n~0#1);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~n~0#1 * main_~n~0#1);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~p~0#1 < main_~n~0#1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1857#(<= 500 |ULTIMATE.start_main_~p~0#1|)} is VALID [2022-02-20 14:21:00,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {1857#(<= 500 |ULTIMATE.start_main_~p~0#1|)} assume !(0 == assume_abort_if_not_~cond#1); {1857#(<= 500 |ULTIMATE.start_main_~p~0#1|)} is VALID [2022-02-20 14:21:00,499 INFO L290 TraceCheckUtils]: 3: Hoare triple {1857#(<= 500 |ULTIMATE.start_main_~p~0#1|)} assume { :end_inline_assume_abort_if_not } true;main_~i~0#1 := 0;main_~j~0#1 := 0;main_~k~0#1 := 0; {1857#(<= 500 |ULTIMATE.start_main_~p~0#1|)} is VALID [2022-02-20 14:21:00,500 INFO L290 TraceCheckUtils]: 4: Hoare triple {1857#(<= 500 |ULTIMATE.start_main_~p~0#1|)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0;main_~k~0#1 := 0; {1857#(<= 500 |ULTIMATE.start_main_~p~0#1|)} is VALID [2022-02-20 14:21:00,501 INFO L290 TraceCheckUtils]: 5: Hoare triple {1857#(<= 500 |ULTIMATE.start_main_~p~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);main_~k~0#1 := 0; {1857#(<= 500 |ULTIMATE.start_main_~p~0#1|)} is VALID [2022-02-20 14:21:00,502 INFO L290 TraceCheckUtils]: 6: Hoare triple {1857#(<= 500 |ULTIMATE.start_main_~p~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {1857#(<= 500 |ULTIMATE.start_main_~p~0#1|)} is VALID [2022-02-20 14:21:00,504 INFO L290 TraceCheckUtils]: 7: Hoare triple {1857#(<= 500 |ULTIMATE.start_main_~p~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {1857#(<= 500 |ULTIMATE.start_main_~p~0#1|)} is VALID [2022-02-20 14:21:00,505 INFO L290 TraceCheckUtils]: 8: Hoare triple {1857#(<= 500 |ULTIMATE.start_main_~p~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {1857#(<= 500 |ULTIMATE.start_main_~p~0#1|)} is VALID [2022-02-20 14:21:00,505 INFO L290 TraceCheckUtils]: 9: Hoare triple {1857#(<= 500 |ULTIMATE.start_main_~p~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {1857#(<= 500 |ULTIMATE.start_main_~p~0#1|)} is VALID [2022-02-20 14:21:00,505 INFO L290 TraceCheckUtils]: 10: Hoare triple {1857#(<= 500 |ULTIMATE.start_main_~p~0#1|)} assume !(main_~k~0#1 < main_~n~0#1); {1857#(<= 500 |ULTIMATE.start_main_~p~0#1|)} is VALID [2022-02-20 14:21:00,506 INFO L290 TraceCheckUtils]: 11: Hoare triple {1857#(<= 500 |ULTIMATE.start_main_~p~0#1|)} main_~j~0#1 := 1 + main_~j~0#1; {1857#(<= 500 |ULTIMATE.start_main_~p~0#1|)} is VALID [2022-02-20 14:21:00,506 INFO L290 TraceCheckUtils]: 12: Hoare triple {1857#(<= 500 |ULTIMATE.start_main_~p~0#1|)} assume !(main_~j~0#1 < main_~n~0#1); {1857#(<= 500 |ULTIMATE.start_main_~p~0#1|)} is VALID [2022-02-20 14:21:00,506 INFO L290 TraceCheckUtils]: 13: Hoare triple {1857#(<= 500 |ULTIMATE.start_main_~p~0#1|)} main_~i~0#1 := 1 + main_~i~0#1; {1857#(<= 500 |ULTIMATE.start_main_~p~0#1|)} is VALID [2022-02-20 14:21:00,507 INFO L290 TraceCheckUtils]: 14: Hoare triple {1857#(<= 500 |ULTIMATE.start_main_~p~0#1|)} assume !(main_~i~0#1 < main_~n~0#1); {1857#(<= 500 |ULTIMATE.start_main_~p~0#1|)} is VALID [2022-02-20 14:21:00,507 INFO L290 TraceCheckUtils]: 15: Hoare triple {1857#(<= 500 |ULTIMATE.start_main_~p~0#1|)} main_~i~0#1 := 0;main_~j~0#1 := 0;main_~k~0#1 := 0; {1900#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 500 |ULTIMATE.start_main_~p~0#1|))} is VALID [2022-02-20 14:21:00,508 INFO L290 TraceCheckUtils]: 16: Hoare triple {1900#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 500 |ULTIMATE.start_main_~p~0#1|))} assume !(main_~i~0#1 < main_~p~0#1); {1850#false} is VALID [2022-02-20 14:21:00,508 INFO L290 TraceCheckUtils]: 17: Hoare triple {1850#false} main_~i~0#1 := main_~p~0#1; {1850#false} is VALID [2022-02-20 14:21:00,508 INFO L290 TraceCheckUtils]: 18: Hoare triple {1850#false} assume !(main_~i~0#1 < main_~n~0#1); {1850#false} is VALID [2022-02-20 14:21:00,508 INFO L290 TraceCheckUtils]: 19: Hoare triple {1850#false} main_~i~0#1 := 0;main_~j~0#1 := 0;main_~k~0#1 := 0; {1850#false} is VALID [2022-02-20 14:21:00,508 INFO L290 TraceCheckUtils]: 20: Hoare triple {1850#false} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0;main_~k~0#1 := 0; {1850#false} is VALID [2022-02-20 14:21:00,508 INFO L290 TraceCheckUtils]: 21: Hoare triple {1850#false} assume !!(main_~j~0#1 < main_~n~0#1);main_~k~0#1 := 0; {1850#false} is VALID [2022-02-20 14:21:00,509 INFO L290 TraceCheckUtils]: 22: Hoare triple {1850#false} assume !!(main_~k~0#1 < main_~n~0#1);call main_#t~mem7#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);call main_#t~mem8#1 := read~int(main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 == main_#t~mem8#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1850#false} is VALID [2022-02-20 14:21:00,509 INFO L290 TraceCheckUtils]: 23: Hoare triple {1850#false} assume 0 == __VERIFIER_assert_~cond#1; {1850#false} is VALID [2022-02-20 14:21:00,509 INFO L290 TraceCheckUtils]: 24: Hoare triple {1850#false} assume !false; {1850#false} is VALID [2022-02-20 14:21:00,509 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 14:21:00,509 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:21:00,509 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:21:00,509 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639847865] [2022-02-20 14:21:00,510 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:21:00,510 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895750727] [2022-02-20 14:21:00,510 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895750727] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:21:00,510 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:21:00,510 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 14:21:00,510 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923601329] [2022-02-20 14:21:00,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:21:00,511 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-20 14:21:00,511 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:21:00,511 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:00,525 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:21:00,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:21:00,525 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:21:00,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:21:00,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:21:00,526 INFO L87 Difference]: Start difference. First operand 48 states and 62 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:00,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:21:00,789 INFO L93 Difference]: Finished difference Result 109 states and 141 transitions. [2022-02-20 14:21:00,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 14:21:00,789 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-20 14:21:00,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:21:00,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:00,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2022-02-20 14:21:00,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:00,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2022-02-20 14:21:00,793 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 89 transitions. [2022-02-20 14:21:00,852 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:21:00,855 INFO L225 Difference]: With dead ends: 109 [2022-02-20 14:21:00,855 INFO L226 Difference]: Without dead ends: 82 [2022-02-20 14:21:00,856 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:21:00,858 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 51 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:21:00,859 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 45 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:21:00,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-02-20 14:21:00,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 49. [2022-02-20 14:21:00,932 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:21:00,933 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 49 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:00,933 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 49 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:00,933 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 49 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:00,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:21:00,935 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2022-02-20 14:21:00,935 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2022-02-20 14:21:00,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:21:00,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:21:00,936 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 82 states. [2022-02-20 14:21:00,936 INFO L87 Difference]: Start difference. First operand has 49 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 82 states. [2022-02-20 14:21:00,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:21:00,938 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2022-02-20 14:21:00,938 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2022-02-20 14:21:00,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:21:00,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:21:00,939 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:21:00,939 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:21:00,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:00,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2022-02-20 14:21:00,941 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 63 transitions. Word has length 25 [2022-02-20 14:21:00,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:21:00,943 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 63 transitions. [2022-02-20 14:21:00,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:00,943 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2022-02-20 14:21:00,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 14:21:00,944 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:21:00,944 INFO L514 BasicCegarLoop]: trace histogram [4, 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:21:00,970 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:21:01,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:21:01,170 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:21:01,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:21:01,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1522127699, now seen corresponding path program 1 times [2022-02-20 14:21:01,171 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:21:01,171 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366325831] [2022-02-20 14:21:01,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:21:01,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:21:01,188 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:21:01,193 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [998756567] [2022-02-20 14:21:01,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:21:01,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:21:01,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:21:01,194 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:21:01,195 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:21:01,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:21:01,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 14:21:01,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:21:01,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:21:01,404 INFO L290 TraceCheckUtils]: 0: Hoare triple {2341#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(19, 2);call #Ultimate.allocInit(12, 3); {2341#true} is VALID [2022-02-20 14:21:01,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {2341#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~p~0#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;main_~n~0#1 := 1000;main_~p~0#1 := 500;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~n~0#1 * main_~n~0#1);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~n~0#1 * main_~n~0#1);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~p~0#1 < main_~n~0#1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2349#(<= 1000 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:01,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {2349#(<= 1000 |ULTIMATE.start_main_~n~0#1|)} assume !(0 == assume_abort_if_not_~cond#1); {2349#(<= 1000 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:01,406 INFO L290 TraceCheckUtils]: 3: Hoare triple {2349#(<= 1000 |ULTIMATE.start_main_~n~0#1|)} assume { :end_inline_assume_abort_if_not } true;main_~i~0#1 := 0;main_~j~0#1 := 0;main_~k~0#1 := 0; {2349#(<= 1000 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:01,406 INFO L290 TraceCheckUtils]: 4: Hoare triple {2349#(<= 1000 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0;main_~k~0#1 := 0; {2349#(<= 1000 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:01,407 INFO L290 TraceCheckUtils]: 5: Hoare triple {2349#(<= 1000 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);main_~k~0#1 := 0; {2362#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 0))} is VALID [2022-02-20 14:21:01,408 INFO L290 TraceCheckUtils]: 6: Hoare triple {2362#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 0))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {2366#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 1))} is VALID [2022-02-20 14:21:01,408 INFO L290 TraceCheckUtils]: 7: Hoare triple {2366#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 1))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {2370#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 2))} is VALID [2022-02-20 14:21:01,409 INFO L290 TraceCheckUtils]: 8: Hoare triple {2370#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 2))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {2374#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 3))} is VALID [2022-02-20 14:21:01,410 INFO L290 TraceCheckUtils]: 9: Hoare triple {2374#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 3))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {2378#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 4))} is VALID [2022-02-20 14:21:01,412 INFO L290 TraceCheckUtils]: 10: Hoare triple {2378#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 4))} assume !(main_~k~0#1 < main_~n~0#1); {2342#false} is VALID [2022-02-20 14:21:01,413 INFO L290 TraceCheckUtils]: 11: Hoare triple {2342#false} main_~j~0#1 := 1 + main_~j~0#1; {2342#false} is VALID [2022-02-20 14:21:01,413 INFO L290 TraceCheckUtils]: 12: Hoare triple {2342#false} assume !(main_~j~0#1 < main_~n~0#1); {2342#false} is VALID [2022-02-20 14:21:01,413 INFO L290 TraceCheckUtils]: 13: Hoare triple {2342#false} main_~i~0#1 := 1 + main_~i~0#1; {2342#false} is VALID [2022-02-20 14:21:01,413 INFO L290 TraceCheckUtils]: 14: Hoare triple {2342#false} assume !(main_~i~0#1 < main_~n~0#1); {2342#false} is VALID [2022-02-20 14:21:01,413 INFO L290 TraceCheckUtils]: 15: Hoare triple {2342#false} main_~i~0#1 := 0;main_~j~0#1 := 0;main_~k~0#1 := 0; {2342#false} is VALID [2022-02-20 14:21:01,413 INFO L290 TraceCheckUtils]: 16: Hoare triple {2342#false} assume !!(main_~i~0#1 < main_~p~0#1);main_~j~0#1 := 0;main_~k~0#1 := 0; {2342#false} is VALID [2022-02-20 14:21:01,413 INFO L290 TraceCheckUtils]: 17: Hoare triple {2342#false} assume !(main_~j~0#1 < main_~p~0#1); {2342#false} is VALID [2022-02-20 14:21:01,414 INFO L290 TraceCheckUtils]: 18: Hoare triple {2342#false} main_~i~0#1 := 1 + main_~i~0#1; {2342#false} is VALID [2022-02-20 14:21:01,414 INFO L290 TraceCheckUtils]: 19: Hoare triple {2342#false} assume !(main_~i~0#1 < main_~p~0#1); {2342#false} is VALID [2022-02-20 14:21:01,414 INFO L290 TraceCheckUtils]: 20: Hoare triple {2342#false} main_~i~0#1 := main_~p~0#1; {2342#false} is VALID [2022-02-20 14:21:01,414 INFO L290 TraceCheckUtils]: 21: Hoare triple {2342#false} assume !(main_~i~0#1 < main_~n~0#1); {2342#false} is VALID [2022-02-20 14:21:01,414 INFO L290 TraceCheckUtils]: 22: Hoare triple {2342#false} main_~i~0#1 := 0;main_~j~0#1 := 0;main_~k~0#1 := 0; {2342#false} is VALID [2022-02-20 14:21:01,414 INFO L290 TraceCheckUtils]: 23: Hoare triple {2342#false} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0;main_~k~0#1 := 0; {2342#false} is VALID [2022-02-20 14:21:01,414 INFO L290 TraceCheckUtils]: 24: Hoare triple {2342#false} assume !!(main_~j~0#1 < main_~n~0#1);main_~k~0#1 := 0; {2342#false} is VALID [2022-02-20 14:21:01,415 INFO L290 TraceCheckUtils]: 25: Hoare triple {2342#false} assume !!(main_~k~0#1 < main_~n~0#1);call main_#t~mem7#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);call main_#t~mem8#1 := read~int(main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 == main_#t~mem8#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2342#false} is VALID [2022-02-20 14:21:01,415 INFO L290 TraceCheckUtils]: 26: Hoare triple {2342#false} assume 0 == __VERIFIER_assert_~cond#1; {2342#false} is VALID [2022-02-20 14:21:01,415 INFO L290 TraceCheckUtils]: 27: Hoare triple {2342#false} assume !false; {2342#false} is VALID [2022-02-20 14:21:01,415 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:21:01,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:21:01,578 INFO L290 TraceCheckUtils]: 27: Hoare triple {2342#false} assume !false; {2342#false} is VALID [2022-02-20 14:21:01,578 INFO L290 TraceCheckUtils]: 26: Hoare triple {2342#false} assume 0 == __VERIFIER_assert_~cond#1; {2342#false} is VALID [2022-02-20 14:21:01,578 INFO L290 TraceCheckUtils]: 25: Hoare triple {2342#false} assume !!(main_~k~0#1 < main_~n~0#1);call main_#t~mem7#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);call main_#t~mem8#1 := read~int(main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 == main_#t~mem8#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2342#false} is VALID [2022-02-20 14:21:01,579 INFO L290 TraceCheckUtils]: 24: Hoare triple {2342#false} assume !!(main_~j~0#1 < main_~n~0#1);main_~k~0#1 := 0; {2342#false} is VALID [2022-02-20 14:21:01,579 INFO L290 TraceCheckUtils]: 23: Hoare triple {2342#false} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0;main_~k~0#1 := 0; {2342#false} is VALID [2022-02-20 14:21:01,579 INFO L290 TraceCheckUtils]: 22: Hoare triple {2342#false} main_~i~0#1 := 0;main_~j~0#1 := 0;main_~k~0#1 := 0; {2342#false} is VALID [2022-02-20 14:21:01,579 INFO L290 TraceCheckUtils]: 21: Hoare triple {2342#false} assume !(main_~i~0#1 < main_~n~0#1); {2342#false} is VALID [2022-02-20 14:21:01,579 INFO L290 TraceCheckUtils]: 20: Hoare triple {2342#false} main_~i~0#1 := main_~p~0#1; {2342#false} is VALID [2022-02-20 14:21:01,579 INFO L290 TraceCheckUtils]: 19: Hoare triple {2342#false} assume !(main_~i~0#1 < main_~p~0#1); {2342#false} is VALID [2022-02-20 14:21:01,579 INFO L290 TraceCheckUtils]: 18: Hoare triple {2342#false} main_~i~0#1 := 1 + main_~i~0#1; {2342#false} is VALID [2022-02-20 14:21:01,579 INFO L290 TraceCheckUtils]: 17: Hoare triple {2342#false} assume !(main_~j~0#1 < main_~p~0#1); {2342#false} is VALID [2022-02-20 14:21:01,580 INFO L290 TraceCheckUtils]: 16: Hoare triple {2342#false} assume !!(main_~i~0#1 < main_~p~0#1);main_~j~0#1 := 0;main_~k~0#1 := 0; {2342#false} is VALID [2022-02-20 14:21:01,580 INFO L290 TraceCheckUtils]: 15: Hoare triple {2342#false} main_~i~0#1 := 0;main_~j~0#1 := 0;main_~k~0#1 := 0; {2342#false} is VALID [2022-02-20 14:21:01,580 INFO L290 TraceCheckUtils]: 14: Hoare triple {2342#false} assume !(main_~i~0#1 < main_~n~0#1); {2342#false} is VALID [2022-02-20 14:21:01,580 INFO L290 TraceCheckUtils]: 13: Hoare triple {2342#false} main_~i~0#1 := 1 + main_~i~0#1; {2342#false} is VALID [2022-02-20 14:21:01,580 INFO L290 TraceCheckUtils]: 12: Hoare triple {2342#false} assume !(main_~j~0#1 < main_~n~0#1); {2342#false} is VALID [2022-02-20 14:21:01,580 INFO L290 TraceCheckUtils]: 11: Hoare triple {2342#false} main_~j~0#1 := 1 + main_~j~0#1; {2342#false} is VALID [2022-02-20 14:21:01,581 INFO L290 TraceCheckUtils]: 10: Hoare triple {2484#(< |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~n~0#1|)} assume !(main_~k~0#1 < main_~n~0#1); {2342#false} is VALID [2022-02-20 14:21:01,581 INFO L290 TraceCheckUtils]: 9: Hoare triple {2488#(< (+ |ULTIMATE.start_main_~k~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {2484#(< |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:01,582 INFO L290 TraceCheckUtils]: 8: Hoare triple {2492#(< (+ 2 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {2488#(< (+ |ULTIMATE.start_main_~k~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:01,583 INFO L290 TraceCheckUtils]: 7: Hoare triple {2496#(< (+ 3 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {2492#(< (+ 2 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:01,583 INFO L290 TraceCheckUtils]: 6: Hoare triple {2500#(< (+ |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {2496#(< (+ 3 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:01,584 INFO L290 TraceCheckUtils]: 5: Hoare triple {2504#(< 4 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);main_~k~0#1 := 0; {2500#(< (+ |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:01,584 INFO L290 TraceCheckUtils]: 4: Hoare triple {2504#(< 4 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0;main_~k~0#1 := 0; {2504#(< 4 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:01,585 INFO L290 TraceCheckUtils]: 3: Hoare triple {2504#(< 4 |ULTIMATE.start_main_~n~0#1|)} assume { :end_inline_assume_abort_if_not } true;main_~i~0#1 := 0;main_~j~0#1 := 0;main_~k~0#1 := 0; {2504#(< 4 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:01,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {2504#(< 4 |ULTIMATE.start_main_~n~0#1|)} assume !(0 == assume_abort_if_not_~cond#1); {2504#(< 4 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:01,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {2341#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~p~0#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;main_~n~0#1 := 1000;main_~p~0#1 := 500;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~n~0#1 * main_~n~0#1);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~n~0#1 * main_~n~0#1);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~p~0#1 < main_~n~0#1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2504#(< 4 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:01,586 INFO L290 TraceCheckUtils]: 0: Hoare triple {2341#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(19, 2);call #Ultimate.allocInit(12, 3); {2341#true} is VALID [2022-02-20 14:21:01,586 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:21:01,586 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:21:01,586 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366325831] [2022-02-20 14:21:01,586 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:21:01,586 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998756567] [2022-02-20 14:21:01,587 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998756567] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:21:01,587 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:21:01,587 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-02-20 14:21:01,587 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101344494] [2022-02-20 14:21:01,587 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:21:01,587 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-02-20 14:21:01,588 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:21:01,588 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:01,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:21:01,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 14:21:01,615 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:21:01,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 14:21:01,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2022-02-20 14:21:01,616 INFO L87 Difference]: Start difference. First operand 49 states and 63 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:02,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:21:02,520 INFO L93 Difference]: Finished difference Result 236 states and 323 transitions. [2022-02-20 14:21:02,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 14:21:02,521 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-02-20 14:21:02,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:21:02,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:02,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 302 transitions. [2022-02-20 14:21:02,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:02,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 302 transitions. [2022-02-20 14:21:02,525 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 302 transitions. [2022-02-20 14:21:02,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 302 edges. 302 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:21:02,756 INFO L225 Difference]: With dead ends: 236 [2022-02-20 14:21:02,756 INFO L226 Difference]: Without dead ends: 192 [2022-02-20 14:21:02,757 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=151, Invalid=191, Unknown=0, NotChecked=0, Total=342 [2022-02-20 14:21:02,757 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 416 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 14:21:02,757 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [416 Valid, 133 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 14:21:02,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-02-20 14:21:02,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 73. [2022-02-20 14:21:02,903 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:21:02,903 INFO L82 GeneralOperation]: Start isEquivalent. First operand 192 states. Second operand has 73 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 72 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:02,903 INFO L74 IsIncluded]: Start isIncluded. First operand 192 states. Second operand has 73 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 72 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:02,904 INFO L87 Difference]: Start difference. First operand 192 states. Second operand has 73 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 72 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:02,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:21:02,907 INFO L93 Difference]: Finished difference Result 192 states and 253 transitions. [2022-02-20 14:21:02,907 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 253 transitions. [2022-02-20 14:21:02,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:21:02,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:21:02,908 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 72 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 192 states. [2022-02-20 14:21:02,908 INFO L87 Difference]: Start difference. First operand has 73 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 72 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 192 states. [2022-02-20 14:21:02,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:21:02,911 INFO L93 Difference]: Finished difference Result 192 states and 253 transitions. [2022-02-20 14:21:02,911 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 253 transitions. [2022-02-20 14:21:02,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:21:02,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:21:02,912 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:21:02,912 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:21:02,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 72 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:02,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 93 transitions. [2022-02-20 14:21:02,914 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 93 transitions. Word has length 28 [2022-02-20 14:21:02,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:21:02,914 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 93 transitions. [2022-02-20 14:21:02,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:02,915 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 93 transitions. [2022-02-20 14:21:02,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 14:21:02,916 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:21:02,916 INFO L514 BasicCegarLoop]: trace histogram [10, 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:21:02,937 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:21:03,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:21:03,137 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:21:03,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:21:03,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1337282643, now seen corresponding path program 2 times [2022-02-20 14:21:03,138 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:21:03,138 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732235951] [2022-02-20 14:21:03,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:21:03,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:21:03,162 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:21:03,162 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [920680452] [2022-02-20 14:21:03,162 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:21:03,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:21:03,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:21:03,179 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:21:03,180 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:21:03,235 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-20 14:21:03,235 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:21:03,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 14:21:03,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:21:03,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:21:03,528 INFO L290 TraceCheckUtils]: 0: Hoare triple {3392#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(19, 2);call #Ultimate.allocInit(12, 3); {3392#true} is VALID [2022-02-20 14:21:03,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {3392#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~p~0#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;main_~n~0#1 := 1000;main_~p~0#1 := 500;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~n~0#1 * main_~n~0#1);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~n~0#1 * main_~n~0#1);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~p~0#1 < main_~n~0#1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {3400#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:03,529 INFO L290 TraceCheckUtils]: 2: Hoare triple {3400#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !(0 == assume_abort_if_not_~cond#1); {3400#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:03,530 INFO L290 TraceCheckUtils]: 3: Hoare triple {3400#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume { :end_inline_assume_abort_if_not } true;main_~i~0#1 := 0;main_~j~0#1 := 0;main_~k~0#1 := 0; {3400#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:03,530 INFO L290 TraceCheckUtils]: 4: Hoare triple {3400#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0;main_~k~0#1 := 0; {3400#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:03,531 INFO L290 TraceCheckUtils]: 5: Hoare triple {3400#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~j~0#1 < main_~n~0#1);main_~k~0#1 := 0; {3400#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:03,531 INFO L290 TraceCheckUtils]: 6: Hoare triple {3400#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {3400#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:03,532 INFO L290 TraceCheckUtils]: 7: Hoare triple {3400#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {3400#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:03,532 INFO L290 TraceCheckUtils]: 8: Hoare triple {3400#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {3400#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:03,533 INFO L290 TraceCheckUtils]: 9: Hoare triple {3400#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {3400#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:03,537 INFO L290 TraceCheckUtils]: 10: Hoare triple {3400#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {3400#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:03,539 INFO L290 TraceCheckUtils]: 11: Hoare triple {3400#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {3400#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:03,539 INFO L290 TraceCheckUtils]: 12: Hoare triple {3400#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {3400#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:03,540 INFO L290 TraceCheckUtils]: 13: Hoare triple {3400#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {3400#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:03,540 INFO L290 TraceCheckUtils]: 14: Hoare triple {3400#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {3400#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:03,541 INFO L290 TraceCheckUtils]: 15: Hoare triple {3400#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {3400#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:03,541 INFO L290 TraceCheckUtils]: 16: Hoare triple {3400#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !(main_~k~0#1 < main_~n~0#1); {3400#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:03,542 INFO L290 TraceCheckUtils]: 17: Hoare triple {3400#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} main_~j~0#1 := 1 + main_~j~0#1; {3400#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:03,542 INFO L290 TraceCheckUtils]: 18: Hoare triple {3400#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !(main_~j~0#1 < main_~n~0#1); {3400#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:03,543 INFO L290 TraceCheckUtils]: 19: Hoare triple {3400#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} main_~i~0#1 := 1 + main_~i~0#1; {3400#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:03,543 INFO L290 TraceCheckUtils]: 20: Hoare triple {3400#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !(main_~i~0#1 < main_~n~0#1); {3400#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:03,543 INFO L290 TraceCheckUtils]: 21: Hoare triple {3400#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} main_~i~0#1 := 0;main_~j~0#1 := 0;main_~k~0#1 := 0; {3400#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:03,544 INFO L290 TraceCheckUtils]: 22: Hoare triple {3400#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~i~0#1 < main_~p~0#1);main_~j~0#1 := 0;main_~k~0#1 := 0; {3400#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:03,544 INFO L290 TraceCheckUtils]: 23: Hoare triple {3400#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !(main_~j~0#1 < main_~p~0#1); {3400#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:03,545 INFO L290 TraceCheckUtils]: 24: Hoare triple {3400#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} main_~i~0#1 := 1 + main_~i~0#1; {3400#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:03,545 INFO L290 TraceCheckUtils]: 25: Hoare triple {3400#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !(main_~i~0#1 < main_~p~0#1); {3400#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:03,545 INFO L290 TraceCheckUtils]: 26: Hoare triple {3400#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} main_~i~0#1 := main_~p~0#1; {3476#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 500))} is VALID [2022-02-20 14:21:03,546 INFO L290 TraceCheckUtils]: 27: Hoare triple {3476#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 500))} assume !(main_~i~0#1 < main_~n~0#1); {3393#false} is VALID [2022-02-20 14:21:03,546 INFO L290 TraceCheckUtils]: 28: Hoare triple {3393#false} main_~i~0#1 := 0;main_~j~0#1 := 0;main_~k~0#1 := 0; {3393#false} is VALID [2022-02-20 14:21:03,546 INFO L290 TraceCheckUtils]: 29: Hoare triple {3393#false} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0;main_~k~0#1 := 0; {3393#false} is VALID [2022-02-20 14:21:03,547 INFO L290 TraceCheckUtils]: 30: Hoare triple {3393#false} assume !!(main_~j~0#1 < main_~n~0#1);main_~k~0#1 := 0; {3393#false} is VALID [2022-02-20 14:21:03,547 INFO L290 TraceCheckUtils]: 31: Hoare triple {3393#false} assume !!(main_~k~0#1 < main_~n~0#1);call main_#t~mem7#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);call main_#t~mem8#1 := read~int(main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 == main_#t~mem8#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3393#false} is VALID [2022-02-20 14:21:03,547 INFO L290 TraceCheckUtils]: 32: Hoare triple {3393#false} assume 0 == __VERIFIER_assert_~cond#1; {3393#false} is VALID [2022-02-20 14:21:03,547 INFO L290 TraceCheckUtils]: 33: Hoare triple {3393#false} assume !false; {3393#false} is VALID [2022-02-20 14:21:03,547 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-02-20 14:21:03,548 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:21:03,548 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:21:03,548 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732235951] [2022-02-20 14:21:03,548 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:21:03,548 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920680452] [2022-02-20 14:21:03,548 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920680452] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:21:03,548 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:21:03,549 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 14:21:03,549 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396399626] [2022-02-20 14:21:03,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:21:03,549 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-02-20 14:21:03,549 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:21:03,550 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:03,565 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:21:03,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:21:03,566 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:21:03,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:21:03,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:21:03,567 INFO L87 Difference]: Start difference. First operand 73 states and 93 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:03,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:21:03,961 INFO L93 Difference]: Finished difference Result 170 states and 217 transitions. [2022-02-20 14:21:03,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 14:21:03,961 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-02-20 14:21:03,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:21:03,963 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:03,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2022-02-20 14:21:03,965 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:03,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2022-02-20 14:21:03,966 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 81 transitions. [2022-02-20 14:21:04,032 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:21:04,034 INFO L225 Difference]: With dead ends: 170 [2022-02-20 14:21:04,034 INFO L226 Difference]: Without dead ends: 131 [2022-02-20 14:21:04,036 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:21:04,037 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 69 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:21:04,038 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 24 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:21:04,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-02-20 14:21:04,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 74. [2022-02-20 14:21:04,184 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:21:04,184 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand has 74 states, 73 states have (on average 1.2876712328767124) internal successors, (94), 73 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:04,184 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand has 74 states, 73 states have (on average 1.2876712328767124) internal successors, (94), 73 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:04,186 INFO L87 Difference]: Start difference. First operand 131 states. Second operand has 74 states, 73 states have (on average 1.2876712328767124) internal successors, (94), 73 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:04,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:21:04,189 INFO L93 Difference]: Finished difference Result 131 states and 166 transitions. [2022-02-20 14:21:04,189 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 166 transitions. [2022-02-20 14:21:04,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:21:04,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:21:04,191 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 73 states have (on average 1.2876712328767124) internal successors, (94), 73 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 131 states. [2022-02-20 14:21:04,192 INFO L87 Difference]: Start difference. First operand has 74 states, 73 states have (on average 1.2876712328767124) internal successors, (94), 73 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 131 states. [2022-02-20 14:21:04,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:21:04,195 INFO L93 Difference]: Finished difference Result 131 states and 166 transitions. [2022-02-20 14:21:04,195 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 166 transitions. [2022-02-20 14:21:04,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:21:04,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:21:04,196 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:21:04,196 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:21:04,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.2876712328767124) internal successors, (94), 73 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:04,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 94 transitions. [2022-02-20 14:21:04,198 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 94 transitions. Word has length 34 [2022-02-20 14:21:04,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:21:04,199 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 94 transitions. [2022-02-20 14:21:04,199 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:04,199 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2022-02-20 14:21:04,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 14:21:04,199 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:21:04,200 INFO L514 BasicCegarLoop]: trace histogram [10, 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:21:04,219 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:21:04,415 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,SelfDestructingSolverStorable7 [2022-02-20 14:21:04,415 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:21:04,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:21:04,416 INFO L85 PathProgramCache]: Analyzing trace with hash 253285028, now seen corresponding path program 1 times [2022-02-20 14:21:04,416 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:21:04,416 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147196628] [2022-02-20 14:21:04,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:21:04,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:21:04,456 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:21:04,457 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1190862084] [2022-02-20 14:21:04,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:21:04,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:21:04,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:21:04,472 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:21:04,507 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:21:04,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:21:04,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 14:21:04,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:21:04,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:21:05,000 INFO L290 TraceCheckUtils]: 0: Hoare triple {4162#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(19, 2);call #Ultimate.allocInit(12, 3); {4162#true} is VALID [2022-02-20 14:21:05,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {4162#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~p~0#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;main_~n~0#1 := 1000;main_~p~0#1 := 500;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~n~0#1 * main_~n~0#1);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~n~0#1 * main_~n~0#1);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~p~0#1 < main_~n~0#1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {4170#(<= 1000 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:05,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {4170#(<= 1000 |ULTIMATE.start_main_~n~0#1|)} assume !(0 == assume_abort_if_not_~cond#1); {4170#(<= 1000 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:05,002 INFO L290 TraceCheckUtils]: 3: Hoare triple {4170#(<= 1000 |ULTIMATE.start_main_~n~0#1|)} assume { :end_inline_assume_abort_if_not } true;main_~i~0#1 := 0;main_~j~0#1 := 0;main_~k~0#1 := 0; {4170#(<= 1000 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:05,002 INFO L290 TraceCheckUtils]: 4: Hoare triple {4170#(<= 1000 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0;main_~k~0#1 := 0; {4170#(<= 1000 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:05,002 INFO L290 TraceCheckUtils]: 5: Hoare triple {4170#(<= 1000 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);main_~k~0#1 := 0; {4183#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 0))} is VALID [2022-02-20 14:21:05,003 INFO L290 TraceCheckUtils]: 6: Hoare triple {4183#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 0))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {4187#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 1))} is VALID [2022-02-20 14:21:05,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {4187#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 1))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {4191#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 2))} is VALID [2022-02-20 14:21:05,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {4191#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 2))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {4195#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 3))} is VALID [2022-02-20 14:21:05,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {4195#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 3))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {4199#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 4))} is VALID [2022-02-20 14:21:05,006 INFO L290 TraceCheckUtils]: 10: Hoare triple {4199#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 4))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {4203#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5))} is VALID [2022-02-20 14:21:05,007 INFO L290 TraceCheckUtils]: 11: Hoare triple {4203#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {4207#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 6))} is VALID [2022-02-20 14:21:05,008 INFO L290 TraceCheckUtils]: 12: Hoare triple {4207#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 6))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {4211#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 7))} is VALID [2022-02-20 14:21:05,008 INFO L290 TraceCheckUtils]: 13: Hoare triple {4211#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 7))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {4215#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 8))} is VALID [2022-02-20 14:21:05,009 INFO L290 TraceCheckUtils]: 14: Hoare triple {4215#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 8))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {4219#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 9))} is VALID [2022-02-20 14:21:05,019 INFO L290 TraceCheckUtils]: 15: Hoare triple {4219#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 9))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {4223#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 10))} is VALID [2022-02-20 14:21:05,020 INFO L290 TraceCheckUtils]: 16: Hoare triple {4223#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 10))} assume !(main_~k~0#1 < main_~n~0#1); {4163#false} is VALID [2022-02-20 14:21:05,021 INFO L290 TraceCheckUtils]: 17: Hoare triple {4163#false} main_~j~0#1 := 1 + main_~j~0#1; {4163#false} is VALID [2022-02-20 14:21:05,021 INFO L290 TraceCheckUtils]: 18: Hoare triple {4163#false} assume !(main_~j~0#1 < main_~n~0#1); {4163#false} is VALID [2022-02-20 14:21:05,021 INFO L290 TraceCheckUtils]: 19: Hoare triple {4163#false} main_~i~0#1 := 1 + main_~i~0#1; {4163#false} is VALID [2022-02-20 14:21:05,021 INFO L290 TraceCheckUtils]: 20: Hoare triple {4163#false} assume !(main_~i~0#1 < main_~n~0#1); {4163#false} is VALID [2022-02-20 14:21:05,021 INFO L290 TraceCheckUtils]: 21: Hoare triple {4163#false} main_~i~0#1 := 0;main_~j~0#1 := 0;main_~k~0#1 := 0; {4163#false} is VALID [2022-02-20 14:21:05,021 INFO L290 TraceCheckUtils]: 22: Hoare triple {4163#false} assume !!(main_~i~0#1 < main_~p~0#1);main_~j~0#1 := 0;main_~k~0#1 := 0; {4163#false} is VALID [2022-02-20 14:21:05,021 INFO L290 TraceCheckUtils]: 23: Hoare triple {4163#false} assume !(main_~j~0#1 < main_~p~0#1); {4163#false} is VALID [2022-02-20 14:21:05,022 INFO L290 TraceCheckUtils]: 24: Hoare triple {4163#false} main_~i~0#1 := 1 + main_~i~0#1; {4163#false} is VALID [2022-02-20 14:21:05,022 INFO L290 TraceCheckUtils]: 25: Hoare triple {4163#false} assume !(main_~i~0#1 < main_~p~0#1); {4163#false} is VALID [2022-02-20 14:21:05,022 INFO L290 TraceCheckUtils]: 26: Hoare triple {4163#false} main_~i~0#1 := main_~p~0#1; {4163#false} is VALID [2022-02-20 14:21:05,022 INFO L290 TraceCheckUtils]: 27: Hoare triple {4163#false} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := main_~p~0#1; {4163#false} is VALID [2022-02-20 14:21:05,022 INFO L290 TraceCheckUtils]: 28: Hoare triple {4163#false} assume !(main_~j~0#1 < main_~n~0#1); {4163#false} is VALID [2022-02-20 14:21:05,022 INFO L290 TraceCheckUtils]: 29: Hoare triple {4163#false} main_~i~0#1 := 1 + main_~i~0#1; {4163#false} is VALID [2022-02-20 14:21:05,022 INFO L290 TraceCheckUtils]: 30: Hoare triple {4163#false} assume !(main_~i~0#1 < main_~n~0#1); {4163#false} is VALID [2022-02-20 14:21:05,023 INFO L290 TraceCheckUtils]: 31: Hoare triple {4163#false} main_~i~0#1 := 0;main_~j~0#1 := 0;main_~k~0#1 := 0; {4163#false} is VALID [2022-02-20 14:21:05,023 INFO L290 TraceCheckUtils]: 32: Hoare triple {4163#false} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0;main_~k~0#1 := 0; {4163#false} is VALID [2022-02-20 14:21:05,023 INFO L290 TraceCheckUtils]: 33: Hoare triple {4163#false} assume !!(main_~j~0#1 < main_~n~0#1);main_~k~0#1 := 0; {4163#false} is VALID [2022-02-20 14:21:05,023 INFO L290 TraceCheckUtils]: 34: Hoare triple {4163#false} assume !!(main_~k~0#1 < main_~n~0#1);call main_#t~mem7#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);call main_#t~mem8#1 := read~int(main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 == main_#t~mem8#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {4163#false} is VALID [2022-02-20 14:21:05,023 INFO L290 TraceCheckUtils]: 35: Hoare triple {4163#false} assume 0 == __VERIFIER_assert_~cond#1; {4163#false} is VALID [2022-02-20 14:21:05,023 INFO L290 TraceCheckUtils]: 36: Hoare triple {4163#false} assume !false; {4163#false} is VALID [2022-02-20 14:21:05,024 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 2 proven. 55 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 14:21:05,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:21:05,381 INFO L290 TraceCheckUtils]: 36: Hoare triple {4163#false} assume !false; {4163#false} is VALID [2022-02-20 14:21:05,381 INFO L290 TraceCheckUtils]: 35: Hoare triple {4163#false} assume 0 == __VERIFIER_assert_~cond#1; {4163#false} is VALID [2022-02-20 14:21:05,382 INFO L290 TraceCheckUtils]: 34: Hoare triple {4163#false} assume !!(main_~k~0#1 < main_~n~0#1);call main_#t~mem7#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);call main_#t~mem8#1 := read~int(main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 == main_#t~mem8#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {4163#false} is VALID [2022-02-20 14:21:05,382 INFO L290 TraceCheckUtils]: 33: Hoare triple {4163#false} assume !!(main_~j~0#1 < main_~n~0#1);main_~k~0#1 := 0; {4163#false} is VALID [2022-02-20 14:21:05,382 INFO L290 TraceCheckUtils]: 32: Hoare triple {4163#false} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0;main_~k~0#1 := 0; {4163#false} is VALID [2022-02-20 14:21:05,383 INFO L290 TraceCheckUtils]: 31: Hoare triple {4163#false} main_~i~0#1 := 0;main_~j~0#1 := 0;main_~k~0#1 := 0; {4163#false} is VALID [2022-02-20 14:21:05,383 INFO L290 TraceCheckUtils]: 30: Hoare triple {4163#false} assume !(main_~i~0#1 < main_~n~0#1); {4163#false} is VALID [2022-02-20 14:21:05,383 INFO L290 TraceCheckUtils]: 29: Hoare triple {4163#false} main_~i~0#1 := 1 + main_~i~0#1; {4163#false} is VALID [2022-02-20 14:21:05,383 INFO L290 TraceCheckUtils]: 28: Hoare triple {4163#false} assume !(main_~j~0#1 < main_~n~0#1); {4163#false} is VALID [2022-02-20 14:21:05,383 INFO L290 TraceCheckUtils]: 27: Hoare triple {4163#false} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := main_~p~0#1; {4163#false} is VALID [2022-02-20 14:21:05,383 INFO L290 TraceCheckUtils]: 26: Hoare triple {4163#false} main_~i~0#1 := main_~p~0#1; {4163#false} is VALID [2022-02-20 14:21:05,384 INFO L290 TraceCheckUtils]: 25: Hoare triple {4163#false} assume !(main_~i~0#1 < main_~p~0#1); {4163#false} is VALID [2022-02-20 14:21:05,384 INFO L290 TraceCheckUtils]: 24: Hoare triple {4163#false} main_~i~0#1 := 1 + main_~i~0#1; {4163#false} is VALID [2022-02-20 14:21:05,384 INFO L290 TraceCheckUtils]: 23: Hoare triple {4163#false} assume !(main_~j~0#1 < main_~p~0#1); {4163#false} is VALID [2022-02-20 14:21:05,384 INFO L290 TraceCheckUtils]: 22: Hoare triple {4163#false} assume !!(main_~i~0#1 < main_~p~0#1);main_~j~0#1 := 0;main_~k~0#1 := 0; {4163#false} is VALID [2022-02-20 14:21:05,384 INFO L290 TraceCheckUtils]: 21: Hoare triple {4163#false} main_~i~0#1 := 0;main_~j~0#1 := 0;main_~k~0#1 := 0; {4163#false} is VALID [2022-02-20 14:21:05,384 INFO L290 TraceCheckUtils]: 20: Hoare triple {4163#false} assume !(main_~i~0#1 < main_~n~0#1); {4163#false} is VALID [2022-02-20 14:21:05,384 INFO L290 TraceCheckUtils]: 19: Hoare triple {4163#false} main_~i~0#1 := 1 + main_~i~0#1; {4163#false} is VALID [2022-02-20 14:21:05,385 INFO L290 TraceCheckUtils]: 18: Hoare triple {4163#false} assume !(main_~j~0#1 < main_~n~0#1); {4163#false} is VALID [2022-02-20 14:21:05,385 INFO L290 TraceCheckUtils]: 17: Hoare triple {4163#false} main_~j~0#1 := 1 + main_~j~0#1; {4163#false} is VALID [2022-02-20 14:21:05,386 INFO L290 TraceCheckUtils]: 16: Hoare triple {4347#(< |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~n~0#1|)} assume !(main_~k~0#1 < main_~n~0#1); {4163#false} is VALID [2022-02-20 14:21:05,387 INFO L290 TraceCheckUtils]: 15: Hoare triple {4351#(< (+ |ULTIMATE.start_main_~k~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {4347#(< |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:05,388 INFO L290 TraceCheckUtils]: 14: Hoare triple {4355#(< (+ 2 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {4351#(< (+ |ULTIMATE.start_main_~k~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:05,388 INFO L290 TraceCheckUtils]: 13: Hoare triple {4359#(< (+ 3 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {4355#(< (+ 2 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:05,389 INFO L290 TraceCheckUtils]: 12: Hoare triple {4363#(< (+ |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {4359#(< (+ 3 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:05,390 INFO L290 TraceCheckUtils]: 11: Hoare triple {4367#(< (+ 5 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {4363#(< (+ |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:05,391 INFO L290 TraceCheckUtils]: 10: Hoare triple {4371#(< (+ 6 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {4367#(< (+ 5 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:05,391 INFO L290 TraceCheckUtils]: 9: Hoare triple {4375#(< (+ 7 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {4371#(< (+ 6 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:05,392 INFO L290 TraceCheckUtils]: 8: Hoare triple {4379#(< (+ |ULTIMATE.start_main_~k~0#1| 8) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {4375#(< (+ 7 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:05,393 INFO L290 TraceCheckUtils]: 7: Hoare triple {4383#(< (+ 9 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {4379#(< (+ |ULTIMATE.start_main_~k~0#1| 8) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:05,394 INFO L290 TraceCheckUtils]: 6: Hoare triple {4387#(< (+ |ULTIMATE.start_main_~k~0#1| 10) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {4383#(< (+ 9 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:05,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {4391#(< 10 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);main_~k~0#1 := 0; {4387#(< (+ |ULTIMATE.start_main_~k~0#1| 10) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:05,395 INFO L290 TraceCheckUtils]: 4: Hoare triple {4391#(< 10 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0;main_~k~0#1 := 0; {4391#(< 10 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:05,395 INFO L290 TraceCheckUtils]: 3: Hoare triple {4391#(< 10 |ULTIMATE.start_main_~n~0#1|)} assume { :end_inline_assume_abort_if_not } true;main_~i~0#1 := 0;main_~j~0#1 := 0;main_~k~0#1 := 0; {4391#(< 10 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:05,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {4391#(< 10 |ULTIMATE.start_main_~n~0#1|)} assume !(0 == assume_abort_if_not_~cond#1); {4391#(< 10 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:05,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {4162#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~p~0#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;main_~n~0#1 := 1000;main_~p~0#1 := 500;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~n~0#1 * main_~n~0#1);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~n~0#1 * main_~n~0#1);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~p~0#1 < main_~n~0#1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {4391#(< 10 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:05,397 INFO L290 TraceCheckUtils]: 0: Hoare triple {4162#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(19, 2);call #Ultimate.allocInit(12, 3); {4162#true} is VALID [2022-02-20 14:21:05,398 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 2 proven. 55 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 14:21:05,398 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:21:05,399 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147196628] [2022-02-20 14:21:05,399 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:21:05,399 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190862084] [2022-02-20 14:21:05,399 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190862084] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:21:05,399 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:21:05,399 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-02-20 14:21:05,401 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332441984] [2022-02-20 14:21:05,401 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:21:05,403 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 26 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-02-20 14:21:05,403 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:21:05,404 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 26 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:05,442 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:21:05,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-02-20 14:21:05,442 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:21:05,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-02-20 14:21:05,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=347, Unknown=0, NotChecked=0, Total=650 [2022-02-20 14:21:05,443 INFO L87 Difference]: Start difference. First operand 74 states and 94 transitions. Second operand has 26 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 26 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:08,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:21:08,727 INFO L93 Difference]: Finished difference Result 476 states and 641 transitions. [2022-02-20 14:21:08,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-02-20 14:21:08,727 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 26 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-02-20 14:21:08,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:21:08,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 26 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:08,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 566 transitions. [2022-02-20 14:21:08,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 26 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:08,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 566 transitions. [2022-02-20 14:21:08,746 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 566 transitions. [2022-02-20 14:21:09,227 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 566 edges. 566 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:21:09,235 INFO L225 Difference]: With dead ends: 476 [2022-02-20 14:21:09,235 INFO L226 Difference]: Without dead ends: 407 [2022-02-20 14:21:09,240 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=589, Invalid=743, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 14:21:09,241 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 1228 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 563 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1228 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 563 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 14:21:09,242 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1228 Valid, 242 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [563 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 14:21:09,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2022-02-20 14:21:09,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 122. [2022-02-20 14:21:09,580 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:21:09,580 INFO L82 GeneralOperation]: Start isEquivalent. First operand 407 states. Second operand has 122 states, 121 states have (on average 1.2727272727272727) internal successors, (154), 121 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:09,581 INFO L74 IsIncluded]: Start isIncluded. First operand 407 states. Second operand has 122 states, 121 states have (on average 1.2727272727272727) internal successors, (154), 121 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:09,581 INFO L87 Difference]: Start difference. First operand 407 states. Second operand has 122 states, 121 states have (on average 1.2727272727272727) internal successors, (154), 121 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:09,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:21:09,589 INFO L93 Difference]: Finished difference Result 407 states and 528 transitions. [2022-02-20 14:21:09,589 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 528 transitions. [2022-02-20 14:21:09,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:21:09,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:21:09,593 INFO L74 IsIncluded]: Start isIncluded. First operand has 122 states, 121 states have (on average 1.2727272727272727) internal successors, (154), 121 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 407 states. [2022-02-20 14:21:09,593 INFO L87 Difference]: Start difference. First operand has 122 states, 121 states have (on average 1.2727272727272727) internal successors, (154), 121 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 407 states. [2022-02-20 14:21:09,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:21:09,605 INFO L93 Difference]: Finished difference Result 407 states and 528 transitions. [2022-02-20 14:21:09,605 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 528 transitions. [2022-02-20 14:21:09,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:21:09,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:21:09,606 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:21:09,606 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:21:09,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 1.2727272727272727) internal successors, (154), 121 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:09,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 154 transitions. [2022-02-20 14:21:09,608 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 154 transitions. Word has length 37 [2022-02-20 14:21:09,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:21:09,608 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 154 transitions. [2022-02-20 14:21:09,609 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 26 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:09,609 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 154 transitions. [2022-02-20 14:21:09,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-02-20 14:21:09,610 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:21:09,610 INFO L514 BasicCegarLoop]: trace histogram [22, 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:21:09,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-02-20 14:21:09,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:21:09,827 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:21:09,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:21:09,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1853672612, now seen corresponding path program 2 times [2022-02-20 14:21:09,828 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:21:09,828 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102539352] [2022-02-20 14:21:09,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:21:09,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:21:09,861 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:21:09,862 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1447984173] [2022-02-20 14:21:09,862 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:21:09,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:21:09,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:21:09,863 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:21:09,899 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:21:09,979 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:21:09,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:21:09,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 25 conjunts are in the unsatisfiable core [2022-02-20 14:21:10,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:21:10,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:21:10,699 INFO L290 TraceCheckUtils]: 0: Hoare triple {6185#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(19, 2);call #Ultimate.allocInit(12, 3); {6185#true} is VALID [2022-02-20 14:21:10,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {6185#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~p~0#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;main_~n~0#1 := 1000;main_~p~0#1 := 500;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~n~0#1 * main_~n~0#1);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~n~0#1 * main_~n~0#1);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~p~0#1 < main_~n~0#1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {6193#(<= 1000 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:10,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {6193#(<= 1000 |ULTIMATE.start_main_~n~0#1|)} assume !(0 == assume_abort_if_not_~cond#1); {6193#(<= 1000 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:10,701 INFO L290 TraceCheckUtils]: 3: Hoare triple {6193#(<= 1000 |ULTIMATE.start_main_~n~0#1|)} assume { :end_inline_assume_abort_if_not } true;main_~i~0#1 := 0;main_~j~0#1 := 0;main_~k~0#1 := 0; {6193#(<= 1000 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:10,701 INFO L290 TraceCheckUtils]: 4: Hoare triple {6193#(<= 1000 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0;main_~k~0#1 := 0; {6193#(<= 1000 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:10,702 INFO L290 TraceCheckUtils]: 5: Hoare triple {6193#(<= 1000 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);main_~k~0#1 := 0; {6206#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 0))} is VALID [2022-02-20 14:21:10,703 INFO L290 TraceCheckUtils]: 6: Hoare triple {6206#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 0))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {6210#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 1))} is VALID [2022-02-20 14:21:10,703 INFO L290 TraceCheckUtils]: 7: Hoare triple {6210#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 1))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {6214#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 2))} is VALID [2022-02-20 14:21:10,704 INFO L290 TraceCheckUtils]: 8: Hoare triple {6214#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 2))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {6218#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 3))} is VALID [2022-02-20 14:21:10,705 INFO L290 TraceCheckUtils]: 9: Hoare triple {6218#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 3))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {6222#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 4))} is VALID [2022-02-20 14:21:10,705 INFO L290 TraceCheckUtils]: 10: Hoare triple {6222#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 4))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {6226#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5))} is VALID [2022-02-20 14:21:10,706 INFO L290 TraceCheckUtils]: 11: Hoare triple {6226#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {6230#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 6))} is VALID [2022-02-20 14:21:10,707 INFO L290 TraceCheckUtils]: 12: Hoare triple {6230#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 6))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {6234#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 7))} is VALID [2022-02-20 14:21:10,707 INFO L290 TraceCheckUtils]: 13: Hoare triple {6234#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 7))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {6238#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 8))} is VALID [2022-02-20 14:21:10,708 INFO L290 TraceCheckUtils]: 14: Hoare triple {6238#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 8))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {6242#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 9))} is VALID [2022-02-20 14:21:10,709 INFO L290 TraceCheckUtils]: 15: Hoare triple {6242#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 9))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {6246#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 10))} is VALID [2022-02-20 14:21:10,710 INFO L290 TraceCheckUtils]: 16: Hoare triple {6246#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 10))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {6250#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 11))} is VALID [2022-02-20 14:21:10,710 INFO L290 TraceCheckUtils]: 17: Hoare triple {6250#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 11))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {6254#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 12))} is VALID [2022-02-20 14:21:10,711 INFO L290 TraceCheckUtils]: 18: Hoare triple {6254#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 12))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {6258#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 13))} is VALID [2022-02-20 14:21:10,712 INFO L290 TraceCheckUtils]: 19: Hoare triple {6258#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 13))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {6262#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 14))} is VALID [2022-02-20 14:21:10,712 INFO L290 TraceCheckUtils]: 20: Hoare triple {6262#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 14))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {6266#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 15))} is VALID [2022-02-20 14:21:10,713 INFO L290 TraceCheckUtils]: 21: Hoare triple {6266#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 15))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {6270#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 16))} is VALID [2022-02-20 14:21:10,714 INFO L290 TraceCheckUtils]: 22: Hoare triple {6270#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 16))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {6274#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 17))} is VALID [2022-02-20 14:21:10,714 INFO L290 TraceCheckUtils]: 23: Hoare triple {6274#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 17))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {6278#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 18))} is VALID [2022-02-20 14:21:10,715 INFO L290 TraceCheckUtils]: 24: Hoare triple {6278#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 18))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {6282#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 19))} is VALID [2022-02-20 14:21:10,716 INFO L290 TraceCheckUtils]: 25: Hoare triple {6282#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 19))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {6286#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 20))} is VALID [2022-02-20 14:21:10,716 INFO L290 TraceCheckUtils]: 26: Hoare triple {6286#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 20))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {6290#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 21))} is VALID [2022-02-20 14:21:10,717 INFO L290 TraceCheckUtils]: 27: Hoare triple {6290#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 21))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {6294#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 22))} is VALID [2022-02-20 14:21:10,718 INFO L290 TraceCheckUtils]: 28: Hoare triple {6294#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 22))} assume !(main_~k~0#1 < main_~n~0#1); {6186#false} is VALID [2022-02-20 14:21:10,718 INFO L290 TraceCheckUtils]: 29: Hoare triple {6186#false} main_~j~0#1 := 1 + main_~j~0#1; {6186#false} is VALID [2022-02-20 14:21:10,718 INFO L290 TraceCheckUtils]: 30: Hoare triple {6186#false} assume !(main_~j~0#1 < main_~n~0#1); {6186#false} is VALID [2022-02-20 14:21:10,718 INFO L290 TraceCheckUtils]: 31: Hoare triple {6186#false} main_~i~0#1 := 1 + main_~i~0#1; {6186#false} is VALID [2022-02-20 14:21:10,718 INFO L290 TraceCheckUtils]: 32: Hoare triple {6186#false} assume !(main_~i~0#1 < main_~n~0#1); {6186#false} is VALID [2022-02-20 14:21:10,718 INFO L290 TraceCheckUtils]: 33: Hoare triple {6186#false} main_~i~0#1 := 0;main_~j~0#1 := 0;main_~k~0#1 := 0; {6186#false} is VALID [2022-02-20 14:21:10,718 INFO L290 TraceCheckUtils]: 34: Hoare triple {6186#false} assume !!(main_~i~0#1 < main_~p~0#1);main_~j~0#1 := 0;main_~k~0#1 := 0; {6186#false} is VALID [2022-02-20 14:21:10,718 INFO L290 TraceCheckUtils]: 35: Hoare triple {6186#false} assume !(main_~j~0#1 < main_~p~0#1); {6186#false} is VALID [2022-02-20 14:21:10,718 INFO L290 TraceCheckUtils]: 36: Hoare triple {6186#false} main_~i~0#1 := 1 + main_~i~0#1; {6186#false} is VALID [2022-02-20 14:21:10,719 INFO L290 TraceCheckUtils]: 37: Hoare triple {6186#false} assume !(main_~i~0#1 < main_~p~0#1); {6186#false} is VALID [2022-02-20 14:21:10,719 INFO L290 TraceCheckUtils]: 38: Hoare triple {6186#false} main_~i~0#1 := main_~p~0#1; {6186#false} is VALID [2022-02-20 14:21:10,719 INFO L290 TraceCheckUtils]: 39: Hoare triple {6186#false} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := main_~p~0#1; {6186#false} is VALID [2022-02-20 14:21:10,719 INFO L290 TraceCheckUtils]: 40: Hoare triple {6186#false} assume !(main_~j~0#1 < main_~n~0#1); {6186#false} is VALID [2022-02-20 14:21:10,719 INFO L290 TraceCheckUtils]: 41: Hoare triple {6186#false} main_~i~0#1 := 1 + main_~i~0#1; {6186#false} is VALID [2022-02-20 14:21:10,719 INFO L290 TraceCheckUtils]: 42: Hoare triple {6186#false} assume !(main_~i~0#1 < main_~n~0#1); {6186#false} is VALID [2022-02-20 14:21:10,719 INFO L290 TraceCheckUtils]: 43: Hoare triple {6186#false} main_~i~0#1 := 0;main_~j~0#1 := 0;main_~k~0#1 := 0; {6186#false} is VALID [2022-02-20 14:21:10,719 INFO L290 TraceCheckUtils]: 44: Hoare triple {6186#false} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0;main_~k~0#1 := 0; {6186#false} is VALID [2022-02-20 14:21:10,719 INFO L290 TraceCheckUtils]: 45: Hoare triple {6186#false} assume !!(main_~j~0#1 < main_~n~0#1);main_~k~0#1 := 0; {6186#false} is VALID [2022-02-20 14:21:10,719 INFO L290 TraceCheckUtils]: 46: Hoare triple {6186#false} assume !!(main_~k~0#1 < main_~n~0#1);call main_#t~mem7#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);call main_#t~mem8#1 := read~int(main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 == main_#t~mem8#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {6186#false} is VALID [2022-02-20 14:21:10,719 INFO L290 TraceCheckUtils]: 47: Hoare triple {6186#false} assume 0 == __VERIFIER_assert_~cond#1; {6186#false} is VALID [2022-02-20 14:21:10,719 INFO L290 TraceCheckUtils]: 48: Hoare triple {6186#false} assume !false; {6186#false} is VALID [2022-02-20 14:21:10,720 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 2 proven. 253 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 14:21:10,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:21:11,802 INFO L290 TraceCheckUtils]: 48: Hoare triple {6186#false} assume !false; {6186#false} is VALID [2022-02-20 14:21:11,802 INFO L290 TraceCheckUtils]: 47: Hoare triple {6186#false} assume 0 == __VERIFIER_assert_~cond#1; {6186#false} is VALID [2022-02-20 14:21:11,802 INFO L290 TraceCheckUtils]: 46: Hoare triple {6186#false} assume !!(main_~k~0#1 < main_~n~0#1);call main_#t~mem7#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);call main_#t~mem8#1 := read~int(main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 == main_#t~mem8#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {6186#false} is VALID [2022-02-20 14:21:11,802 INFO L290 TraceCheckUtils]: 45: Hoare triple {6186#false} assume !!(main_~j~0#1 < main_~n~0#1);main_~k~0#1 := 0; {6186#false} is VALID [2022-02-20 14:21:11,802 INFO L290 TraceCheckUtils]: 44: Hoare triple {6186#false} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0;main_~k~0#1 := 0; {6186#false} is VALID [2022-02-20 14:21:11,802 INFO L290 TraceCheckUtils]: 43: Hoare triple {6186#false} main_~i~0#1 := 0;main_~j~0#1 := 0;main_~k~0#1 := 0; {6186#false} is VALID [2022-02-20 14:21:11,802 INFO L290 TraceCheckUtils]: 42: Hoare triple {6186#false} assume !(main_~i~0#1 < main_~n~0#1); {6186#false} is VALID [2022-02-20 14:21:11,802 INFO L290 TraceCheckUtils]: 41: Hoare triple {6186#false} main_~i~0#1 := 1 + main_~i~0#1; {6186#false} is VALID [2022-02-20 14:21:11,802 INFO L290 TraceCheckUtils]: 40: Hoare triple {6186#false} assume !(main_~j~0#1 < main_~n~0#1); {6186#false} is VALID [2022-02-20 14:21:11,802 INFO L290 TraceCheckUtils]: 39: Hoare triple {6186#false} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := main_~p~0#1; {6186#false} is VALID [2022-02-20 14:21:11,802 INFO L290 TraceCheckUtils]: 38: Hoare triple {6186#false} main_~i~0#1 := main_~p~0#1; {6186#false} is VALID [2022-02-20 14:21:11,802 INFO L290 TraceCheckUtils]: 37: Hoare triple {6186#false} assume !(main_~i~0#1 < main_~p~0#1); {6186#false} is VALID [2022-02-20 14:21:11,803 INFO L290 TraceCheckUtils]: 36: Hoare triple {6186#false} main_~i~0#1 := 1 + main_~i~0#1; {6186#false} is VALID [2022-02-20 14:21:11,803 INFO L290 TraceCheckUtils]: 35: Hoare triple {6186#false} assume !(main_~j~0#1 < main_~p~0#1); {6186#false} is VALID [2022-02-20 14:21:11,803 INFO L290 TraceCheckUtils]: 34: Hoare triple {6186#false} assume !!(main_~i~0#1 < main_~p~0#1);main_~j~0#1 := 0;main_~k~0#1 := 0; {6186#false} is VALID [2022-02-20 14:21:11,803 INFO L290 TraceCheckUtils]: 33: Hoare triple {6186#false} main_~i~0#1 := 0;main_~j~0#1 := 0;main_~k~0#1 := 0; {6186#false} is VALID [2022-02-20 14:21:11,803 INFO L290 TraceCheckUtils]: 32: Hoare triple {6186#false} assume !(main_~i~0#1 < main_~n~0#1); {6186#false} is VALID [2022-02-20 14:21:11,803 INFO L290 TraceCheckUtils]: 31: Hoare triple {6186#false} main_~i~0#1 := 1 + main_~i~0#1; {6186#false} is VALID [2022-02-20 14:21:11,803 INFO L290 TraceCheckUtils]: 30: Hoare triple {6186#false} assume !(main_~j~0#1 < main_~n~0#1); {6186#false} is VALID [2022-02-20 14:21:11,803 INFO L290 TraceCheckUtils]: 29: Hoare triple {6186#false} main_~j~0#1 := 1 + main_~j~0#1; {6186#false} is VALID [2022-02-20 14:21:11,804 INFO L290 TraceCheckUtils]: 28: Hoare triple {6418#(< |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~n~0#1|)} assume !(main_~k~0#1 < main_~n~0#1); {6186#false} is VALID [2022-02-20 14:21:11,805 INFO L290 TraceCheckUtils]: 27: Hoare triple {6422#(< (+ |ULTIMATE.start_main_~k~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {6418#(< |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:11,805 INFO L290 TraceCheckUtils]: 26: Hoare triple {6426#(< (+ 2 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {6422#(< (+ |ULTIMATE.start_main_~k~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:11,806 INFO L290 TraceCheckUtils]: 25: Hoare triple {6430#(< (+ 3 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {6426#(< (+ 2 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:11,807 INFO L290 TraceCheckUtils]: 24: Hoare triple {6434#(< (+ |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {6430#(< (+ 3 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:11,807 INFO L290 TraceCheckUtils]: 23: Hoare triple {6438#(< (+ 5 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {6434#(< (+ |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:11,808 INFO L290 TraceCheckUtils]: 22: Hoare triple {6442#(< (+ 6 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {6438#(< (+ 5 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:11,809 INFO L290 TraceCheckUtils]: 21: Hoare triple {6446#(< (+ 7 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {6442#(< (+ 6 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:11,809 INFO L290 TraceCheckUtils]: 20: Hoare triple {6450#(< (+ |ULTIMATE.start_main_~k~0#1| 8) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {6446#(< (+ 7 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:11,810 INFO L290 TraceCheckUtils]: 19: Hoare triple {6454#(< (+ 9 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {6450#(< (+ |ULTIMATE.start_main_~k~0#1| 8) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:11,812 INFO L290 TraceCheckUtils]: 18: Hoare triple {6458#(< (+ |ULTIMATE.start_main_~k~0#1| 10) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {6454#(< (+ 9 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:11,812 INFO L290 TraceCheckUtils]: 17: Hoare triple {6462#(< (+ |ULTIMATE.start_main_~k~0#1| 11) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {6458#(< (+ |ULTIMATE.start_main_~k~0#1| 10) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:11,813 INFO L290 TraceCheckUtils]: 16: Hoare triple {6466#(< (+ |ULTIMATE.start_main_~k~0#1| 12) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {6462#(< (+ |ULTIMATE.start_main_~k~0#1| 11) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:11,814 INFO L290 TraceCheckUtils]: 15: Hoare triple {6470#(< (+ |ULTIMATE.start_main_~k~0#1| 13) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {6466#(< (+ |ULTIMATE.start_main_~k~0#1| 12) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:11,815 INFO L290 TraceCheckUtils]: 14: Hoare triple {6474#(< (+ 14 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {6470#(< (+ |ULTIMATE.start_main_~k~0#1| 13) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:11,816 INFO L290 TraceCheckUtils]: 13: Hoare triple {6478#(< (+ |ULTIMATE.start_main_~k~0#1| 15) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {6474#(< (+ 14 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:11,817 INFO L290 TraceCheckUtils]: 12: Hoare triple {6482#(< (+ 16 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {6478#(< (+ |ULTIMATE.start_main_~k~0#1| 15) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:11,818 INFO L290 TraceCheckUtils]: 11: Hoare triple {6486#(< (+ |ULTIMATE.start_main_~k~0#1| 17) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {6482#(< (+ 16 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:11,818 INFO L290 TraceCheckUtils]: 10: Hoare triple {6490#(< (+ |ULTIMATE.start_main_~k~0#1| 18) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {6486#(< (+ |ULTIMATE.start_main_~k~0#1| 17) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:11,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {6494#(< (+ 19 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {6490#(< (+ |ULTIMATE.start_main_~k~0#1| 18) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:11,820 INFO L290 TraceCheckUtils]: 8: Hoare triple {6498#(< (+ |ULTIMATE.start_main_~k~0#1| 20) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {6494#(< (+ 19 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:11,820 INFO L290 TraceCheckUtils]: 7: Hoare triple {6502#(< (+ 21 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {6498#(< (+ |ULTIMATE.start_main_~k~0#1| 20) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:11,821 INFO L290 TraceCheckUtils]: 6: Hoare triple {6506#(< (+ 22 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {6502#(< (+ 21 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:11,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {6510#(< 22 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);main_~k~0#1 := 0; {6506#(< (+ 22 |ULTIMATE.start_main_~k~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:11,822 INFO L290 TraceCheckUtils]: 4: Hoare triple {6510#(< 22 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0;main_~k~0#1 := 0; {6510#(< 22 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:11,822 INFO L290 TraceCheckUtils]: 3: Hoare triple {6510#(< 22 |ULTIMATE.start_main_~n~0#1|)} assume { :end_inline_assume_abort_if_not } true;main_~i~0#1 := 0;main_~j~0#1 := 0;main_~k~0#1 := 0; {6510#(< 22 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:11,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {6510#(< 22 |ULTIMATE.start_main_~n~0#1|)} assume !(0 == assume_abort_if_not_~cond#1); {6510#(< 22 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:11,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {6185#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~p~0#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;main_~n~0#1 := 1000;main_~p~0#1 := 500;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~n~0#1 * main_~n~0#1);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~n~0#1 * main_~n~0#1);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~p~0#1 < main_~n~0#1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {6510#(< 22 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:11,823 INFO L290 TraceCheckUtils]: 0: Hoare triple {6185#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(19, 2);call #Ultimate.allocInit(12, 3); {6185#true} is VALID [2022-02-20 14:21:11,824 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 2 proven. 253 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 14:21:11,824 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:21:11,824 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102539352] [2022-02-20 14:21:11,824 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:21:11,824 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447984173] [2022-02-20 14:21:11,824 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447984173] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:21:11,824 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:21:11,824 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-02-20 14:21:11,824 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858672133] [2022-02-20 14:21:11,824 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:21:11,825 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.54) internal successors, (77), 50 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-02-20 14:21:11,825 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:21:11,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 50 states, 50 states have (on average 1.54) internal successors, (77), 50 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:11,881 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:21:11,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-02-20 14:21:11,882 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:21:11,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-02-20 14:21:11,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1179, Invalid=1271, Unknown=0, NotChecked=0, Total=2450 [2022-02-20 14:21:11,883 INFO L87 Difference]: Start difference. First operand 122 states and 154 transitions. Second operand has 50 states, 50 states have (on average 1.54) internal successors, (77), 50 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:20,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:21:20,291 INFO L93 Difference]: Finished difference Result 932 states and 1253 transitions. [2022-02-20 14:21:20,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-02-20 14:21:20,292 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.54) internal successors, (77), 50 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-02-20 14:21:20,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:21:20,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.54) internal successors, (77), 50 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:20,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 1094 transitions. [2022-02-20 14:21:20,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.54) internal successors, (77), 50 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:20,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 1094 transitions. [2022-02-20 14:21:20,302 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states and 1094 transitions. [2022-02-20 14:21:21,482 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1094 edges. 1094 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:21:21,511 INFO L225 Difference]: With dead ends: 932 [2022-02-20 14:21:21,511 INFO L226 Difference]: Without dead ends: 815 [2022-02-20 14:21:21,513 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2329, Invalid=2927, Unknown=0, NotChecked=0, Total=5256 [2022-02-20 14:21:21,513 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 2220 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 690 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2220 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 1158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 690 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:21:21,514 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2220 Valid, 489 Invalid, 1158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [690 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 14:21:21,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2022-02-20 14:21:22,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 218. [2022-02-20 14:21:22,164 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:21:22,164 INFO L82 GeneralOperation]: Start isEquivalent. First operand 815 states. Second operand has 218 states, 217 states have (on average 1.262672811059908) internal successors, (274), 217 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:22,169 INFO L74 IsIncluded]: Start isIncluded. First operand 815 states. Second operand has 218 states, 217 states have (on average 1.262672811059908) internal successors, (274), 217 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:22,169 INFO L87 Difference]: Start difference. First operand 815 states. Second operand has 218 states, 217 states have (on average 1.262672811059908) internal successors, (274), 217 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:22,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:21:22,201 INFO L93 Difference]: Finished difference Result 815 states and 1056 transitions. [2022-02-20 14:21:22,201 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1056 transitions. [2022-02-20 14:21:22,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:21:22,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:21:22,204 INFO L74 IsIncluded]: Start isIncluded. First operand has 218 states, 217 states have (on average 1.262672811059908) internal successors, (274), 217 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 815 states. [2022-02-20 14:21:22,204 INFO L87 Difference]: Start difference. First operand has 218 states, 217 states have (on average 1.262672811059908) internal successors, (274), 217 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 815 states. [2022-02-20 14:21:22,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:21:22,237 INFO L93 Difference]: Finished difference Result 815 states and 1056 transitions. [2022-02-20 14:21:22,237 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1056 transitions. [2022-02-20 14:21:22,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:21:22,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:21:22,239 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:21:22,239 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:21:22,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 217 states have (on average 1.262672811059908) internal successors, (274), 217 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:22,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 274 transitions. [2022-02-20 14:21:22,245 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 274 transitions. Word has length 49 [2022-02-20 14:21:22,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:21:22,245 INFO L470 AbstractCegarLoop]: Abstraction has 218 states and 274 transitions. [2022-02-20 14:21:22,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.54) internal successors, (77), 50 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:22,245 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 274 transitions. [2022-02-20 14:21:22,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 14:21:22,246 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:21:22,246 INFO L514 BasicCegarLoop]: trace histogram [46, 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:21:22,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-02-20 14:21:22,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-02-20 14:21:22,470 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:21:22,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:21:22,471 INFO L85 PathProgramCache]: Analyzing trace with hash 391102628, now seen corresponding path program 3 times [2022-02-20 14:21:22,471 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:21:22,471 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995272943] [2022-02-20 14:21:22,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:21:22,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:21:22,527 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:21:22,527 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1727806694] [2022-02-20 14:21:22,527 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 14:21:22,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:21:22,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:21:22,529 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:21:22,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-02-20 14:21:22,637 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-20 14:21:22,638 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:21:22,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 14:21:22,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:21:22,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:21:23,171 INFO L290 TraceCheckUtils]: 0: Hoare triple {10020#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(19, 2);call #Ultimate.allocInit(12, 3); {10020#true} is VALID [2022-02-20 14:21:23,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {10020#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~p~0#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;main_~n~0#1 := 1000;main_~p~0#1 := 500;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~n~0#1 * main_~n~0#1);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~n~0#1 * main_~n~0#1);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~p~0#1 < main_~n~0#1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !(0 == assume_abort_if_not_~cond#1); {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,173 INFO L290 TraceCheckUtils]: 3: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume { :end_inline_assume_abort_if_not } true;main_~i~0#1 := 0;main_~j~0#1 := 0;main_~k~0#1 := 0; {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,173 INFO L290 TraceCheckUtils]: 4: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0;main_~k~0#1 := 0; {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,173 INFO L290 TraceCheckUtils]: 5: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~j~0#1 < main_~n~0#1);main_~k~0#1 := 0; {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,174 INFO L290 TraceCheckUtils]: 6: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,174 INFO L290 TraceCheckUtils]: 7: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,175 INFO L290 TraceCheckUtils]: 8: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,175 INFO L290 TraceCheckUtils]: 9: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,176 INFO L290 TraceCheckUtils]: 10: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,176 INFO L290 TraceCheckUtils]: 11: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,177 INFO L290 TraceCheckUtils]: 12: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,177 INFO L290 TraceCheckUtils]: 13: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,177 INFO L290 TraceCheckUtils]: 14: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,178 INFO L290 TraceCheckUtils]: 15: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,178 INFO L290 TraceCheckUtils]: 16: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,179 INFO L290 TraceCheckUtils]: 17: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,179 INFO L290 TraceCheckUtils]: 18: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,180 INFO L290 TraceCheckUtils]: 19: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,180 INFO L290 TraceCheckUtils]: 20: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,180 INFO L290 TraceCheckUtils]: 21: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,181 INFO L290 TraceCheckUtils]: 22: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,181 INFO L290 TraceCheckUtils]: 23: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,182 INFO L290 TraceCheckUtils]: 24: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,182 INFO L290 TraceCheckUtils]: 25: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,183 INFO L290 TraceCheckUtils]: 26: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,183 INFO L290 TraceCheckUtils]: 27: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,184 INFO L290 TraceCheckUtils]: 28: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,184 INFO L290 TraceCheckUtils]: 29: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,184 INFO L290 TraceCheckUtils]: 30: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,185 INFO L290 TraceCheckUtils]: 31: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,185 INFO L290 TraceCheckUtils]: 32: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,186 INFO L290 TraceCheckUtils]: 33: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,186 INFO L290 TraceCheckUtils]: 34: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,187 INFO L290 TraceCheckUtils]: 35: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,188 INFO L290 TraceCheckUtils]: 36: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,188 INFO L290 TraceCheckUtils]: 37: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,189 INFO L290 TraceCheckUtils]: 38: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,189 INFO L290 TraceCheckUtils]: 39: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,190 INFO L290 TraceCheckUtils]: 40: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,190 INFO L290 TraceCheckUtils]: 41: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,190 INFO L290 TraceCheckUtils]: 42: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,191 INFO L290 TraceCheckUtils]: 43: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,191 INFO L290 TraceCheckUtils]: 44: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,192 INFO L290 TraceCheckUtils]: 45: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,192 INFO L290 TraceCheckUtils]: 46: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,193 INFO L290 TraceCheckUtils]: 47: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,193 INFO L290 TraceCheckUtils]: 48: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,194 INFO L290 TraceCheckUtils]: 49: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,194 INFO L290 TraceCheckUtils]: 50: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,195 INFO L290 TraceCheckUtils]: 51: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,195 INFO L290 TraceCheckUtils]: 52: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !(main_~k~0#1 < main_~n~0#1); {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,196 INFO L290 TraceCheckUtils]: 53: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} main_~j~0#1 := 1 + main_~j~0#1; {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,196 INFO L290 TraceCheckUtils]: 54: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !(main_~j~0#1 < main_~n~0#1); {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,196 INFO L290 TraceCheckUtils]: 55: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} main_~i~0#1 := 1 + main_~i~0#1; {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,197 INFO L290 TraceCheckUtils]: 56: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !(main_~i~0#1 < main_~n~0#1); {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,197 INFO L290 TraceCheckUtils]: 57: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} main_~i~0#1 := 0;main_~j~0#1 := 0;main_~k~0#1 := 0; {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,197 INFO L290 TraceCheckUtils]: 58: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !!(main_~i~0#1 < main_~p~0#1);main_~j~0#1 := 0;main_~k~0#1 := 0; {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,198 INFO L290 TraceCheckUtils]: 59: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !(main_~j~0#1 < main_~p~0#1); {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,198 INFO L290 TraceCheckUtils]: 60: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} main_~i~0#1 := 1 + main_~i~0#1; {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,198 INFO L290 TraceCheckUtils]: 61: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} assume !(main_~i~0#1 < main_~p~0#1); {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} is VALID [2022-02-20 14:21:23,199 INFO L290 TraceCheckUtils]: 62: Hoare triple {10028#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~p~0#1| 500))} main_~i~0#1 := main_~p~0#1; {10212#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 500))} is VALID [2022-02-20 14:21:23,199 INFO L290 TraceCheckUtils]: 63: Hoare triple {10212#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 500))} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := main_~p~0#1; {10212#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 500))} is VALID [2022-02-20 14:21:23,200 INFO L290 TraceCheckUtils]: 64: Hoare triple {10212#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 500))} assume !(main_~j~0#1 < main_~n~0#1); {10212#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 500))} is VALID [2022-02-20 14:21:23,202 INFO L290 TraceCheckUtils]: 65: Hoare triple {10212#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 500))} main_~i~0#1 := 1 + main_~i~0#1; {10222#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 501))} is VALID [2022-02-20 14:21:23,202 INFO L290 TraceCheckUtils]: 66: Hoare triple {10222#(and (<= 1000 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 501))} assume !(main_~i~0#1 < main_~n~0#1); {10021#false} is VALID [2022-02-20 14:21:23,203 INFO L290 TraceCheckUtils]: 67: Hoare triple {10021#false} main_~i~0#1 := 0;main_~j~0#1 := 0;main_~k~0#1 := 0; {10021#false} is VALID [2022-02-20 14:21:23,203 INFO L290 TraceCheckUtils]: 68: Hoare triple {10021#false} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0;main_~k~0#1 := 0; {10021#false} is VALID [2022-02-20 14:21:23,203 INFO L290 TraceCheckUtils]: 69: Hoare triple {10021#false} assume !!(main_~j~0#1 < main_~n~0#1);main_~k~0#1 := 0; {10021#false} is VALID [2022-02-20 14:21:23,203 INFO L290 TraceCheckUtils]: 70: Hoare triple {10021#false} assume !!(main_~k~0#1 < main_~n~0#1);call main_#t~mem7#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);call main_#t~mem8#1 := read~int(main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 == main_#t~mem8#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {10021#false} is VALID [2022-02-20 14:21:23,203 INFO L290 TraceCheckUtils]: 71: Hoare triple {10021#false} assume 0 == __VERIFIER_assert_~cond#1; {10021#false} is VALID [2022-02-20 14:21:23,203 INFO L290 TraceCheckUtils]: 72: Hoare triple {10021#false} assume !false; {10021#false} is VALID [2022-02-20 14:21:23,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1085 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1084 trivial. 0 not checked. [2022-02-20 14:21:23,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:21:23,619 INFO L290 TraceCheckUtils]: 72: Hoare triple {10021#false} assume !false; {10021#false} is VALID [2022-02-20 14:21:23,619 INFO L290 TraceCheckUtils]: 71: Hoare triple {10021#false} assume 0 == __VERIFIER_assert_~cond#1; {10021#false} is VALID [2022-02-20 14:21:23,619 INFO L290 TraceCheckUtils]: 70: Hoare triple {10021#false} assume !!(main_~k~0#1 < main_~n~0#1);call main_#t~mem7#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);call main_#t~mem8#1 := read~int(main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 == main_#t~mem8#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {10021#false} is VALID [2022-02-20 14:21:23,619 INFO L290 TraceCheckUtils]: 69: Hoare triple {10021#false} assume !!(main_~j~0#1 < main_~n~0#1);main_~k~0#1 := 0; {10021#false} is VALID [2022-02-20 14:21:23,619 INFO L290 TraceCheckUtils]: 68: Hoare triple {10021#false} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0;main_~k~0#1 := 0; {10021#false} is VALID [2022-02-20 14:21:23,620 INFO L290 TraceCheckUtils]: 67: Hoare triple {10021#false} main_~i~0#1 := 0;main_~j~0#1 := 0;main_~k~0#1 := 0; {10021#false} is VALID [2022-02-20 14:21:23,620 INFO L290 TraceCheckUtils]: 66: Hoare triple {10262#(< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|)} assume !(main_~i~0#1 < main_~n~0#1); {10021#false} is VALID [2022-02-20 14:21:23,622 INFO L290 TraceCheckUtils]: 65: Hoare triple {10266#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} main_~i~0#1 := 1 + main_~i~0#1; {10262#(< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,623 INFO L290 TraceCheckUtils]: 64: Hoare triple {10266#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !(main_~j~0#1 < main_~n~0#1); {10266#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,623 INFO L290 TraceCheckUtils]: 63: Hoare triple {10266#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := main_~p~0#1; {10266#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,623 INFO L290 TraceCheckUtils]: 62: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} main_~i~0#1 := main_~p~0#1; {10266#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,623 INFO L290 TraceCheckUtils]: 61: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !(main_~i~0#1 < main_~p~0#1); {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,624 INFO L290 TraceCheckUtils]: 60: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} main_~i~0#1 := 1 + main_~i~0#1; {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,624 INFO L290 TraceCheckUtils]: 59: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !(main_~j~0#1 < main_~p~0#1); {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,624 INFO L290 TraceCheckUtils]: 58: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~i~0#1 < main_~p~0#1);main_~j~0#1 := 0;main_~k~0#1 := 0; {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,625 INFO L290 TraceCheckUtils]: 57: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} main_~i~0#1 := 0;main_~j~0#1 := 0;main_~k~0#1 := 0; {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,625 INFO L290 TraceCheckUtils]: 56: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !(main_~i~0#1 < main_~n~0#1); {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,625 INFO L290 TraceCheckUtils]: 55: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} main_~i~0#1 := 1 + main_~i~0#1; {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,625 INFO L290 TraceCheckUtils]: 54: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !(main_~j~0#1 < main_~n~0#1); {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,626 INFO L290 TraceCheckUtils]: 53: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} main_~j~0#1 := 1 + main_~j~0#1; {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,626 INFO L290 TraceCheckUtils]: 52: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !(main_~k~0#1 < main_~n~0#1); {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,626 INFO L290 TraceCheckUtils]: 51: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,627 INFO L290 TraceCheckUtils]: 50: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,627 INFO L290 TraceCheckUtils]: 49: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,627 INFO L290 TraceCheckUtils]: 48: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,627 INFO L290 TraceCheckUtils]: 47: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,628 INFO L290 TraceCheckUtils]: 46: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,628 INFO L290 TraceCheckUtils]: 45: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,628 INFO L290 TraceCheckUtils]: 44: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,629 INFO L290 TraceCheckUtils]: 43: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,629 INFO L290 TraceCheckUtils]: 42: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,629 INFO L290 TraceCheckUtils]: 41: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,629 INFO L290 TraceCheckUtils]: 40: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,630 INFO L290 TraceCheckUtils]: 39: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,630 INFO L290 TraceCheckUtils]: 38: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,630 INFO L290 TraceCheckUtils]: 37: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,631 INFO L290 TraceCheckUtils]: 36: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,631 INFO L290 TraceCheckUtils]: 35: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,631 INFO L290 TraceCheckUtils]: 34: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,632 INFO L290 TraceCheckUtils]: 33: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,632 INFO L290 TraceCheckUtils]: 32: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,632 INFO L290 TraceCheckUtils]: 31: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,632 INFO L290 TraceCheckUtils]: 30: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,633 INFO L290 TraceCheckUtils]: 29: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,633 INFO L290 TraceCheckUtils]: 28: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,633 INFO L290 TraceCheckUtils]: 27: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,634 INFO L290 TraceCheckUtils]: 26: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,634 INFO L290 TraceCheckUtils]: 25: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,634 INFO L290 TraceCheckUtils]: 24: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,634 INFO L290 TraceCheckUtils]: 23: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,635 INFO L290 TraceCheckUtils]: 22: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,635 INFO L290 TraceCheckUtils]: 21: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,635 INFO L290 TraceCheckUtils]: 20: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,636 INFO L290 TraceCheckUtils]: 19: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,636 INFO L290 TraceCheckUtils]: 18: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,636 INFO L290 TraceCheckUtils]: 17: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,636 INFO L290 TraceCheckUtils]: 16: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,637 INFO L290 TraceCheckUtils]: 15: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,637 INFO L290 TraceCheckUtils]: 14: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,637 INFO L290 TraceCheckUtils]: 13: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,638 INFO L290 TraceCheckUtils]: 12: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,638 INFO L290 TraceCheckUtils]: 11: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,638 INFO L290 TraceCheckUtils]: 10: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,638 INFO L290 TraceCheckUtils]: 9: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,639 INFO L290 TraceCheckUtils]: 8: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,639 INFO L290 TraceCheckUtils]: 7: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,639 INFO L290 TraceCheckUtils]: 6: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,640 INFO L290 TraceCheckUtils]: 5: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);main_~k~0#1 := 0; {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,640 INFO L290 TraceCheckUtils]: 4: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0;main_~k~0#1 := 0; {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,640 INFO L290 TraceCheckUtils]: 3: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume { :end_inline_assume_abort_if_not } true;main_~i~0#1 := 0;main_~j~0#1 := 0;main_~k~0#1 := 0; {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,640 INFO L290 TraceCheckUtils]: 2: Hoare triple {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !(0 == assume_abort_if_not_~cond#1); {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {10020#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~p~0#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;main_~n~0#1 := 1000;main_~p~0#1 := 500;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~n~0#1 * main_~n~0#1);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~n~0#1 * main_~n~0#1);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~p~0#1 < main_~n~0#1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {10276#(< (+ |ULTIMATE.start_main_~p~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:23,641 INFO L290 TraceCheckUtils]: 0: Hoare triple {10020#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(19, 2);call #Ultimate.allocInit(12, 3); {10020#true} is VALID [2022-02-20 14:21:23,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1085 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1084 trivial. 0 not checked. [2022-02-20 14:21:23,642 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:21:23,642 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995272943] [2022-02-20 14:21:23,642 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:21:23,642 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727806694] [2022-02-20 14:21:23,642 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727806694] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:21:23,642 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:21:23,642 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-02-20 14:21:23,643 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946242446] [2022-02-20 14:21:23,643 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:21:23,643 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2022-02-20 14:21:23,643 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:21:23,643 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:23,691 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:21:23,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 14:21:23,691 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:21:23,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 14:21:23,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-02-20 14:21:23,692 INFO L87 Difference]: Start difference. First operand 218 states and 274 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:26,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:21:26,401 INFO L93 Difference]: Finished difference Result 989 states and 1257 transitions. [2022-02-20 14:21:26,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 14:21:26,401 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2022-02-20 14:21:26,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:21:26,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:26,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 157 transitions. [2022-02-20 14:21:26,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:26,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 157 transitions. [2022-02-20 14:21:26,404 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 157 transitions. [2022-02-20 14:21:26,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:21:26,712 INFO L225 Difference]: With dead ends: 989 [2022-02-20 14:21:26,713 INFO L226 Difference]: Without dead ends: 828 [2022-02-20 14:21:26,714 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2022-02-20 14:21:26,715 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 260 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 14:21:26,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [260 Valid, 42 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 14:21:26,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2022-02-20 14:21:27,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 389. [2022-02-20 14:21:27,843 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:21:27,844 INFO L82 GeneralOperation]: Start isEquivalent. First operand 828 states. Second operand has 389 states, 388 states have (on average 1.1778350515463918) internal successors, (457), 388 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:27,845 INFO L74 IsIncluded]: Start isIncluded. First operand 828 states. Second operand has 389 states, 388 states have (on average 1.1778350515463918) internal successors, (457), 388 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:27,845 INFO L87 Difference]: Start difference. First operand 828 states. Second operand has 389 states, 388 states have (on average 1.1778350515463918) internal successors, (457), 388 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:27,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:21:27,874 INFO L93 Difference]: Finished difference Result 828 states and 1037 transitions. [2022-02-20 14:21:27,874 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1037 transitions. [2022-02-20 14:21:27,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:21:27,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:21:27,877 INFO L74 IsIncluded]: Start isIncluded. First operand has 389 states, 388 states have (on average 1.1778350515463918) internal successors, (457), 388 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 828 states. [2022-02-20 14:21:27,877 INFO L87 Difference]: Start difference. First operand has 389 states, 388 states have (on average 1.1778350515463918) internal successors, (457), 388 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 828 states. [2022-02-20 14:21:27,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:21:27,910 INFO L93 Difference]: Finished difference Result 828 states and 1037 transitions. [2022-02-20 14:21:27,910 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1037 transitions. [2022-02-20 14:21:27,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:21:27,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:21:27,912 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:21:27,912 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:21:27,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 388 states have (on average 1.1778350515463918) internal successors, (457), 388 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:27,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 457 transitions. [2022-02-20 14:21:27,935 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 457 transitions. Word has length 73 [2022-02-20 14:21:27,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:21:27,936 INFO L470 AbstractCegarLoop]: Abstraction has 389 states and 457 transitions. [2022-02-20 14:21:27,937 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:27,937 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 457 transitions. [2022-02-20 14:21:27,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2022-02-20 14:21:27,943 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:21:27,944 INFO L514 BasicCegarLoop]: trace histogram [184, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:21:27,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-02-20 14:21:28,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-02-20 14:21:28,163 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:21:28,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:21:28,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1903403635, now seen corresponding path program 4 times [2022-02-20 14:21:28,164 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:21:28,164 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174853606] [2022-02-20 14:21:28,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:21:28,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:21:28,357 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:21:28,357 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [150592977] [2022-02-20 14:21:28,357 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 14:21:28,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:21:28,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:21:28,358 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:21:28,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-02-20 14:21:28,642 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 14:21:28,642 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:21:28,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:21:28,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:21:28,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:21:29,619 INFO L290 TraceCheckUtils]: 0: Hoare triple {14525#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(19, 2);call #Ultimate.allocInit(12, 3); {14525#true} is VALID [2022-02-20 14:21:29,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {14525#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~p~0#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;main_~n~0#1 := 1000;main_~p~0#1 := 500;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~n~0#1 * main_~n~0#1);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~n~0#1 * main_~n~0#1);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~p~0#1 < main_~n~0#1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {14525#true} is VALID [2022-02-20 14:21:29,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {14525#true} assume !(0 == assume_abort_if_not_~cond#1); {14525#true} is VALID [2022-02-20 14:21:29,620 INFO L290 TraceCheckUtils]: 3: Hoare triple {14525#true} assume { :end_inline_assume_abort_if_not } true;main_~i~0#1 := 0;main_~j~0#1 := 0;main_~k~0#1 := 0; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:29,621 INFO L290 TraceCheckUtils]: 4: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0;main_~k~0#1 := 0; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:29,621 INFO L290 TraceCheckUtils]: 5: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);main_~k~0#1 := 0; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:29,621 INFO L290 TraceCheckUtils]: 6: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:29,622 INFO L290 TraceCheckUtils]: 7: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:29,622 INFO L290 TraceCheckUtils]: 8: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:29,622 INFO L290 TraceCheckUtils]: 9: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:29,623 INFO L290 TraceCheckUtils]: 10: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:29,623 INFO L290 TraceCheckUtils]: 11: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:29,623 INFO L290 TraceCheckUtils]: 12: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:29,624 INFO L290 TraceCheckUtils]: 13: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:29,624 INFO L290 TraceCheckUtils]: 14: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:29,625 INFO L290 TraceCheckUtils]: 15: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:29,625 INFO L290 TraceCheckUtils]: 16: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:29,625 INFO L290 TraceCheckUtils]: 17: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:29,626 INFO L290 TraceCheckUtils]: 18: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:29,626 INFO L290 TraceCheckUtils]: 19: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:29,626 INFO L290 TraceCheckUtils]: 20: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:29,627 INFO L290 TraceCheckUtils]: 21: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:29,627 INFO L290 TraceCheckUtils]: 22: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:29,627 INFO L290 TraceCheckUtils]: 23: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:29,628 INFO L290 TraceCheckUtils]: 24: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:29,628 INFO L290 TraceCheckUtils]: 25: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:29,628 INFO L290 TraceCheckUtils]: 26: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:29,629 INFO L290 TraceCheckUtils]: 27: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:29,629 INFO L290 TraceCheckUtils]: 28: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:29,629 INFO L290 TraceCheckUtils]: 29: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:29,630 INFO L290 TraceCheckUtils]: 30: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:29,630 INFO L290 TraceCheckUtils]: 31: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:29,630 INFO L290 TraceCheckUtils]: 32: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:29,630 INFO L290 TraceCheckUtils]: 33: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:29,631 INFO L290 TraceCheckUtils]: 34: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:29,631 INFO L290 TraceCheckUtils]: 35: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:29,631 INFO L290 TraceCheckUtils]: 36: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:29,632 INFO L290 TraceCheckUtils]: 37: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:29,632 INFO L290 TraceCheckUtils]: 38: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:29,632 INFO L290 TraceCheckUtils]: 39: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:29,633 INFO L290 TraceCheckUtils]: 40: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:29,633 INFO L290 TraceCheckUtils]: 41: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:29,633 INFO L290 TraceCheckUtils]: 42: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:29,633 INFO L290 TraceCheckUtils]: 43: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:29,634 INFO L290 TraceCheckUtils]: 44: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:29,634 INFO L290 TraceCheckUtils]: 45: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:29,634 INFO L290 TraceCheckUtils]: 46: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:29,635 INFO L290 TraceCheckUtils]: 47: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:29,635 INFO L290 TraceCheckUtils]: 48: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:29,635 INFO L290 TraceCheckUtils]: 49: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:29,636 INFO L290 TraceCheckUtils]: 50: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:29,636 INFO L290 TraceCheckUtils]: 51: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:29,636 INFO L290 TraceCheckUtils]: 52: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~k~0#1 < main_~n~0#1); {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:29,637 INFO L290 TraceCheckUtils]: 53: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_~j~0#1 := 1 + main_~j~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:29,637 INFO L290 TraceCheckUtils]: 54: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~j~0#1 < main_~n~0#1); {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:29,639 INFO L290 TraceCheckUtils]: 55: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_~i~0#1 := 1 + main_~i~0#1; {14696#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:29,640 INFO L290 TraceCheckUtils]: 56: Hoare triple {14696#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0;main_~k~0#1 := 0; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,640 INFO L290 TraceCheckUtils]: 57: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);main_~k~0#1 := 0; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,641 INFO L290 TraceCheckUtils]: 58: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,641 INFO L290 TraceCheckUtils]: 59: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,641 INFO L290 TraceCheckUtils]: 60: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,642 INFO L290 TraceCheckUtils]: 61: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,642 INFO L290 TraceCheckUtils]: 62: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,642 INFO L290 TraceCheckUtils]: 63: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,643 INFO L290 TraceCheckUtils]: 64: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,643 INFO L290 TraceCheckUtils]: 65: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,643 INFO L290 TraceCheckUtils]: 66: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,644 INFO L290 TraceCheckUtils]: 67: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,644 INFO L290 TraceCheckUtils]: 68: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,644 INFO L290 TraceCheckUtils]: 69: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,645 INFO L290 TraceCheckUtils]: 70: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,645 INFO L290 TraceCheckUtils]: 71: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,645 INFO L290 TraceCheckUtils]: 72: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,646 INFO L290 TraceCheckUtils]: 73: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,646 INFO L290 TraceCheckUtils]: 74: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,646 INFO L290 TraceCheckUtils]: 75: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,647 INFO L290 TraceCheckUtils]: 76: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,647 INFO L290 TraceCheckUtils]: 77: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,647 INFO L290 TraceCheckUtils]: 78: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,647 INFO L290 TraceCheckUtils]: 79: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,648 INFO L290 TraceCheckUtils]: 80: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,648 INFO L290 TraceCheckUtils]: 81: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,648 INFO L290 TraceCheckUtils]: 82: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,649 INFO L290 TraceCheckUtils]: 83: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,649 INFO L290 TraceCheckUtils]: 84: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,649 INFO L290 TraceCheckUtils]: 85: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,650 INFO L290 TraceCheckUtils]: 86: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,650 INFO L290 TraceCheckUtils]: 87: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,650 INFO L290 TraceCheckUtils]: 88: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,651 INFO L290 TraceCheckUtils]: 89: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,651 INFO L290 TraceCheckUtils]: 90: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,651 INFO L290 TraceCheckUtils]: 91: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,651 INFO L290 TraceCheckUtils]: 92: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,652 INFO L290 TraceCheckUtils]: 93: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,652 INFO L290 TraceCheckUtils]: 94: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,652 INFO L290 TraceCheckUtils]: 95: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,653 INFO L290 TraceCheckUtils]: 96: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,653 INFO L290 TraceCheckUtils]: 97: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,653 INFO L290 TraceCheckUtils]: 98: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,654 INFO L290 TraceCheckUtils]: 99: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,654 INFO L290 TraceCheckUtils]: 100: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,654 INFO L290 TraceCheckUtils]: 101: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,655 INFO L290 TraceCheckUtils]: 102: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,655 INFO L290 TraceCheckUtils]: 103: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,655 INFO L290 TraceCheckUtils]: 104: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !(main_~k~0#1 < main_~n~0#1); {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,655 INFO L290 TraceCheckUtils]: 105: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} main_~j~0#1 := 1 + main_~j~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,656 INFO L290 TraceCheckUtils]: 106: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !(main_~j~0#1 < main_~n~0#1); {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,656 INFO L290 TraceCheckUtils]: 107: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} main_~i~0#1 := 1 + main_~i~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,657 INFO L290 TraceCheckUtils]: 108: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0;main_~k~0#1 := 0; {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:21:29,657 INFO L290 TraceCheckUtils]: 109: Hoare triple {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~j~0#1 < main_~n~0#1);main_~k~0#1 := 0; {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:21:29,657 INFO L290 TraceCheckUtils]: 110: Hoare triple {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:21:29,658 INFO L290 TraceCheckUtils]: 111: Hoare triple {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:21:29,658 INFO L290 TraceCheckUtils]: 112: Hoare triple {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:21:29,659 INFO L290 TraceCheckUtils]: 113: Hoare triple {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:21:29,659 INFO L290 TraceCheckUtils]: 114: Hoare triple {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:21:29,660 INFO L290 TraceCheckUtils]: 115: Hoare triple {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:21:29,660 INFO L290 TraceCheckUtils]: 116: Hoare triple {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:21:29,661 INFO L290 TraceCheckUtils]: 117: Hoare triple {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:21:29,661 INFO L290 TraceCheckUtils]: 118: Hoare triple {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:21:29,662 INFO L290 TraceCheckUtils]: 119: Hoare triple {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:21:29,662 INFO L290 TraceCheckUtils]: 120: Hoare triple {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:21:29,663 INFO L290 TraceCheckUtils]: 121: Hoare triple {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:21:29,663 INFO L290 TraceCheckUtils]: 122: Hoare triple {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:21:29,664 INFO L290 TraceCheckUtils]: 123: Hoare triple {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:21:29,664 INFO L290 TraceCheckUtils]: 124: Hoare triple {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:21:29,665 INFO L290 TraceCheckUtils]: 125: Hoare triple {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:21:29,665 INFO L290 TraceCheckUtils]: 126: Hoare triple {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:21:29,666 INFO L290 TraceCheckUtils]: 127: Hoare triple {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:21:29,666 INFO L290 TraceCheckUtils]: 128: Hoare triple {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:21:29,667 INFO L290 TraceCheckUtils]: 129: Hoare triple {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:21:29,667 INFO L290 TraceCheckUtils]: 130: Hoare triple {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:21:29,668 INFO L290 TraceCheckUtils]: 131: Hoare triple {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:21:29,668 INFO L290 TraceCheckUtils]: 132: Hoare triple {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:21:29,669 INFO L290 TraceCheckUtils]: 133: Hoare triple {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:21:29,669 INFO L290 TraceCheckUtils]: 134: Hoare triple {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:21:29,670 INFO L290 TraceCheckUtils]: 135: Hoare triple {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:21:29,670 INFO L290 TraceCheckUtils]: 136: Hoare triple {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:21:29,671 INFO L290 TraceCheckUtils]: 137: Hoare triple {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:21:29,671 INFO L290 TraceCheckUtils]: 138: Hoare triple {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:21:29,672 INFO L290 TraceCheckUtils]: 139: Hoare triple {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:21:29,672 INFO L290 TraceCheckUtils]: 140: Hoare triple {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:21:29,673 INFO L290 TraceCheckUtils]: 141: Hoare triple {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:21:29,673 INFO L290 TraceCheckUtils]: 142: Hoare triple {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:21:29,674 INFO L290 TraceCheckUtils]: 143: Hoare triple {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:21:29,674 INFO L290 TraceCheckUtils]: 144: Hoare triple {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:21:29,675 INFO L290 TraceCheckUtils]: 145: Hoare triple {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:21:29,675 INFO L290 TraceCheckUtils]: 146: Hoare triple {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:21:29,676 INFO L290 TraceCheckUtils]: 147: Hoare triple {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:21:29,676 INFO L290 TraceCheckUtils]: 148: Hoare triple {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:21:29,677 INFO L290 TraceCheckUtils]: 149: Hoare triple {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:21:29,677 INFO L290 TraceCheckUtils]: 150: Hoare triple {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:21:29,678 INFO L290 TraceCheckUtils]: 151: Hoare triple {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:21:29,678 INFO L290 TraceCheckUtils]: 152: Hoare triple {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:21:29,678 INFO L290 TraceCheckUtils]: 153: Hoare triple {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:21:29,679 INFO L290 TraceCheckUtils]: 154: Hoare triple {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:21:29,679 INFO L290 TraceCheckUtils]: 155: Hoare triple {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:21:29,680 INFO L290 TraceCheckUtils]: 156: Hoare triple {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !(main_~k~0#1 < main_~n~0#1); {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:21:29,682 INFO L290 TraceCheckUtils]: 157: Hoare triple {14857#(and (< 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} main_~j~0#1 := 1 + main_~j~0#1; {15005#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (< 1 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 14:21:29,683 INFO L290 TraceCheckUtils]: 158: Hoare triple {15005#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (< 1 |ULTIMATE.start_main_~n~0#1|))} assume !(main_~j~0#1 < main_~n~0#1); {14526#false} is VALID [2022-02-20 14:21:29,683 INFO L290 TraceCheckUtils]: 159: Hoare triple {14526#false} main_~i~0#1 := 1 + main_~i~0#1; {14526#false} is VALID [2022-02-20 14:21:29,683 INFO L290 TraceCheckUtils]: 160: Hoare triple {14526#false} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0;main_~k~0#1 := 0; {14526#false} is VALID [2022-02-20 14:21:29,683 INFO L290 TraceCheckUtils]: 161: Hoare triple {14526#false} assume !!(main_~j~0#1 < main_~n~0#1);main_~k~0#1 := 0; {14526#false} is VALID [2022-02-20 14:21:29,683 INFO L290 TraceCheckUtils]: 162: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:29,683 INFO L290 TraceCheckUtils]: 163: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:29,683 INFO L290 TraceCheckUtils]: 164: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:29,683 INFO L290 TraceCheckUtils]: 165: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:29,684 INFO L290 TraceCheckUtils]: 166: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:29,684 INFO L290 TraceCheckUtils]: 167: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:29,684 INFO L290 TraceCheckUtils]: 168: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:29,684 INFO L290 TraceCheckUtils]: 169: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:29,684 INFO L290 TraceCheckUtils]: 170: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:29,684 INFO L290 TraceCheckUtils]: 171: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:29,684 INFO L290 TraceCheckUtils]: 172: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:29,684 INFO L290 TraceCheckUtils]: 173: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:29,684 INFO L290 TraceCheckUtils]: 174: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:29,685 INFO L290 TraceCheckUtils]: 175: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:29,685 INFO L290 TraceCheckUtils]: 176: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:29,685 INFO L290 TraceCheckUtils]: 177: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:29,685 INFO L290 TraceCheckUtils]: 178: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:29,685 INFO L290 TraceCheckUtils]: 179: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:29,685 INFO L290 TraceCheckUtils]: 180: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:29,685 INFO L290 TraceCheckUtils]: 181: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:29,685 INFO L290 TraceCheckUtils]: 182: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:29,685 INFO L290 TraceCheckUtils]: 183: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:29,686 INFO L290 TraceCheckUtils]: 184: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:29,686 INFO L290 TraceCheckUtils]: 185: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:29,686 INFO L290 TraceCheckUtils]: 186: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:29,686 INFO L290 TraceCheckUtils]: 187: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:29,686 INFO L290 TraceCheckUtils]: 188: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:29,686 INFO L290 TraceCheckUtils]: 189: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:29,686 INFO L290 TraceCheckUtils]: 190: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:29,686 INFO L290 TraceCheckUtils]: 191: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:29,686 INFO L290 TraceCheckUtils]: 192: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:29,687 INFO L290 TraceCheckUtils]: 193: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:29,687 INFO L290 TraceCheckUtils]: 194: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:29,687 INFO L290 TraceCheckUtils]: 195: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:29,687 INFO L290 TraceCheckUtils]: 196: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:29,687 INFO L290 TraceCheckUtils]: 197: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:29,687 INFO L290 TraceCheckUtils]: 198: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:29,687 INFO L290 TraceCheckUtils]: 199: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:29,687 INFO L290 TraceCheckUtils]: 200: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:29,687 INFO L290 TraceCheckUtils]: 201: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:29,687 INFO L290 TraceCheckUtils]: 202: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:29,688 INFO L290 TraceCheckUtils]: 203: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:29,688 INFO L290 TraceCheckUtils]: 204: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:29,688 INFO L290 TraceCheckUtils]: 205: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:29,688 INFO L290 TraceCheckUtils]: 206: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:29,688 INFO L290 TraceCheckUtils]: 207: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:29,688 INFO L290 TraceCheckUtils]: 208: Hoare triple {14526#false} assume !(main_~k~0#1 < main_~n~0#1); {14526#false} is VALID [2022-02-20 14:21:29,688 INFO L290 TraceCheckUtils]: 209: Hoare triple {14526#false} main_~j~0#1 := 1 + main_~j~0#1; {14526#false} is VALID [2022-02-20 14:21:29,688 INFO L290 TraceCheckUtils]: 210: Hoare triple {14526#false} assume !(main_~j~0#1 < main_~n~0#1); {14526#false} is VALID [2022-02-20 14:21:29,688 INFO L290 TraceCheckUtils]: 211: Hoare triple {14526#false} main_~i~0#1 := 1 + main_~i~0#1; {14526#false} is VALID [2022-02-20 14:21:29,689 INFO L290 TraceCheckUtils]: 212: Hoare triple {14526#false} assume !(main_~i~0#1 < main_~n~0#1); {14526#false} is VALID [2022-02-20 14:21:29,689 INFO L290 TraceCheckUtils]: 213: Hoare triple {14526#false} main_~i~0#1 := 0;main_~j~0#1 := 0;main_~k~0#1 := 0; {14526#false} is VALID [2022-02-20 14:21:29,689 INFO L290 TraceCheckUtils]: 214: Hoare triple {14526#false} assume !!(main_~i~0#1 < main_~p~0#1);main_~j~0#1 := 0;main_~k~0#1 := 0; {14526#false} is VALID [2022-02-20 14:21:29,689 INFO L290 TraceCheckUtils]: 215: Hoare triple {14526#false} assume !(main_~j~0#1 < main_~p~0#1); {14526#false} is VALID [2022-02-20 14:21:29,689 INFO L290 TraceCheckUtils]: 216: Hoare triple {14526#false} main_~i~0#1 := 1 + main_~i~0#1; {14526#false} is VALID [2022-02-20 14:21:29,689 INFO L290 TraceCheckUtils]: 217: Hoare triple {14526#false} assume !(main_~i~0#1 < main_~p~0#1); {14526#false} is VALID [2022-02-20 14:21:29,689 INFO L290 TraceCheckUtils]: 218: Hoare triple {14526#false} main_~i~0#1 := main_~p~0#1; {14526#false} is VALID [2022-02-20 14:21:29,689 INFO L290 TraceCheckUtils]: 219: Hoare triple {14526#false} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := main_~p~0#1; {14526#false} is VALID [2022-02-20 14:21:29,689 INFO L290 TraceCheckUtils]: 220: Hoare triple {14526#false} assume !(main_~j~0#1 < main_~n~0#1); {14526#false} is VALID [2022-02-20 14:21:29,690 INFO L290 TraceCheckUtils]: 221: Hoare triple {14526#false} main_~i~0#1 := 1 + main_~i~0#1; {14526#false} is VALID [2022-02-20 14:21:29,690 INFO L290 TraceCheckUtils]: 222: Hoare triple {14526#false} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := main_~p~0#1; {14526#false} is VALID [2022-02-20 14:21:29,690 INFO L290 TraceCheckUtils]: 223: Hoare triple {14526#false} assume !(main_~j~0#1 < main_~n~0#1); {14526#false} is VALID [2022-02-20 14:21:29,690 INFO L290 TraceCheckUtils]: 224: Hoare triple {14526#false} main_~i~0#1 := 1 + main_~i~0#1; {14526#false} is VALID [2022-02-20 14:21:29,690 INFO L290 TraceCheckUtils]: 225: Hoare triple {14526#false} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := main_~p~0#1; {14526#false} is VALID [2022-02-20 14:21:29,690 INFO L290 TraceCheckUtils]: 226: Hoare triple {14526#false} assume !(main_~j~0#1 < main_~n~0#1); {14526#false} is VALID [2022-02-20 14:21:29,690 INFO L290 TraceCheckUtils]: 227: Hoare triple {14526#false} main_~i~0#1 := 1 + main_~i~0#1; {14526#false} is VALID [2022-02-20 14:21:29,690 INFO L290 TraceCheckUtils]: 228: Hoare triple {14526#false} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := main_~p~0#1; {14526#false} is VALID [2022-02-20 14:21:29,690 INFO L290 TraceCheckUtils]: 229: Hoare triple {14526#false} assume !(main_~j~0#1 < main_~n~0#1); {14526#false} is VALID [2022-02-20 14:21:29,691 INFO L290 TraceCheckUtils]: 230: Hoare triple {14526#false} main_~i~0#1 := 1 + main_~i~0#1; {14526#false} is VALID [2022-02-20 14:21:29,691 INFO L290 TraceCheckUtils]: 231: Hoare triple {14526#false} assume !(main_~i~0#1 < main_~n~0#1); {14526#false} is VALID [2022-02-20 14:21:29,691 INFO L290 TraceCheckUtils]: 232: Hoare triple {14526#false} main_~i~0#1 := 0;main_~j~0#1 := 0;main_~k~0#1 := 0; {14526#false} is VALID [2022-02-20 14:21:29,691 INFO L290 TraceCheckUtils]: 233: Hoare triple {14526#false} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0;main_~k~0#1 := 0; {14526#false} is VALID [2022-02-20 14:21:29,691 INFO L290 TraceCheckUtils]: 234: Hoare triple {14526#false} assume !!(main_~j~0#1 < main_~n~0#1);main_~k~0#1 := 0; {14526#false} is VALID [2022-02-20 14:21:29,691 INFO L290 TraceCheckUtils]: 235: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);call main_#t~mem7#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);call main_#t~mem8#1 := read~int(main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 == main_#t~mem8#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {14526#false} is VALID [2022-02-20 14:21:29,691 INFO L290 TraceCheckUtils]: 236: Hoare triple {14526#false} assume 0 == __VERIFIER_assert_~cond#1; {14526#false} is VALID [2022-02-20 14:21:29,691 INFO L290 TraceCheckUtils]: 237: Hoare triple {14526#false} assume !false; {14526#false} is VALID [2022-02-20 14:21:29,696 INFO L134 CoverageAnalysis]: Checked inductivity of 17651 backedges. 8867 proven. 4432 refuted. 0 times theorem prover too weak. 4352 trivial. 0 not checked. [2022-02-20 14:21:29,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:21:30,513 INFO L290 TraceCheckUtils]: 237: Hoare triple {14526#false} assume !false; {14526#false} is VALID [2022-02-20 14:21:30,513 INFO L290 TraceCheckUtils]: 236: Hoare triple {14526#false} assume 0 == __VERIFIER_assert_~cond#1; {14526#false} is VALID [2022-02-20 14:21:30,513 INFO L290 TraceCheckUtils]: 235: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);call main_#t~mem7#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);call main_#t~mem8#1 := read~int(main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 == main_#t~mem8#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {14526#false} is VALID [2022-02-20 14:21:30,513 INFO L290 TraceCheckUtils]: 234: Hoare triple {14526#false} assume !!(main_~j~0#1 < main_~n~0#1);main_~k~0#1 := 0; {14526#false} is VALID [2022-02-20 14:21:30,514 INFO L290 TraceCheckUtils]: 233: Hoare triple {14526#false} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0;main_~k~0#1 := 0; {14526#false} is VALID [2022-02-20 14:21:30,514 INFO L290 TraceCheckUtils]: 232: Hoare triple {14526#false} main_~i~0#1 := 0;main_~j~0#1 := 0;main_~k~0#1 := 0; {14526#false} is VALID [2022-02-20 14:21:30,514 INFO L290 TraceCheckUtils]: 231: Hoare triple {14526#false} assume !(main_~i~0#1 < main_~n~0#1); {14526#false} is VALID [2022-02-20 14:21:30,514 INFO L290 TraceCheckUtils]: 230: Hoare triple {14526#false} main_~i~0#1 := 1 + main_~i~0#1; {14526#false} is VALID [2022-02-20 14:21:30,514 INFO L290 TraceCheckUtils]: 229: Hoare triple {14526#false} assume !(main_~j~0#1 < main_~n~0#1); {14526#false} is VALID [2022-02-20 14:21:30,514 INFO L290 TraceCheckUtils]: 228: Hoare triple {14526#false} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := main_~p~0#1; {14526#false} is VALID [2022-02-20 14:21:30,514 INFO L290 TraceCheckUtils]: 227: Hoare triple {14526#false} main_~i~0#1 := 1 + main_~i~0#1; {14526#false} is VALID [2022-02-20 14:21:30,514 INFO L290 TraceCheckUtils]: 226: Hoare triple {14526#false} assume !(main_~j~0#1 < main_~n~0#1); {14526#false} is VALID [2022-02-20 14:21:30,514 INFO L290 TraceCheckUtils]: 225: Hoare triple {14526#false} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := main_~p~0#1; {14526#false} is VALID [2022-02-20 14:21:30,514 INFO L290 TraceCheckUtils]: 224: Hoare triple {14526#false} main_~i~0#1 := 1 + main_~i~0#1; {14526#false} is VALID [2022-02-20 14:21:30,515 INFO L290 TraceCheckUtils]: 223: Hoare triple {14526#false} assume !(main_~j~0#1 < main_~n~0#1); {14526#false} is VALID [2022-02-20 14:21:30,515 INFO L290 TraceCheckUtils]: 222: Hoare triple {14526#false} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := main_~p~0#1; {14526#false} is VALID [2022-02-20 14:21:30,515 INFO L290 TraceCheckUtils]: 221: Hoare triple {14526#false} main_~i~0#1 := 1 + main_~i~0#1; {14526#false} is VALID [2022-02-20 14:21:30,515 INFO L290 TraceCheckUtils]: 220: Hoare triple {14526#false} assume !(main_~j~0#1 < main_~n~0#1); {14526#false} is VALID [2022-02-20 14:21:30,515 INFO L290 TraceCheckUtils]: 219: Hoare triple {14526#false} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := main_~p~0#1; {14526#false} is VALID [2022-02-20 14:21:30,515 INFO L290 TraceCheckUtils]: 218: Hoare triple {14526#false} main_~i~0#1 := main_~p~0#1; {14526#false} is VALID [2022-02-20 14:21:30,515 INFO L290 TraceCheckUtils]: 217: Hoare triple {14526#false} assume !(main_~i~0#1 < main_~p~0#1); {14526#false} is VALID [2022-02-20 14:21:30,515 INFO L290 TraceCheckUtils]: 216: Hoare triple {14526#false} main_~i~0#1 := 1 + main_~i~0#1; {14526#false} is VALID [2022-02-20 14:21:30,515 INFO L290 TraceCheckUtils]: 215: Hoare triple {14526#false} assume !(main_~j~0#1 < main_~p~0#1); {14526#false} is VALID [2022-02-20 14:21:30,516 INFO L290 TraceCheckUtils]: 214: Hoare triple {14526#false} assume !!(main_~i~0#1 < main_~p~0#1);main_~j~0#1 := 0;main_~k~0#1 := 0; {14526#false} is VALID [2022-02-20 14:21:30,516 INFO L290 TraceCheckUtils]: 213: Hoare triple {14526#false} main_~i~0#1 := 0;main_~j~0#1 := 0;main_~k~0#1 := 0; {14526#false} is VALID [2022-02-20 14:21:30,516 INFO L290 TraceCheckUtils]: 212: Hoare triple {14526#false} assume !(main_~i~0#1 < main_~n~0#1); {14526#false} is VALID [2022-02-20 14:21:30,516 INFO L290 TraceCheckUtils]: 211: Hoare triple {14526#false} main_~i~0#1 := 1 + main_~i~0#1; {14526#false} is VALID [2022-02-20 14:21:30,516 INFO L290 TraceCheckUtils]: 210: Hoare triple {14526#false} assume !(main_~j~0#1 < main_~n~0#1); {14526#false} is VALID [2022-02-20 14:21:30,516 INFO L290 TraceCheckUtils]: 209: Hoare triple {14526#false} main_~j~0#1 := 1 + main_~j~0#1; {14526#false} is VALID [2022-02-20 14:21:30,516 INFO L290 TraceCheckUtils]: 208: Hoare triple {14526#false} assume !(main_~k~0#1 < main_~n~0#1); {14526#false} is VALID [2022-02-20 14:21:30,516 INFO L290 TraceCheckUtils]: 207: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:30,516 INFO L290 TraceCheckUtils]: 206: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:30,517 INFO L290 TraceCheckUtils]: 205: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:30,517 INFO L290 TraceCheckUtils]: 204: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:30,517 INFO L290 TraceCheckUtils]: 203: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:30,517 INFO L290 TraceCheckUtils]: 202: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:30,517 INFO L290 TraceCheckUtils]: 201: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:30,517 INFO L290 TraceCheckUtils]: 200: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:30,517 INFO L290 TraceCheckUtils]: 199: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:30,517 INFO L290 TraceCheckUtils]: 198: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:30,517 INFO L290 TraceCheckUtils]: 197: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:30,518 INFO L290 TraceCheckUtils]: 196: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:30,518 INFO L290 TraceCheckUtils]: 195: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:30,518 INFO L290 TraceCheckUtils]: 194: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:30,518 INFO L290 TraceCheckUtils]: 193: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:30,518 INFO L290 TraceCheckUtils]: 192: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:30,518 INFO L290 TraceCheckUtils]: 191: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:30,518 INFO L290 TraceCheckUtils]: 190: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:30,518 INFO L290 TraceCheckUtils]: 189: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:30,518 INFO L290 TraceCheckUtils]: 188: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:30,519 INFO L290 TraceCheckUtils]: 187: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:30,519 INFO L290 TraceCheckUtils]: 186: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:30,519 INFO L290 TraceCheckUtils]: 185: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:30,519 INFO L290 TraceCheckUtils]: 184: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:30,519 INFO L290 TraceCheckUtils]: 183: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:30,535 INFO L290 TraceCheckUtils]: 182: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:30,535 INFO L290 TraceCheckUtils]: 181: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:30,535 INFO L290 TraceCheckUtils]: 180: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:30,535 INFO L290 TraceCheckUtils]: 179: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:30,536 INFO L290 TraceCheckUtils]: 178: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:30,536 INFO L290 TraceCheckUtils]: 177: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:30,536 INFO L290 TraceCheckUtils]: 176: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:30,536 INFO L290 TraceCheckUtils]: 175: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:30,536 INFO L290 TraceCheckUtils]: 174: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:30,536 INFO L290 TraceCheckUtils]: 173: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:30,536 INFO L290 TraceCheckUtils]: 172: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:30,536 INFO L290 TraceCheckUtils]: 171: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:30,536 INFO L290 TraceCheckUtils]: 170: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:30,537 INFO L290 TraceCheckUtils]: 169: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:30,537 INFO L290 TraceCheckUtils]: 168: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:30,537 INFO L290 TraceCheckUtils]: 167: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:30,537 INFO L290 TraceCheckUtils]: 166: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:30,537 INFO L290 TraceCheckUtils]: 165: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:30,537 INFO L290 TraceCheckUtils]: 164: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:30,537 INFO L290 TraceCheckUtils]: 163: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:30,537 INFO L290 TraceCheckUtils]: 162: Hoare triple {14526#false} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14526#false} is VALID [2022-02-20 14:21:30,537 INFO L290 TraceCheckUtils]: 161: Hoare triple {14526#false} assume !!(main_~j~0#1 < main_~n~0#1);main_~k~0#1 := 0; {14526#false} is VALID [2022-02-20 14:21:30,538 INFO L290 TraceCheckUtils]: 160: Hoare triple {14526#false} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0;main_~k~0#1 := 0; {14526#false} is VALID [2022-02-20 14:21:30,538 INFO L290 TraceCheckUtils]: 159: Hoare triple {14526#false} main_~i~0#1 := 1 + main_~i~0#1; {14526#false} is VALID [2022-02-20 14:21:30,538 INFO L290 TraceCheckUtils]: 158: Hoare triple {15483#(< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|)} assume !(main_~j~0#1 < main_~n~0#1); {14526#false} is VALID [2022-02-20 14:21:30,540 INFO L290 TraceCheckUtils]: 157: Hoare triple {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} main_~j~0#1 := 1 + main_~j~0#1; {15483#(< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,541 INFO L290 TraceCheckUtils]: 156: Hoare triple {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !(main_~k~0#1 < main_~n~0#1); {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,541 INFO L290 TraceCheckUtils]: 155: Hoare triple {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,542 INFO L290 TraceCheckUtils]: 154: Hoare triple {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,542 INFO L290 TraceCheckUtils]: 153: Hoare triple {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,542 INFO L290 TraceCheckUtils]: 152: Hoare triple {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,542 INFO L290 TraceCheckUtils]: 151: Hoare triple {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,543 INFO L290 TraceCheckUtils]: 150: Hoare triple {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,543 INFO L290 TraceCheckUtils]: 149: Hoare triple {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,543 INFO L290 TraceCheckUtils]: 148: Hoare triple {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,544 INFO L290 TraceCheckUtils]: 147: Hoare triple {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,544 INFO L290 TraceCheckUtils]: 146: Hoare triple {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,544 INFO L290 TraceCheckUtils]: 145: Hoare triple {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,545 INFO L290 TraceCheckUtils]: 144: Hoare triple {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,545 INFO L290 TraceCheckUtils]: 143: Hoare triple {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,545 INFO L290 TraceCheckUtils]: 142: Hoare triple {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,546 INFO L290 TraceCheckUtils]: 141: Hoare triple {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,546 INFO L290 TraceCheckUtils]: 140: Hoare triple {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,546 INFO L290 TraceCheckUtils]: 139: Hoare triple {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,546 INFO L290 TraceCheckUtils]: 138: Hoare triple {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,547 INFO L290 TraceCheckUtils]: 137: Hoare triple {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,547 INFO L290 TraceCheckUtils]: 136: Hoare triple {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,547 INFO L290 TraceCheckUtils]: 135: Hoare triple {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,548 INFO L290 TraceCheckUtils]: 134: Hoare triple {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,548 INFO L290 TraceCheckUtils]: 133: Hoare triple {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,548 INFO L290 TraceCheckUtils]: 132: Hoare triple {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,549 INFO L290 TraceCheckUtils]: 131: Hoare triple {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,549 INFO L290 TraceCheckUtils]: 130: Hoare triple {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,549 INFO L290 TraceCheckUtils]: 129: Hoare triple {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,549 INFO L290 TraceCheckUtils]: 128: Hoare triple {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,550 INFO L290 TraceCheckUtils]: 127: Hoare triple {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,550 INFO L290 TraceCheckUtils]: 126: Hoare triple {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,550 INFO L290 TraceCheckUtils]: 125: Hoare triple {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,551 INFO L290 TraceCheckUtils]: 124: Hoare triple {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,551 INFO L290 TraceCheckUtils]: 123: Hoare triple {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,551 INFO L290 TraceCheckUtils]: 122: Hoare triple {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,552 INFO L290 TraceCheckUtils]: 121: Hoare triple {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,552 INFO L290 TraceCheckUtils]: 120: Hoare triple {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,552 INFO L290 TraceCheckUtils]: 119: Hoare triple {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,553 INFO L290 TraceCheckUtils]: 118: Hoare triple {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,553 INFO L290 TraceCheckUtils]: 117: Hoare triple {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,553 INFO L290 TraceCheckUtils]: 116: Hoare triple {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,554 INFO L290 TraceCheckUtils]: 115: Hoare triple {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,555 INFO L290 TraceCheckUtils]: 114: Hoare triple {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,556 INFO L290 TraceCheckUtils]: 113: Hoare triple {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,556 INFO L290 TraceCheckUtils]: 112: Hoare triple {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,556 INFO L290 TraceCheckUtils]: 111: Hoare triple {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,557 INFO L290 TraceCheckUtils]: 110: Hoare triple {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,557 INFO L290 TraceCheckUtils]: 109: Hoare triple {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);main_~k~0#1 := 0; {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,557 INFO L290 TraceCheckUtils]: 108: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0;main_~k~0#1 := 0; {15487#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,558 INFO L290 TraceCheckUtils]: 107: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} main_~i~0#1 := 1 + main_~i~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,558 INFO L290 TraceCheckUtils]: 106: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !(main_~j~0#1 < main_~n~0#1); {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,558 INFO L290 TraceCheckUtils]: 105: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} main_~j~0#1 := 1 + main_~j~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,558 INFO L290 TraceCheckUtils]: 104: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !(main_~k~0#1 < main_~n~0#1); {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,559 INFO L290 TraceCheckUtils]: 103: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,559 INFO L290 TraceCheckUtils]: 102: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,559 INFO L290 TraceCheckUtils]: 101: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,560 INFO L290 TraceCheckUtils]: 100: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,560 INFO L290 TraceCheckUtils]: 99: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,560 INFO L290 TraceCheckUtils]: 98: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,561 INFO L290 TraceCheckUtils]: 97: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,561 INFO L290 TraceCheckUtils]: 96: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,561 INFO L290 TraceCheckUtils]: 95: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,561 INFO L290 TraceCheckUtils]: 94: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,562 INFO L290 TraceCheckUtils]: 93: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,562 INFO L290 TraceCheckUtils]: 92: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,562 INFO L290 TraceCheckUtils]: 91: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,562 INFO L290 TraceCheckUtils]: 90: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,583 INFO L290 TraceCheckUtils]: 89: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,584 INFO L290 TraceCheckUtils]: 88: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,584 INFO L290 TraceCheckUtils]: 87: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,584 INFO L290 TraceCheckUtils]: 86: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,585 INFO L290 TraceCheckUtils]: 85: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,585 INFO L290 TraceCheckUtils]: 84: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,585 INFO L290 TraceCheckUtils]: 83: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,586 INFO L290 TraceCheckUtils]: 82: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,586 INFO L290 TraceCheckUtils]: 81: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,586 INFO L290 TraceCheckUtils]: 80: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,587 INFO L290 TraceCheckUtils]: 79: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,587 INFO L290 TraceCheckUtils]: 78: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,587 INFO L290 TraceCheckUtils]: 77: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,587 INFO L290 TraceCheckUtils]: 76: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,588 INFO L290 TraceCheckUtils]: 75: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,588 INFO L290 TraceCheckUtils]: 74: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,588 INFO L290 TraceCheckUtils]: 73: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,589 INFO L290 TraceCheckUtils]: 72: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,589 INFO L290 TraceCheckUtils]: 71: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,589 INFO L290 TraceCheckUtils]: 70: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,589 INFO L290 TraceCheckUtils]: 69: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,590 INFO L290 TraceCheckUtils]: 68: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,590 INFO L290 TraceCheckUtils]: 67: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,590 INFO L290 TraceCheckUtils]: 66: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,591 INFO L290 TraceCheckUtils]: 65: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,591 INFO L290 TraceCheckUtils]: 64: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,591 INFO L290 TraceCheckUtils]: 63: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,592 INFO L290 TraceCheckUtils]: 62: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,592 INFO L290 TraceCheckUtils]: 61: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,592 INFO L290 TraceCheckUtils]: 60: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,592 INFO L290 TraceCheckUtils]: 59: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,593 INFO L290 TraceCheckUtils]: 58: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,593 INFO L290 TraceCheckUtils]: 57: Hoare triple {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);main_~k~0#1 := 0; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,595 INFO L290 TraceCheckUtils]: 56: Hoare triple {14696#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0;main_~k~0#1 := 0; {14700#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:30,596 INFO L290 TraceCheckUtils]: 55: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_~i~0#1 := 1 + main_~i~0#1; {14696#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:30,597 INFO L290 TraceCheckUtils]: 54: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~j~0#1 < main_~n~0#1); {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:30,597 INFO L290 TraceCheckUtils]: 53: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_~j~0#1 := 1 + main_~j~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:30,597 INFO L290 TraceCheckUtils]: 52: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~k~0#1 < main_~n~0#1); {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:30,598 INFO L290 TraceCheckUtils]: 51: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:30,598 INFO L290 TraceCheckUtils]: 50: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:30,598 INFO L290 TraceCheckUtils]: 49: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:30,599 INFO L290 TraceCheckUtils]: 48: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:30,599 INFO L290 TraceCheckUtils]: 47: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:30,599 INFO L290 TraceCheckUtils]: 46: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:30,599 INFO L290 TraceCheckUtils]: 45: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:30,600 INFO L290 TraceCheckUtils]: 44: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:30,600 INFO L290 TraceCheckUtils]: 43: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:30,600 INFO L290 TraceCheckUtils]: 42: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:30,601 INFO L290 TraceCheckUtils]: 41: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:30,601 INFO L290 TraceCheckUtils]: 40: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:30,601 INFO L290 TraceCheckUtils]: 39: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:30,602 INFO L290 TraceCheckUtils]: 38: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:30,602 INFO L290 TraceCheckUtils]: 37: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:30,602 INFO L290 TraceCheckUtils]: 36: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:30,603 INFO L290 TraceCheckUtils]: 35: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:30,603 INFO L290 TraceCheckUtils]: 34: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:30,603 INFO L290 TraceCheckUtils]: 33: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:30,603 INFO L290 TraceCheckUtils]: 32: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:30,604 INFO L290 TraceCheckUtils]: 31: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:30,604 INFO L290 TraceCheckUtils]: 30: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:30,604 INFO L290 TraceCheckUtils]: 29: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:30,605 INFO L290 TraceCheckUtils]: 28: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:30,605 INFO L290 TraceCheckUtils]: 27: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:30,605 INFO L290 TraceCheckUtils]: 26: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:30,606 INFO L290 TraceCheckUtils]: 25: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:30,606 INFO L290 TraceCheckUtils]: 24: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:30,606 INFO L290 TraceCheckUtils]: 23: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:30,607 INFO L290 TraceCheckUtils]: 22: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:30,607 INFO L290 TraceCheckUtils]: 21: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:30,607 INFO L290 TraceCheckUtils]: 20: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:30,607 INFO L290 TraceCheckUtils]: 19: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:30,608 INFO L290 TraceCheckUtils]: 18: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:30,608 INFO L290 TraceCheckUtils]: 17: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:30,608 INFO L290 TraceCheckUtils]: 16: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:30,609 INFO L290 TraceCheckUtils]: 15: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:30,609 INFO L290 TraceCheckUtils]: 14: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:30,609 INFO L290 TraceCheckUtils]: 13: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:30,609 INFO L290 TraceCheckUtils]: 12: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:30,610 INFO L290 TraceCheckUtils]: 11: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:30,610 INFO L290 TraceCheckUtils]: 10: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:30,610 INFO L290 TraceCheckUtils]: 9: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:30,611 INFO L290 TraceCheckUtils]: 8: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:30,611 INFO L290 TraceCheckUtils]: 7: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:30,611 INFO L290 TraceCheckUtils]: 6: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~k~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1 * main_~n~0#1) + main_~j~0#1 * (4 * main_~n~0#1) + 4 * main_~k~0#1, 4);havoc main_#t~nondet4#1;main_~k~0#1 := 1 + main_~k~0#1; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:30,611 INFO L290 TraceCheckUtils]: 5: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);main_~k~0#1 := 0; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:30,612 INFO L290 TraceCheckUtils]: 4: Hoare triple {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0;main_~k~0#1 := 0; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:30,612 INFO L290 TraceCheckUtils]: 3: Hoare triple {14525#true} assume { :end_inline_assume_abort_if_not } true;main_~i~0#1 := 0;main_~j~0#1 := 0;main_~k~0#1 := 0; {14539#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:21:30,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {14525#true} assume !(0 == assume_abort_if_not_~cond#1); {14525#true} is VALID [2022-02-20 14:21:30,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {14525#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1, main_~p~0#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;main_~n~0#1 := 1000;main_~p~0#1 := 500;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~n~0#1 * main_~n~0#1);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~n~0#1 * main_~n~0#1);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~p~0#1 < main_~n~0#1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {14525#true} is VALID [2022-02-20 14:21:30,612 INFO L290 TraceCheckUtils]: 0: Hoare triple {14525#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(19, 2);call #Ultimate.allocInit(12, 3); {14525#true} is VALID [2022-02-20 14:21:30,617 INFO L134 CoverageAnalysis]: Checked inductivity of 17651 backedges. 6653 proven. 6646 refuted. 0 times theorem prover too weak. 4352 trivial. 0 not checked. [2022-02-20 14:21:30,618 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:21:30,618 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174853606] [2022-02-20 14:21:30,618 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:21:30,618 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150592977] [2022-02-20 14:21:30,618 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150592977] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:21:30,618 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:21:30,618 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-02-20 14:21:30,619 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995545954] [2022-02-20 14:21:30,619 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:21:30,620 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 238 [2022-02-20 14:21:30,620 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:21:30,620 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:30,674 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:21:30,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 14:21:30,674 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:21:30,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 14:21:30,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-02-20 14:21:30,675 INFO L87 Difference]: Start difference. First operand 389 states and 457 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:37,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:21:37,390 INFO L93 Difference]: Finished difference Result 1853 states and 2244 transitions. [2022-02-20 14:21:37,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 14:21:37,390 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 238 [2022-02-20 14:21:37,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:21:37,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:37,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 189 transitions. [2022-02-20 14:21:37,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:37,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 189 transitions. [2022-02-20 14:21:37,393 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 189 transitions. [2022-02-20 14:21:37,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:21:37,678 INFO L225 Difference]: With dead ends: 1853 [2022-02-20 14:21:37,678 INFO L226 Difference]: Without dead ends: 1519 [2022-02-20 14:21:37,679 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 467 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2022-02-20 14:21:37,680 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 210 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 14:21:37,680 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [210 Valid, 61 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 14:21:37,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1519 states. [2022-02-20 14:21:41,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1519 to 726. [2022-02-20 14:21:41,549 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:21:41,553 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1519 states. Second operand has 726 states, 725 states have (on average 1.1655172413793105) internal successors, (845), 725 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:41,554 INFO L74 IsIncluded]: Start isIncluded. First operand 1519 states. Second operand has 726 states, 725 states have (on average 1.1655172413793105) internal successors, (845), 725 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:41,555 INFO L87 Difference]: Start difference. First operand 1519 states. Second operand has 726 states, 725 states have (on average 1.1655172413793105) internal successors, (845), 725 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:41,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:21:41,612 INFO L93 Difference]: Finished difference Result 1519 states and 1838 transitions. [2022-02-20 14:21:41,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1519 states and 1838 transitions. [2022-02-20 14:21:41,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:21:41,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:21:41,614 INFO L74 IsIncluded]: Start isIncluded. First operand has 726 states, 725 states have (on average 1.1655172413793105) internal successors, (845), 725 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1519 states. [2022-02-20 14:21:41,615 INFO L87 Difference]: Start difference. First operand has 726 states, 725 states have (on average 1.1655172413793105) internal successors, (845), 725 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1519 states. [2022-02-20 14:21:41,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:21:41,672 INFO L93 Difference]: Finished difference Result 1519 states and 1838 transitions. [2022-02-20 14:21:41,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1519 states and 1838 transitions. [2022-02-20 14:21:41,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:21:41,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:21:41,674 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:21:41,674 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:21:41,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 725 states have (on average 1.1655172413793105) internal successors, (845), 725 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:41,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 845 transitions. [2022-02-20 14:21:41,695 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 845 transitions. Word has length 238 [2022-02-20 14:21:41,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:21:41,695 INFO L470 AbstractCegarLoop]: Abstraction has 726 states and 845 transitions. [2022-02-20 14:21:41,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:21:41,696 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 845 transitions. [2022-02-20 14:21:41,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2022-02-20 14:21:41,699 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:21:41,699 INFO L514 BasicCegarLoop]: trace histogram [368, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:21:41,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-02-20 14:21:41,917 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-02-20 14:21:41,917 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:21:41,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:21:41,918 INFO L85 PathProgramCache]: Analyzing trace with hash 150263851, now seen corresponding path program 5 times [2022-02-20 14:21:41,918 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:21:41,918 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740774083] [2022-02-20 14:21:41,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:21:41,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:21:42,261 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:21:42,262 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2018869373] [2022-02-20 14:21:42,262 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-20 14:21:42,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:21:42,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:21:42,263 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:21:42,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process