./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-multidimensional/copy-partial-2-n-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-2-n-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 2a46b64c20324a7544dfe7936b5f39eaa32bba659068797748195a7f292bdaee --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:20:54,090 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:20:54,093 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:20:54,135 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:20:54,135 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:20:54,138 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:20:54,140 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:20:54,143 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:20:54,144 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:20:54,148 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:20:54,149 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:20:54,150 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:20:54,150 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:20:54,152 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:20:54,154 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:20:54,155 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:20:54,155 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:20:54,156 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:20:54,160 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:20:54,166 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:20:54,167 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:20:54,168 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:20:54,170 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:20:54,170 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:20:54,176 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:20:54,176 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:20:54,176 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:20:54,178 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:20:54,178 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:20:54,179 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:20:54,179 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:20:54,180 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:20:54,181 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:20:54,182 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:20:54,183 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:20:54,183 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:20:54,183 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:20:54,184 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:20:54,184 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:20:54,184 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:20:54,185 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:20:54,186 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:54,212 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:20:54,212 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:20:54,213 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:20:54,213 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:20:54,213 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:20:54,214 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:20:54,214 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:20:54,214 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:20:54,215 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:20:54,215 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:20:54,216 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:20:54,216 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:20:54,216 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:20:54,216 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:20:54,216 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:20:54,216 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:20:54,217 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:20:54,217 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:20:54,217 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:20:54,217 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:20:54,217 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:20:54,221 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:20:54,221 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:20:54,221 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:20:54,221 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:20:54,221 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:20:54,222 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:20:54,223 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:20:54,223 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:20:54,223 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:20:54,223 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:20:54,223 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:20:54,223 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:20:54,224 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 -> 2a46b64c20324a7544dfe7936b5f39eaa32bba659068797748195a7f292bdaee [2022-02-20 14:20:54,466 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:20:54,515 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:20:54,517 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:20:54,518 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:20:54,519 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:20:54,520 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-multidimensional/copy-partial-2-n-u.c [2022-02-20 14:20:54,564 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7040ee937/d0ec789f71a24e25adef8ee6f7ea524c/FLAG72df2c8d8 [2022-02-20 14:20:54,959 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:20:54,959 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/copy-partial-2-n-u.c [2022-02-20 14:20:54,964 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7040ee937/d0ec789f71a24e25adef8ee6f7ea524c/FLAG72df2c8d8 [2022-02-20 14:20:54,975 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7040ee937/d0ec789f71a24e25adef8ee6f7ea524c [2022-02-20 14:20:54,977 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:20:54,978 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:20:54,979 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:20:54,979 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:20:54,983 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:20:54,987 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:20:54" (1/1) ... [2022-02-20 14:20:54,988 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2257f4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:20:54, skipping insertion in model container [2022-02-20 14:20:54,988 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:20:54" (1/1) ... [2022-02-20 14:20:54,994 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:20:55,010 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:20:55,149 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-2-n-u.c[416,429] [2022-02-20 14:20:55,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:20:55,201 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:20:55,210 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-2-n-u.c[416,429] [2022-02-20 14:20:55,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:20:55,233 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:20:55,234 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,234 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:20:55,235 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:20:55,235 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:20:55,235 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:20:55,239 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,243 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,262 INFO L137 Inliner]: procedures = 15, calls = 21, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 86 [2022-02-20 14:20:55,263 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:20:55,264 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:20:55,264 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:20:55,264 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:20:55,270 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,270 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,272 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,272 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,278 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,282 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,283 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,285 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:20:55,286 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:20:55,286 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:20:55,286 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:20:55,287 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,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:20:55,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:20:55,322 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:55,326 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:55,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:20:55,360 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 14:20:55,361 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 14:20:55,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:20:55,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:20:55,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:20:55,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:20:55,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:20:55,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:20:55,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:20:55,409 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:20:55,410 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:20:55,582 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:20:55,594 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:20:55,605 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-02-20 14:20:55,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:20:55 BoogieIcfgContainer [2022-02-20 14:20:55,607 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:20:55,609 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:20:55,609 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:20:55,618 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:20:55,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:20:54" (1/3) ... [2022-02-20 14:20:55,619 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a67a088 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:20:55, skipping insertion in model container [2022-02-20 14:20:55,619 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:55,619 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a67a088 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:20:55, skipping insertion in model container [2022-02-20 14:20:55,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:20:55" (3/3) ... [2022-02-20 14:20:55,620 INFO L111 eAbstractionObserver]: Analyzing ICFG copy-partial-2-n-u.c [2022-02-20 14:20:55,625 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:20:55,625 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:20:55,687 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:20:55,696 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:55,696 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:20:55,729 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 24 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:20:55,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 14:20:55,734 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:20:55,735 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:20:55,736 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:20:55,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:20:55,740 INFO L85 PathProgramCache]: Analyzing trace with hash -897666833, now seen corresponding path program 1 times [2022-02-20 14:20:55,748 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:20:55,748 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941810565] [2022-02-20 14:20:55,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:20:55,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:20:55,836 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:20:55,837 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1514719441] [2022-02-20 14:20:55,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:20:55,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:20:55,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:20:55,839 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:55,839 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:55,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:20:55,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 14:20:55,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:20:55,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:20:55,998 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#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(21, 2);call #Ultimate.allocInit(12, 3); {31#true} is VALID [2022-02-20 14:20:55,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#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_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1, main_~q~0#1, main_~s~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;main_~m~0#1 := 1000;main_~n~0#1 := 1500;main_~q~0#1 := 500;main_~s~0#1 := 700;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~m~0#1);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~m~0#1); {31#true} is VALID [2022-02-20 14:20:55,999 INFO L272 TraceCheckUtils]: 2: Hoare triple {31#true} call assume_abort_if_not((if main_~q~0#1 < main_~m~0#1 then 1 else 0)); {31#true} is VALID [2022-02-20 14:20:55,999 INFO L290 TraceCheckUtils]: 3: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-02-20 14:20:56,000 INFO L290 TraceCheckUtils]: 4: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-02-20 14:20:56,000 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#false} assume true; {32#false} is VALID [2022-02-20 14:20:56,000 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {32#false} {31#true} #107#return; {32#false} is VALID [2022-02-20 14:20:56,001 INFO L272 TraceCheckUtils]: 7: Hoare triple {32#false} call assume_abort_if_not((if main_~s~0#1 < main_~n~0#1 then 1 else 0)); {32#false} is VALID [2022-02-20 14:20:56,001 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2022-02-20 14:20:56,001 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#false} assume 0 == ~cond;assume false; {32#false} is VALID [2022-02-20 14:20:56,001 INFO L290 TraceCheckUtils]: 10: Hoare triple {32#false} assume true; {32#false} is VALID [2022-02-20 14:20:56,002 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {32#false} {32#false} #109#return; {32#false} is VALID [2022-02-20 14:20:56,002 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#false} main_~i~0#1 := 0;main_~j~0#1 := 0; {32#false} is VALID [2022-02-20 14:20:56,002 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#false} assume !(main_~i~0#1 < main_~m~0#1); {32#false} is VALID [2022-02-20 14:20:56,002 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#false} main_~i~0#1 := 0;main_~j~0#1 := 0; {32#false} is VALID [2022-02-20 14:20:56,003 INFO L290 TraceCheckUtils]: 15: Hoare triple {32#false} assume !(main_~i~0#1 < main_~q~0#1); {32#false} is VALID [2022-02-20 14:20:56,003 INFO L290 TraceCheckUtils]: 16: Hoare triple {32#false} main_~i~0#1 := 0;main_~j~0#1 := 0; {32#false} is VALID [2022-02-20 14:20:56,003 INFO L290 TraceCheckUtils]: 17: Hoare triple {32#false} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {32#false} is VALID [2022-02-20 14:20:56,003 INFO L290 TraceCheckUtils]: 18: Hoare triple {32#false} assume !!(main_~j~0#1 < main_~s~0#1);call main_#t~mem6#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);call main_#t~mem7#1 := read~int(main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem6#1 == main_#t~mem7#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {32#false} is VALID [2022-02-20 14:20:56,004 INFO L290 TraceCheckUtils]: 19: Hoare triple {32#false} assume 0 == __VERIFIER_assert_~cond#1; {32#false} is VALID [2022-02-20 14:20:56,004 INFO L290 TraceCheckUtils]: 20: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-02-20 14:20:56,005 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 14:20:56,005 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:20:56,005 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:20:56,006 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941810565] [2022-02-20 14:20:56,006 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:20:56,006 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514719441] [2022-02-20 14:20:56,007 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514719441] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:20:56,007 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:20:56,007 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 14:20:56,009 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854771227] [2022-02-20 14:20:56,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:20:56,013 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-02-20 14:20:56,015 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:20:56,017 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:20:56,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:20:56,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 14:20:56,041 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:20:56,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 14:20:56,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:20:56,064 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 24 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:20:56,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:20:56,133 INFO L93 Difference]: Finished difference Result 53 states and 82 transitions. [2022-02-20 14:20:56,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 14:20:56,134 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-02-20 14:20:56,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:20:56,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:20:56,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 82 transitions. [2022-02-20 14:20:56,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:20:56,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 82 transitions. [2022-02-20 14:20:56,152 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 82 transitions. [2022-02-20 14:20:56,228 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:20:56,237 INFO L225 Difference]: With dead ends: 53 [2022-02-20 14:20:56,237 INFO L226 Difference]: Without dead ends: 24 [2022-02-20 14:20:56,239 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 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,243 INFO L933 BasicCegarLoop]: 34 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, 34 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,244 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 34 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,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-02-20 14:20:56,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-02-20 14:20:56,274 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:20:56,277 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:20:56,278 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:20:56,279 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:20:56,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:20:56,286 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2022-02-20 14:20:56,286 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2022-02-20 14:20:56,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:20:56,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:20:56,289 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 24 states. [2022-02-20 14:20:56,289 INFO L87 Difference]: Start difference. First operand has 24 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 24 states. [2022-02-20 14:20:56,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:20:56,298 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2022-02-20 14:20:56,299 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2022-02-20 14:20:56,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:20:56,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:20:56,303 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:20:56,303 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:20:56,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:20:56,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2022-02-20 14:20:56,307 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 21 [2022-02-20 14:20:56,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:20:56,307 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2022-02-20 14:20:56,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:20:56,308 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2022-02-20 14:20:56,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 14:20:56,309 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:20:56,309 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:20:56,331 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:56,523 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:56,524 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:20:56,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:20:56,525 INFO L85 PathProgramCache]: Analyzing trace with hash 2067117999, now seen corresponding path program 1 times [2022-02-20 14:20:56,525 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:20:56,525 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191157253] [2022-02-20 14:20:56,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:20:56,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:20:56,551 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:20:56,556 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [382773651] [2022-02-20 14:20:56,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:20:56,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:20:56,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:20:56,560 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:56,562 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:56,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:20:56,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 14:20:56,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:20:56,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:20:56,762 INFO L290 TraceCheckUtils]: 0: Hoare triple {251#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(21, 2);call #Ultimate.allocInit(12, 3); {251#true} is VALID [2022-02-20 14:20:56,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {251#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_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1, main_~q~0#1, main_~s~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;main_~m~0#1 := 1000;main_~n~0#1 := 1500;main_~q~0#1 := 500;main_~s~0#1 := 700;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~m~0#1);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~m~0#1); {259#(<= 1000 |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 14:20:56,764 INFO L272 TraceCheckUtils]: 2: Hoare triple {259#(<= 1000 |ULTIMATE.start_main_~m~0#1|)} call assume_abort_if_not((if main_~q~0#1 < main_~m~0#1 then 1 else 0)); {251#true} is VALID [2022-02-20 14:20:56,764 INFO L290 TraceCheckUtils]: 3: Hoare triple {251#true} ~cond := #in~cond; {251#true} is VALID [2022-02-20 14:20:56,764 INFO L290 TraceCheckUtils]: 4: Hoare triple {251#true} assume !(0 == ~cond); {251#true} is VALID [2022-02-20 14:20:56,764 INFO L290 TraceCheckUtils]: 5: Hoare triple {251#true} assume true; {251#true} is VALID [2022-02-20 14:20:56,765 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {251#true} {259#(<= 1000 |ULTIMATE.start_main_~m~0#1|)} #107#return; {259#(<= 1000 |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 14:20:56,765 INFO L272 TraceCheckUtils]: 7: Hoare triple {259#(<= 1000 |ULTIMATE.start_main_~m~0#1|)} call assume_abort_if_not((if main_~s~0#1 < main_~n~0#1 then 1 else 0)); {251#true} is VALID [2022-02-20 14:20:56,766 INFO L290 TraceCheckUtils]: 8: Hoare triple {251#true} ~cond := #in~cond; {251#true} is VALID [2022-02-20 14:20:56,766 INFO L290 TraceCheckUtils]: 9: Hoare triple {251#true} assume !(0 == ~cond); {251#true} is VALID [2022-02-20 14:20:56,766 INFO L290 TraceCheckUtils]: 10: Hoare triple {251#true} assume true; {251#true} is VALID [2022-02-20 14:20:56,767 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {251#true} {259#(<= 1000 |ULTIMATE.start_main_~m~0#1|)} #109#return; {259#(<= 1000 |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 14:20:56,767 INFO L290 TraceCheckUtils]: 12: Hoare triple {259#(<= 1000 |ULTIMATE.start_main_~m~0#1|)} main_~i~0#1 := 0;main_~j~0#1 := 0; {293#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000 |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 14:20:56,768 INFO L290 TraceCheckUtils]: 13: Hoare triple {293#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000 |ULTIMATE.start_main_~m~0#1|))} assume !(main_~i~0#1 < main_~m~0#1); {252#false} is VALID [2022-02-20 14:20:56,768 INFO L290 TraceCheckUtils]: 14: Hoare triple {252#false} main_~i~0#1 := 0;main_~j~0#1 := 0; {252#false} is VALID [2022-02-20 14:20:56,768 INFO L290 TraceCheckUtils]: 15: Hoare triple {252#false} assume !(main_~i~0#1 < main_~q~0#1); {252#false} is VALID [2022-02-20 14:20:56,769 INFO L290 TraceCheckUtils]: 16: Hoare triple {252#false} main_~i~0#1 := 0;main_~j~0#1 := 0; {252#false} is VALID [2022-02-20 14:20:56,769 INFO L290 TraceCheckUtils]: 17: Hoare triple {252#false} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {252#false} is VALID [2022-02-20 14:20:56,769 INFO L290 TraceCheckUtils]: 18: Hoare triple {252#false} assume !!(main_~j~0#1 < main_~s~0#1);call main_#t~mem6#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);call main_#t~mem7#1 := read~int(main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem6#1 == main_#t~mem7#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {252#false} is VALID [2022-02-20 14:20:56,769 INFO L290 TraceCheckUtils]: 19: Hoare triple {252#false} assume 0 == __VERIFIER_assert_~cond#1; {252#false} is VALID [2022-02-20 14:20:56,769 INFO L290 TraceCheckUtils]: 20: Hoare triple {252#false} assume !false; {252#false} is VALID [2022-02-20 14:20:56,770 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:20:56,770 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:20:56,770 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:20:56,770 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191157253] [2022-02-20 14:20:56,770 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:20:56,771 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382773651] [2022-02-20 14:20:56,771 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382773651] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:20:56,771 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:20:56,771 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 14:20:56,771 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452479062] [2022-02-20 14:20:56,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:20:56,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-02-20 14:20:56,773 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:20:56,773 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:20:56,789 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:56,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:20:56,789 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:20:56,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:20:56,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:20:56,791 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:20:56,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:20:56,908 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-02-20 14:20:56,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 14:20:56,909 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-02-20 14:20:56,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:20:56,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:20:56,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-02-20 14:20:56,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:20:56,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-02-20 14:20:56,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 64 transitions. [2022-02-20 14:20:56,974 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:20:56,976 INFO L225 Difference]: With dead ends: 50 [2022-02-20 14:20:56,976 INFO L226 Difference]: Without dead ends: 38 [2022-02-20 14:20:56,977 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:56,978 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 50 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:20:56,978 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 32 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:20:56,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-02-20 14:20:56,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 25. [2022-02-20 14:20:56,995 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:20:56,995 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 25 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:20:56,995 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 25 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:20:56,996 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 25 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:20:56,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:20:56,998 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-02-20 14:20:56,998 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-02-20 14:20:56,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:20:56,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:20:56,999 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 38 states. [2022-02-20 14:20:56,999 INFO L87 Difference]: Start difference. First operand has 25 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 38 states. [2022-02-20 14:20:57,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:20:57,002 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-02-20 14:20:57,002 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-02-20 14:20:57,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:20:57,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:20:57,003 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:20:57,003 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:20:57,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:20:57,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2022-02-20 14:20:57,005 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 21 [2022-02-20 14:20:57,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:20:57,005 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2022-02-20 14:20:57,006 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:20:57,006 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-02-20 14:20:57,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 14:20:57,007 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:20:57,007 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:20:57,038 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,227 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,228 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:20:57,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:20:57,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1849346137, now seen corresponding path program 1 times [2022-02-20 14:20:57,229 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:20:57,229 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724251291] [2022-02-20 14:20:57,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:20:57,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:20:57,244 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:20:57,244 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1616613751] [2022-02-20 14:20:57,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:20:57,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:20:57,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:20:57,246 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,251 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,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:20:57,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 14:20:57,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:20:57,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:20:57,403 INFO L290 TraceCheckUtils]: 0: Hoare triple {501#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(21, 2);call #Ultimate.allocInit(12, 3); {501#true} is VALID [2022-02-20 14:20:57,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {501#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_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1, main_~q~0#1, main_~s~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;main_~m~0#1 := 1000;main_~n~0#1 := 1500;main_~q~0#1 := 500;main_~s~0#1 := 700;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~m~0#1);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~m~0#1); {509#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:20:57,405 INFO L272 TraceCheckUtils]: 2: Hoare triple {509#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} call assume_abort_if_not((if main_~q~0#1 < main_~m~0#1 then 1 else 0)); {501#true} is VALID [2022-02-20 14:20:57,405 INFO L290 TraceCheckUtils]: 3: Hoare triple {501#true} ~cond := #in~cond; {501#true} is VALID [2022-02-20 14:20:57,405 INFO L290 TraceCheckUtils]: 4: Hoare triple {501#true} assume !(0 == ~cond); {501#true} is VALID [2022-02-20 14:20:57,405 INFO L290 TraceCheckUtils]: 5: Hoare triple {501#true} assume true; {501#true} is VALID [2022-02-20 14:20:57,406 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {501#true} {509#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} #107#return; {509#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:20:57,409 INFO L272 TraceCheckUtils]: 7: Hoare triple {509#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} call assume_abort_if_not((if main_~s~0#1 < main_~n~0#1 then 1 else 0)); {501#true} is VALID [2022-02-20 14:20:57,409 INFO L290 TraceCheckUtils]: 8: Hoare triple {501#true} ~cond := #in~cond; {501#true} is VALID [2022-02-20 14:20:57,409 INFO L290 TraceCheckUtils]: 9: Hoare triple {501#true} assume !(0 == ~cond); {501#true} is VALID [2022-02-20 14:20:57,409 INFO L290 TraceCheckUtils]: 10: Hoare triple {501#true} assume true; {501#true} is VALID [2022-02-20 14:20:57,410 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {501#true} {509#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} #109#return; {509#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:20:57,411 INFO L290 TraceCheckUtils]: 12: Hoare triple {509#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} main_~i~0#1 := 0;main_~j~0#1 := 0; {509#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:20:57,413 INFO L290 TraceCheckUtils]: 13: Hoare triple {509#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~i~0#1 < main_~m~0#1);main_~j~0#1 := 0; {546#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:20:57,413 INFO L290 TraceCheckUtils]: 14: Hoare triple {546#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !(main_~j~0#1 < main_~n~0#1); {502#false} is VALID [2022-02-20 14:20:57,414 INFO L290 TraceCheckUtils]: 15: Hoare triple {502#false} main_~i~0#1 := 1 + main_~i~0#1; {502#false} is VALID [2022-02-20 14:20:57,414 INFO L290 TraceCheckUtils]: 16: Hoare triple {502#false} assume !(main_~i~0#1 < main_~m~0#1); {502#false} is VALID [2022-02-20 14:20:57,414 INFO L290 TraceCheckUtils]: 17: Hoare triple {502#false} main_~i~0#1 := 0;main_~j~0#1 := 0; {502#false} is VALID [2022-02-20 14:20:57,414 INFO L290 TraceCheckUtils]: 18: Hoare triple {502#false} assume !(main_~i~0#1 < main_~q~0#1); {502#false} is VALID [2022-02-20 14:20:57,414 INFO L290 TraceCheckUtils]: 19: Hoare triple {502#false} main_~i~0#1 := 0;main_~j~0#1 := 0; {502#false} is VALID [2022-02-20 14:20:57,415 INFO L290 TraceCheckUtils]: 20: Hoare triple {502#false} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {502#false} is VALID [2022-02-20 14:20:57,415 INFO L290 TraceCheckUtils]: 21: Hoare triple {502#false} assume !!(main_~j~0#1 < main_~s~0#1);call main_#t~mem6#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);call main_#t~mem7#1 := read~int(main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem6#1 == main_#t~mem7#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {502#false} is VALID [2022-02-20 14:20:57,415 INFO L290 TraceCheckUtils]: 22: Hoare triple {502#false} assume 0 == __VERIFIER_assert_~cond#1; {502#false} is VALID [2022-02-20 14:20:57,415 INFO L290 TraceCheckUtils]: 23: Hoare triple {502#false} assume !false; {502#false} is VALID [2022-02-20 14:20:57,415 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:20:57,416 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:20:57,416 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:20:57,416 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724251291] [2022-02-20 14:20:57,416 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:20:57,416 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616613751] [2022-02-20 14:20:57,416 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616613751] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:20:57,417 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:20:57,417 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 14:20:57,417 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712665867] [2022-02-20 14:20:57,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:20:57,419 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-02-20 14:20:57,420 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:20:57,420 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:20:57,438 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:57,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:20:57,438 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:20:57,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:20:57,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:20:57,439 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:20:57,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:20:57,576 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2022-02-20 14:20:57,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 14:20:57,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-02-20 14:20:57,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:20:57,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:20:57,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-02-20 14:20:57,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:20:57,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-02-20 14:20:57,583 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 67 transitions. [2022-02-20 14:20:57,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:20:57,648 INFO L225 Difference]: With dead ends: 52 [2022-02-20 14:20:57,648 INFO L226 Difference]: Without dead ends: 37 [2022-02-20 14:20:57,649 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 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,651 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 42 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:20:57,652 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 37 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:20:57,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-02-20 14:20:57,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2022-02-20 14:20:57,678 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:20:57,678 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 26 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:20:57,679 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 26 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:20:57,679 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 26 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:20:57,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:20:57,681 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-02-20 14:20:57,681 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2022-02-20 14:20:57,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:20:57,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:20:57,682 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 37 states. [2022-02-20 14:20:57,682 INFO L87 Difference]: Start difference. First operand has 26 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 37 states. [2022-02-20 14:20:57,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:20:57,684 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-02-20 14:20:57,684 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2022-02-20 14:20:57,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:20:57,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:20:57,685 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:20:57,685 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:20:57,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:20:57,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2022-02-20 14:20:57,687 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 24 [2022-02-20 14:20:57,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:20:57,687 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2022-02-20 14:20:57,688 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:20:57,688 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-02-20 14:20:57,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 14:20:57,688 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:20:57,689 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:20:57,716 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:57,903 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:57,904 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:20:57,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:20:57,904 INFO L85 PathProgramCache]: Analyzing trace with hash 2114191326, now seen corresponding path program 1 times [2022-02-20 14:20:57,904 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:20:57,904 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406981279] [2022-02-20 14:20:57,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:20:57,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:20:57,918 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:20:57,918 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [87235726] [2022-02-20 14:20:57,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:20:57,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:20:57,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:20:57,919 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:57,931 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:57,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:20:57,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 14:20:57,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:20:57,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:20:58,098 INFO L290 TraceCheckUtils]: 0: Hoare triple {764#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(21, 2);call #Ultimate.allocInit(12, 3); {764#true} is VALID [2022-02-20 14:20:58,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {764#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_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1, main_~q~0#1, main_~s~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;main_~m~0#1 := 1000;main_~n~0#1 := 1500;main_~q~0#1 := 500;main_~s~0#1 := 700;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~m~0#1);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~m~0#1); {772#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:20:58,100 INFO L272 TraceCheckUtils]: 2: Hoare triple {772#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} call assume_abort_if_not((if main_~q~0#1 < main_~m~0#1 then 1 else 0)); {764#true} is VALID [2022-02-20 14:20:58,100 INFO L290 TraceCheckUtils]: 3: Hoare triple {764#true} ~cond := #in~cond; {764#true} is VALID [2022-02-20 14:20:58,100 INFO L290 TraceCheckUtils]: 4: Hoare triple {764#true} assume !(0 == ~cond); {764#true} is VALID [2022-02-20 14:20:58,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {764#true} assume true; {764#true} is VALID [2022-02-20 14:20:58,101 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {764#true} {772#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} #107#return; {772#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:20:58,101 INFO L272 TraceCheckUtils]: 7: Hoare triple {772#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} call assume_abort_if_not((if main_~s~0#1 < main_~n~0#1 then 1 else 0)); {764#true} is VALID [2022-02-20 14:20:58,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {764#true} ~cond := #in~cond; {764#true} is VALID [2022-02-20 14:20:58,102 INFO L290 TraceCheckUtils]: 9: Hoare triple {764#true} assume !(0 == ~cond); {764#true} is VALID [2022-02-20 14:20:58,102 INFO L290 TraceCheckUtils]: 10: Hoare triple {764#true} assume true; {764#true} is VALID [2022-02-20 14:20:58,102 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {764#true} {772#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} #109#return; {772#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:20:58,103 INFO L290 TraceCheckUtils]: 12: Hoare triple {772#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} main_~i~0#1 := 0;main_~j~0#1 := 0; {772#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:20:58,103 INFO L290 TraceCheckUtils]: 13: Hoare triple {772#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~i~0#1 < main_~m~0#1);main_~j~0#1 := 0; {809#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:20:58,104 INFO L290 TraceCheckUtils]: 14: Hoare triple {809#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {813#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (<= 1500 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 14:20:58,105 INFO L290 TraceCheckUtils]: 15: Hoare triple {813#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (<= 1500 |ULTIMATE.start_main_~n~0#1|))} assume !(main_~j~0#1 < main_~n~0#1); {765#false} is VALID [2022-02-20 14:20:58,105 INFO L290 TraceCheckUtils]: 16: Hoare triple {765#false} main_~i~0#1 := 1 + main_~i~0#1; {765#false} is VALID [2022-02-20 14:20:58,105 INFO L290 TraceCheckUtils]: 17: Hoare triple {765#false} assume !(main_~i~0#1 < main_~m~0#1); {765#false} is VALID [2022-02-20 14:20:58,105 INFO L290 TraceCheckUtils]: 18: Hoare triple {765#false} main_~i~0#1 := 0;main_~j~0#1 := 0; {765#false} is VALID [2022-02-20 14:20:58,106 INFO L290 TraceCheckUtils]: 19: Hoare triple {765#false} assume !(main_~i~0#1 < main_~q~0#1); {765#false} is VALID [2022-02-20 14:20:58,106 INFO L290 TraceCheckUtils]: 20: Hoare triple {765#false} main_~i~0#1 := 0;main_~j~0#1 := 0; {765#false} is VALID [2022-02-20 14:20:58,106 INFO L290 TraceCheckUtils]: 21: Hoare triple {765#false} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {765#false} is VALID [2022-02-20 14:20:58,106 INFO L290 TraceCheckUtils]: 22: Hoare triple {765#false} assume !!(main_~j~0#1 < main_~s~0#1);call main_#t~mem6#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);call main_#t~mem7#1 := read~int(main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem6#1 == main_#t~mem7#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {765#false} is VALID [2022-02-20 14:20:58,106 INFO L290 TraceCheckUtils]: 23: Hoare triple {765#false} assume 0 == __VERIFIER_assert_~cond#1; {765#false} is VALID [2022-02-20 14:20:58,107 INFO L290 TraceCheckUtils]: 24: Hoare triple {765#false} assume !false; {765#false} is VALID [2022-02-20 14:20:58,107 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:20:58,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:20:58,222 INFO L290 TraceCheckUtils]: 24: Hoare triple {765#false} assume !false; {765#false} is VALID [2022-02-20 14:20:58,222 INFO L290 TraceCheckUtils]: 23: Hoare triple {765#false} assume 0 == __VERIFIER_assert_~cond#1; {765#false} is VALID [2022-02-20 14:20:58,222 INFO L290 TraceCheckUtils]: 22: Hoare triple {765#false} assume !!(main_~j~0#1 < main_~s~0#1);call main_#t~mem6#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);call main_#t~mem7#1 := read~int(main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem6#1 == main_#t~mem7#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {765#false} is VALID [2022-02-20 14:20:58,222 INFO L290 TraceCheckUtils]: 21: Hoare triple {765#false} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {765#false} is VALID [2022-02-20 14:20:58,223 INFO L290 TraceCheckUtils]: 20: Hoare triple {765#false} main_~i~0#1 := 0;main_~j~0#1 := 0; {765#false} is VALID [2022-02-20 14:20:58,223 INFO L290 TraceCheckUtils]: 19: Hoare triple {765#false} assume !(main_~i~0#1 < main_~q~0#1); {765#false} is VALID [2022-02-20 14:20:58,223 INFO L290 TraceCheckUtils]: 18: Hoare triple {765#false} main_~i~0#1 := 0;main_~j~0#1 := 0; {765#false} is VALID [2022-02-20 14:20:58,223 INFO L290 TraceCheckUtils]: 17: Hoare triple {765#false} assume !(main_~i~0#1 < main_~m~0#1); {765#false} is VALID [2022-02-20 14:20:58,223 INFO L290 TraceCheckUtils]: 16: Hoare triple {765#false} main_~i~0#1 := 1 + main_~i~0#1; {765#false} is VALID [2022-02-20 14:20:58,223 INFO L290 TraceCheckUtils]: 15: Hoare triple {871#(< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|)} assume !(main_~j~0#1 < main_~n~0#1); {765#false} is VALID [2022-02-20 14:20:58,224 INFO L290 TraceCheckUtils]: 14: Hoare triple {875#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {871#(< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:20:58,225 INFO L290 TraceCheckUtils]: 13: Hoare triple {879#(< 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~i~0#1 < main_~m~0#1);main_~j~0#1 := 0; {875#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:20:58,225 INFO L290 TraceCheckUtils]: 12: Hoare triple {879#(< 1 |ULTIMATE.start_main_~n~0#1|)} main_~i~0#1 := 0;main_~j~0#1 := 0; {879#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:20:58,228 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {764#true} {879#(< 1 |ULTIMATE.start_main_~n~0#1|)} #109#return; {879#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:20:58,228 INFO L290 TraceCheckUtils]: 10: Hoare triple {764#true} assume true; {764#true} is VALID [2022-02-20 14:20:58,228 INFO L290 TraceCheckUtils]: 9: Hoare triple {764#true} assume !(0 == ~cond); {764#true} is VALID [2022-02-20 14:20:58,228 INFO L290 TraceCheckUtils]: 8: Hoare triple {764#true} ~cond := #in~cond; {764#true} is VALID [2022-02-20 14:20:58,228 INFO L272 TraceCheckUtils]: 7: Hoare triple {879#(< 1 |ULTIMATE.start_main_~n~0#1|)} call assume_abort_if_not((if main_~s~0#1 < main_~n~0#1 then 1 else 0)); {764#true} is VALID [2022-02-20 14:20:58,229 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {764#true} {879#(< 1 |ULTIMATE.start_main_~n~0#1|)} #107#return; {879#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:20:58,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {764#true} assume true; {764#true} is VALID [2022-02-20 14:20:58,229 INFO L290 TraceCheckUtils]: 4: Hoare triple {764#true} assume !(0 == ~cond); {764#true} is VALID [2022-02-20 14:20:58,229 INFO L290 TraceCheckUtils]: 3: Hoare triple {764#true} ~cond := #in~cond; {764#true} is VALID [2022-02-20 14:20:58,230 INFO L272 TraceCheckUtils]: 2: Hoare triple {879#(< 1 |ULTIMATE.start_main_~n~0#1|)} call assume_abort_if_not((if main_~q~0#1 < main_~m~0#1 then 1 else 0)); {764#true} is VALID [2022-02-20 14:20:58,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {764#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_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1, main_~q~0#1, main_~s~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;main_~m~0#1 := 1000;main_~n~0#1 := 1500;main_~q~0#1 := 500;main_~s~0#1 := 700;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~m~0#1);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~m~0#1); {879#(< 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:20:58,231 INFO L290 TraceCheckUtils]: 0: Hoare triple {764#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(21, 2);call #Ultimate.allocInit(12, 3); {764#true} is VALID [2022-02-20 14:20:58,231 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:20:58,231 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:20:58,231 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406981279] [2022-02-20 14:20:58,231 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:20:58,231 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87235726] [2022-02-20 14:20:58,231 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87235726] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:20:58,231 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:20:58,231 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-02-20 14:20:58,232 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164063367] [2022-02-20 14:20:58,232 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:20:58,232 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2022-02-20 14:20:58,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:20:58,233 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 14:20:58,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:20:58,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 14:20:58,261 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:20:58,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 14:20:58,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-02-20 14:20:58,263 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 14:20:58,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:20:58,616 INFO L93 Difference]: Finished difference Result 89 states and 115 transitions. [2022-02-20 14:20:58,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 14:20:58,616 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2022-02-20 14:20:58,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:20:58,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 14:20:58,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2022-02-20 14:20:58,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 14:20:58,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2022-02-20 14:20:58,622 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 114 transitions. [2022-02-20 14:20:58,717 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:20:58,719 INFO L225 Difference]: With dead ends: 89 [2022-02-20 14:20:58,719 INFO L226 Difference]: Without dead ends: 73 [2022-02-20 14:20:58,719 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 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:20:58,720 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 147 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:20:58,720 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 65 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:20:58,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-02-20 14:20:58,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 29. [2022-02-20 14:20:58,784 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:20:58,784 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 29 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:20:58,784 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 29 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:20:58,784 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 29 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:20:58,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:20:58,790 INFO L93 Difference]: Finished difference Result 73 states and 91 transitions. [2022-02-20 14:20:58,790 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 91 transitions. [2022-02-20 14:20:58,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:20:58,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:20:58,794 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 73 states. [2022-02-20 14:20:58,794 INFO L87 Difference]: Start difference. First operand has 29 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 73 states. [2022-02-20 14:20:58,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:20:58,798 INFO L93 Difference]: Finished difference Result 73 states and 91 transitions. [2022-02-20 14:20:58,798 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 91 transitions. [2022-02-20 14:20:58,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:20:58,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:20:58,800 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:20:58,800 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:20:58,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:20:58,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-02-20 14:20:58,802 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 25 [2022-02-20 14:20:58,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:20:58,803 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-02-20 14:20:58,803 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 14:20:58,803 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-02-20 14:20:58,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 14:20:58,804 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:20:58,804 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:20:58,830 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,008 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,009 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:20:59,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:20:59,009 INFO L85 PathProgramCache]: Analyzing trace with hash 256970087, now seen corresponding path program 2 times [2022-02-20 14:20:59,009 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:20:59,009 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153738247] [2022-02-20 14:20:59,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:20:59,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:20:59,047 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:20:59,047 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1727225535] [2022-02-20 14:20:59,048 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:20:59,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:20:59,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:20:59,050 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,051 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,109 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-20 14:20:59,110 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:20:59,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 14:20:59,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:20:59,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:20:59,245 INFO L290 TraceCheckUtils]: 0: Hoare triple {1244#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(21, 2);call #Ultimate.allocInit(12, 3); {1244#true} is VALID [2022-02-20 14:20:59,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {1244#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_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1, main_~q~0#1, main_~s~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;main_~m~0#1 := 1000;main_~n~0#1 := 1500;main_~q~0#1 := 500;main_~s~0#1 := 700;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~m~0#1);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~m~0#1); {1252#(<= 500 |ULTIMATE.start_main_~q~0#1|)} is VALID [2022-02-20 14:20:59,247 INFO L272 TraceCheckUtils]: 2: Hoare triple {1252#(<= 500 |ULTIMATE.start_main_~q~0#1|)} call assume_abort_if_not((if main_~q~0#1 < main_~m~0#1 then 1 else 0)); {1244#true} is VALID [2022-02-20 14:20:59,247 INFO L290 TraceCheckUtils]: 3: Hoare triple {1244#true} ~cond := #in~cond; {1244#true} is VALID [2022-02-20 14:20:59,247 INFO L290 TraceCheckUtils]: 4: Hoare triple {1244#true} assume !(0 == ~cond); {1244#true} is VALID [2022-02-20 14:20:59,247 INFO L290 TraceCheckUtils]: 5: Hoare triple {1244#true} assume true; {1244#true} is VALID [2022-02-20 14:20:59,259 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1244#true} {1252#(<= 500 |ULTIMATE.start_main_~q~0#1|)} #107#return; {1252#(<= 500 |ULTIMATE.start_main_~q~0#1|)} is VALID [2022-02-20 14:20:59,260 INFO L272 TraceCheckUtils]: 7: Hoare triple {1252#(<= 500 |ULTIMATE.start_main_~q~0#1|)} call assume_abort_if_not((if main_~s~0#1 < main_~n~0#1 then 1 else 0)); {1244#true} is VALID [2022-02-20 14:20:59,260 INFO L290 TraceCheckUtils]: 8: Hoare triple {1244#true} ~cond := #in~cond; {1244#true} is VALID [2022-02-20 14:20:59,260 INFO L290 TraceCheckUtils]: 9: Hoare triple {1244#true} assume !(0 == ~cond); {1244#true} is VALID [2022-02-20 14:20:59,260 INFO L290 TraceCheckUtils]: 10: Hoare triple {1244#true} assume true; {1244#true} is VALID [2022-02-20 14:20:59,261 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1244#true} {1252#(<= 500 |ULTIMATE.start_main_~q~0#1|)} #109#return; {1252#(<= 500 |ULTIMATE.start_main_~q~0#1|)} is VALID [2022-02-20 14:20:59,261 INFO L290 TraceCheckUtils]: 12: Hoare triple {1252#(<= 500 |ULTIMATE.start_main_~q~0#1|)} main_~i~0#1 := 0;main_~j~0#1 := 0; {1252#(<= 500 |ULTIMATE.start_main_~q~0#1|)} is VALID [2022-02-20 14:20:59,261 INFO L290 TraceCheckUtils]: 13: Hoare triple {1252#(<= 500 |ULTIMATE.start_main_~q~0#1|)} assume !!(main_~i~0#1 < main_~m~0#1);main_~j~0#1 := 0; {1252#(<= 500 |ULTIMATE.start_main_~q~0#1|)} is VALID [2022-02-20 14:20:59,262 INFO L290 TraceCheckUtils]: 14: Hoare triple {1252#(<= 500 |ULTIMATE.start_main_~q~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {1252#(<= 500 |ULTIMATE.start_main_~q~0#1|)} is VALID [2022-02-20 14:20:59,262 INFO L290 TraceCheckUtils]: 15: Hoare triple {1252#(<= 500 |ULTIMATE.start_main_~q~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {1252#(<= 500 |ULTIMATE.start_main_~q~0#1|)} is VALID [2022-02-20 14:20:59,263 INFO L290 TraceCheckUtils]: 16: Hoare triple {1252#(<= 500 |ULTIMATE.start_main_~q~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {1252#(<= 500 |ULTIMATE.start_main_~q~0#1|)} is VALID [2022-02-20 14:20:59,263 INFO L290 TraceCheckUtils]: 17: Hoare triple {1252#(<= 500 |ULTIMATE.start_main_~q~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {1252#(<= 500 |ULTIMATE.start_main_~q~0#1|)} is VALID [2022-02-20 14:20:59,263 INFO L290 TraceCheckUtils]: 18: Hoare triple {1252#(<= 500 |ULTIMATE.start_main_~q~0#1|)} assume !(main_~j~0#1 < main_~n~0#1); {1252#(<= 500 |ULTIMATE.start_main_~q~0#1|)} is VALID [2022-02-20 14:20:59,264 INFO L290 TraceCheckUtils]: 19: Hoare triple {1252#(<= 500 |ULTIMATE.start_main_~q~0#1|)} main_~i~0#1 := 1 + main_~i~0#1; {1252#(<= 500 |ULTIMATE.start_main_~q~0#1|)} is VALID [2022-02-20 14:20:59,264 INFO L290 TraceCheckUtils]: 20: Hoare triple {1252#(<= 500 |ULTIMATE.start_main_~q~0#1|)} assume !(main_~i~0#1 < main_~m~0#1); {1252#(<= 500 |ULTIMATE.start_main_~q~0#1|)} is VALID [2022-02-20 14:20:59,265 INFO L290 TraceCheckUtils]: 21: Hoare triple {1252#(<= 500 |ULTIMATE.start_main_~q~0#1|)} main_~i~0#1 := 0;main_~j~0#1 := 0; {1313#(and (<= 500 |ULTIMATE.start_main_~q~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 0))} is VALID [2022-02-20 14:20:59,265 INFO L290 TraceCheckUtils]: 22: Hoare triple {1313#(and (<= 500 |ULTIMATE.start_main_~q~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 0))} assume !(main_~i~0#1 < main_~q~0#1); {1245#false} is VALID [2022-02-20 14:20:59,265 INFO L290 TraceCheckUtils]: 23: Hoare triple {1245#false} main_~i~0#1 := 0;main_~j~0#1 := 0; {1245#false} is VALID [2022-02-20 14:20:59,265 INFO L290 TraceCheckUtils]: 24: Hoare triple {1245#false} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {1245#false} is VALID [2022-02-20 14:20:59,266 INFO L290 TraceCheckUtils]: 25: Hoare triple {1245#false} assume !!(main_~j~0#1 < main_~s~0#1);call main_#t~mem6#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);call main_#t~mem7#1 := read~int(main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem6#1 == main_#t~mem7#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1245#false} is VALID [2022-02-20 14:20:59,266 INFO L290 TraceCheckUtils]: 26: Hoare triple {1245#false} assume 0 == __VERIFIER_assert_~cond#1; {1245#false} is VALID [2022-02-20 14:20:59,266 INFO L290 TraceCheckUtils]: 27: Hoare triple {1245#false} assume !false; {1245#false} is VALID [2022-02-20 14:20:59,266 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-20 14:20:59,266 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:20:59,266 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:20:59,266 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153738247] [2022-02-20 14:20:59,266 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:20:59,267 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727225535] [2022-02-20 14:20:59,267 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727225535] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:20:59,267 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:20:59,267 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 14:20:59,267 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456718825] [2022-02-20 14:20:59,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:20:59,268 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2022-02-20 14:20:59,268 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:20:59,268 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:20:59,287 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:20:59,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:20:59,288 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:20:59,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:20:59,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:20:59,289 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:20:59,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:20:59,450 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2022-02-20 14:20:59,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 14:20:59,450 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2022-02-20 14:20:59,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:20:59,450 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:20:59,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-02-20 14:20:59,452 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:20:59,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-02-20 14:20:59,453 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 56 transitions. [2022-02-20 14:20:59,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:20:59,504 INFO L225 Difference]: With dead ends: 53 [2022-02-20 14:20:59,504 INFO L226 Difference]: Without dead ends: 45 [2022-02-20 14:20:59,504 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 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:59,505 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 27 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:20:59,505 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 39 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:20:59,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-02-20 14:20:59,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2022-02-20 14:20:59,555 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:20:59,556 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 30 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:20:59,556 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 30 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:20:59,556 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 30 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:20:59,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:20:59,558 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2022-02-20 14:20:59,558 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2022-02-20 14:20:59,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:20:59,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:20:59,558 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 45 states. [2022-02-20 14:20:59,559 INFO L87 Difference]: Start difference. First operand has 30 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 45 states. [2022-02-20 14:20:59,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:20:59,560 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2022-02-20 14:20:59,560 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2022-02-20 14:20:59,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:20:59,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:20:59,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:20:59,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:20:59,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:20:59,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-02-20 14:20:59,562 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 28 [2022-02-20 14:20:59,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:20:59,563 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-02-20 14:20:59,563 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:20:59,563 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-02-20 14:20:59,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 14:20:59,564 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:20:59,564 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 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:59,590 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:20:59,777 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:20:59,778 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:20:59,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:20:59,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1830663741, now seen corresponding path program 1 times [2022-02-20 14:20:59,778 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:20:59,778 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765775425] [2022-02-20 14:20:59,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:20:59,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:20:59,796 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:20:59,796 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1220659919] [2022-02-20 14:20:59,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:20:59,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:20:59,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:20:59,798 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:20:59,824 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:20:59,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:20:59,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 14:20:59,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:20:59,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:21:00,096 INFO L290 TraceCheckUtils]: 0: Hoare triple {1548#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(21, 2);call #Ultimate.allocInit(12, 3); {1548#true} is VALID [2022-02-20 14:21:00,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {1548#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_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1, main_~q~0#1, main_~s~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;main_~m~0#1 := 1000;main_~n~0#1 := 1500;main_~q~0#1 := 500;main_~s~0#1 := 700;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~m~0#1);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~m~0#1); {1556#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:00,098 INFO L272 TraceCheckUtils]: 2: Hoare triple {1556#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} call assume_abort_if_not((if main_~q~0#1 < main_~m~0#1 then 1 else 0)); {1548#true} is VALID [2022-02-20 14:21:00,098 INFO L290 TraceCheckUtils]: 3: Hoare triple {1548#true} ~cond := #in~cond; {1548#true} is VALID [2022-02-20 14:21:00,098 INFO L290 TraceCheckUtils]: 4: Hoare triple {1548#true} assume !(0 == ~cond); {1548#true} is VALID [2022-02-20 14:21:00,098 INFO L290 TraceCheckUtils]: 5: Hoare triple {1548#true} assume true; {1548#true} is VALID [2022-02-20 14:21:00,099 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1548#true} {1556#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} #107#return; {1556#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:00,099 INFO L272 TraceCheckUtils]: 7: Hoare triple {1556#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} call assume_abort_if_not((if main_~s~0#1 < main_~n~0#1 then 1 else 0)); {1548#true} is VALID [2022-02-20 14:21:00,099 INFO L290 TraceCheckUtils]: 8: Hoare triple {1548#true} ~cond := #in~cond; {1548#true} is VALID [2022-02-20 14:21:00,100 INFO L290 TraceCheckUtils]: 9: Hoare triple {1548#true} assume !(0 == ~cond); {1548#true} is VALID [2022-02-20 14:21:00,100 INFO L290 TraceCheckUtils]: 10: Hoare triple {1548#true} assume true; {1548#true} is VALID [2022-02-20 14:21:00,100 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1548#true} {1556#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} #109#return; {1556#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:00,101 INFO L290 TraceCheckUtils]: 12: Hoare triple {1556#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} main_~i~0#1 := 0;main_~j~0#1 := 0; {1556#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:00,101 INFO L290 TraceCheckUtils]: 13: Hoare triple {1556#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~i~0#1 < main_~m~0#1);main_~j~0#1 := 0; {1593#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:21:00,102 INFO L290 TraceCheckUtils]: 14: Hoare triple {1593#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {1597#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (<= 1500 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 14:21:00,103 INFO L290 TraceCheckUtils]: 15: Hoare triple {1597#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (<= 1500 |ULTIMATE.start_main_~n~0#1|))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {1601#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 2))} is VALID [2022-02-20 14:21:00,104 INFO L290 TraceCheckUtils]: 16: Hoare triple {1601#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 2))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {1605#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 3))} is VALID [2022-02-20 14:21:00,105 INFO L290 TraceCheckUtils]: 17: Hoare triple {1605#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 3))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {1609#(and (<= |ULTIMATE.start_main_~j~0#1| 4) (<= 1500 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 14:21:00,105 INFO L290 TraceCheckUtils]: 18: Hoare triple {1609#(and (<= |ULTIMATE.start_main_~j~0#1| 4) (<= 1500 |ULTIMATE.start_main_~n~0#1|))} assume !(main_~j~0#1 < main_~n~0#1); {1549#false} is VALID [2022-02-20 14:21:00,105 INFO L290 TraceCheckUtils]: 19: Hoare triple {1549#false} main_~i~0#1 := 1 + main_~i~0#1; {1549#false} is VALID [2022-02-20 14:21:00,106 INFO L290 TraceCheckUtils]: 20: Hoare triple {1549#false} assume !(main_~i~0#1 < main_~m~0#1); {1549#false} is VALID [2022-02-20 14:21:00,106 INFO L290 TraceCheckUtils]: 21: Hoare triple {1549#false} main_~i~0#1 := 0;main_~j~0#1 := 0; {1549#false} is VALID [2022-02-20 14:21:00,106 INFO L290 TraceCheckUtils]: 22: Hoare triple {1549#false} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {1549#false} is VALID [2022-02-20 14:21:00,106 INFO L290 TraceCheckUtils]: 23: Hoare triple {1549#false} assume !(main_~j~0#1 < main_~s~0#1); {1549#false} is VALID [2022-02-20 14:21:00,106 INFO L290 TraceCheckUtils]: 24: Hoare triple {1549#false} main_~i~0#1 := 1 + main_~i~0#1; {1549#false} is VALID [2022-02-20 14:21:00,107 INFO L290 TraceCheckUtils]: 25: Hoare triple {1549#false} assume !(main_~i~0#1 < main_~q~0#1); {1549#false} is VALID [2022-02-20 14:21:00,107 INFO L290 TraceCheckUtils]: 26: Hoare triple {1549#false} main_~i~0#1 := 0;main_~j~0#1 := 0; {1549#false} is VALID [2022-02-20 14:21:00,107 INFO L290 TraceCheckUtils]: 27: Hoare triple {1549#false} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {1549#false} is VALID [2022-02-20 14:21:00,107 INFO L290 TraceCheckUtils]: 28: Hoare triple {1549#false} assume !!(main_~j~0#1 < main_~s~0#1);call main_#t~mem6#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);call main_#t~mem7#1 := read~int(main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem6#1 == main_#t~mem7#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1549#false} is VALID [2022-02-20 14:21:00,107 INFO L290 TraceCheckUtils]: 29: Hoare triple {1549#false} assume 0 == __VERIFIER_assert_~cond#1; {1549#false} is VALID [2022-02-20 14:21:00,107 INFO L290 TraceCheckUtils]: 30: Hoare triple {1549#false} assume !false; {1549#false} is VALID [2022-02-20 14:21:00,108 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 14:21:00,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:21:00,299 INFO L290 TraceCheckUtils]: 30: Hoare triple {1549#false} assume !false; {1549#false} is VALID [2022-02-20 14:21:00,300 INFO L290 TraceCheckUtils]: 29: Hoare triple {1549#false} assume 0 == __VERIFIER_assert_~cond#1; {1549#false} is VALID [2022-02-20 14:21:00,300 INFO L290 TraceCheckUtils]: 28: Hoare triple {1549#false} assume !!(main_~j~0#1 < main_~s~0#1);call main_#t~mem6#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);call main_#t~mem7#1 := read~int(main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem6#1 == main_#t~mem7#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1549#false} is VALID [2022-02-20 14:21:00,300 INFO L290 TraceCheckUtils]: 27: Hoare triple {1549#false} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {1549#false} is VALID [2022-02-20 14:21:00,300 INFO L290 TraceCheckUtils]: 26: Hoare triple {1549#false} main_~i~0#1 := 0;main_~j~0#1 := 0; {1549#false} is VALID [2022-02-20 14:21:00,300 INFO L290 TraceCheckUtils]: 25: Hoare triple {1549#false} assume !(main_~i~0#1 < main_~q~0#1); {1549#false} is VALID [2022-02-20 14:21:00,301 INFO L290 TraceCheckUtils]: 24: Hoare triple {1549#false} main_~i~0#1 := 1 + main_~i~0#1; {1549#false} is VALID [2022-02-20 14:21:00,301 INFO L290 TraceCheckUtils]: 23: Hoare triple {1549#false} assume !(main_~j~0#1 < main_~s~0#1); {1549#false} is VALID [2022-02-20 14:21:00,301 INFO L290 TraceCheckUtils]: 22: Hoare triple {1549#false} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {1549#false} is VALID [2022-02-20 14:21:00,301 INFO L290 TraceCheckUtils]: 21: Hoare triple {1549#false} main_~i~0#1 := 0;main_~j~0#1 := 0; {1549#false} is VALID [2022-02-20 14:21:00,301 INFO L290 TraceCheckUtils]: 20: Hoare triple {1549#false} assume !(main_~i~0#1 < main_~m~0#1); {1549#false} is VALID [2022-02-20 14:21:00,301 INFO L290 TraceCheckUtils]: 19: Hoare triple {1549#false} main_~i~0#1 := 1 + main_~i~0#1; {1549#false} is VALID [2022-02-20 14:21:00,304 INFO L290 TraceCheckUtils]: 18: Hoare triple {1685#(< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|)} assume !(main_~j~0#1 < main_~n~0#1); {1549#false} is VALID [2022-02-20 14:21:00,305 INFO L290 TraceCheckUtils]: 17: Hoare triple {1689#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {1685#(< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:00,306 INFO L290 TraceCheckUtils]: 16: Hoare triple {1693#(< (+ 2 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {1689#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:00,307 INFO L290 TraceCheckUtils]: 15: Hoare triple {1697#(< (+ 3 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {1693#(< (+ 2 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:00,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {1701#(< (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {1697#(< (+ 3 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:00,308 INFO L290 TraceCheckUtils]: 13: Hoare triple {1705#(< 4 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~i~0#1 < main_~m~0#1);main_~j~0#1 := 0; {1701#(< (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:00,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {1705#(< 4 |ULTIMATE.start_main_~n~0#1|)} main_~i~0#1 := 0;main_~j~0#1 := 0; {1705#(< 4 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:00,309 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1548#true} {1705#(< 4 |ULTIMATE.start_main_~n~0#1|)} #109#return; {1705#(< 4 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:00,309 INFO L290 TraceCheckUtils]: 10: Hoare triple {1548#true} assume true; {1548#true} is VALID [2022-02-20 14:21:00,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {1548#true} assume !(0 == ~cond); {1548#true} is VALID [2022-02-20 14:21:00,310 INFO L290 TraceCheckUtils]: 8: Hoare triple {1548#true} ~cond := #in~cond; {1548#true} is VALID [2022-02-20 14:21:00,310 INFO L272 TraceCheckUtils]: 7: Hoare triple {1705#(< 4 |ULTIMATE.start_main_~n~0#1|)} call assume_abort_if_not((if main_~s~0#1 < main_~n~0#1 then 1 else 0)); {1548#true} is VALID [2022-02-20 14:21:00,311 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1548#true} {1705#(< 4 |ULTIMATE.start_main_~n~0#1|)} #107#return; {1705#(< 4 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:00,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {1548#true} assume true; {1548#true} is VALID [2022-02-20 14:21:00,311 INFO L290 TraceCheckUtils]: 4: Hoare triple {1548#true} assume !(0 == ~cond); {1548#true} is VALID [2022-02-20 14:21:00,311 INFO L290 TraceCheckUtils]: 3: Hoare triple {1548#true} ~cond := #in~cond; {1548#true} is VALID [2022-02-20 14:21:00,311 INFO L272 TraceCheckUtils]: 2: Hoare triple {1705#(< 4 |ULTIMATE.start_main_~n~0#1|)} call assume_abort_if_not((if main_~q~0#1 < main_~m~0#1 then 1 else 0)); {1548#true} is VALID [2022-02-20 14:21:00,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {1548#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_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1, main_~q~0#1, main_~s~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;main_~m~0#1 := 1000;main_~n~0#1 := 1500;main_~q~0#1 := 500;main_~s~0#1 := 700;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~m~0#1);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~m~0#1); {1705#(< 4 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:00,315 INFO L290 TraceCheckUtils]: 0: Hoare triple {1548#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(21, 2);call #Ultimate.allocInit(12, 3); {1548#true} is VALID [2022-02-20 14:21:00,316 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 14:21:00,316 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:21:00,316 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765775425] [2022-02-20 14:21:00,316 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:21:00,316 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220659919] [2022-02-20 14:21:00,316 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220659919] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:21:00,316 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:21:00,317 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-02-20 14:21:00,317 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056968060] [2022-02-20 14:21:00,317 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:21:00,317 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2022-02-20 14:21:00,317 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:21:00,318 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 14:21:00,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:21:00,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 14:21:00,345 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:21:00,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 14:21:00,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2022-02-20 14:21:00,346 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 14:21:01,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:21:01,214 INFO L93 Difference]: Finished difference Result 166 states and 213 transitions. [2022-02-20 14:21:01,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 14:21:01,214 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2022-02-20 14:21:01,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:21:01,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 14:21:01,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 207 transitions. [2022-02-20 14:21:01,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 14:21:01,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 207 transitions. [2022-02-20 14:21:01,220 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 207 transitions. [2022-02-20 14:21:01,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 207 edges. 207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:21:01,401 INFO L225 Difference]: With dead ends: 166 [2022-02-20 14:21:01,401 INFO L226 Difference]: Without dead ends: 146 [2022-02-20 14:21:01,402 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 48 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:01,403 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 267 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 14:21:01,403 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [267 Valid, 131 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 14:21:01,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-02-20 14:21:01,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 36. [2022-02-20 14:21:01,483 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:21:01,484 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand has 36 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:21:01,484 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand has 36 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:21:01,484 INFO L87 Difference]: Start difference. First operand 146 states. Second operand has 36 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:21:01,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:21:01,489 INFO L93 Difference]: Finished difference Result 146 states and 182 transitions. [2022-02-20 14:21:01,489 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 182 transitions. [2022-02-20 14:21:01,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:21:01,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:21:01,489 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 146 states. [2022-02-20 14:21:01,490 INFO L87 Difference]: Start difference. First operand has 36 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 146 states. [2022-02-20 14:21:01,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:21:01,494 INFO L93 Difference]: Finished difference Result 146 states and 182 transitions. [2022-02-20 14:21:01,494 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 182 transitions. [2022-02-20 14:21:01,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:21:01,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:21:01,495 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:21:01,495 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:21:01,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:21:01,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2022-02-20 14:21:01,496 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 31 [2022-02-20 14:21:01,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:21:01,497 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-02-20 14:21:01,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 14:21:01,497 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-02-20 14:21:01,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 14:21:01,498 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:21:01,498 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 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:01,523 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,711 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,712 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:21:01,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:21:01,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1107716387, now seen corresponding path program 2 times [2022-02-20 14:21:01,712 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:21:01,712 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634029041] [2022-02-20 14:21:01,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:21:01,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:21:01,735 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:21:01,735 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [954272805] [2022-02-20 14:21:01,735 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:21:01,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:21:01,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:21:01,737 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,762 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,818 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:21:01,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:21:01,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 14:21:01,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:21:01,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:21:02,238 INFO L290 TraceCheckUtils]: 0: Hoare triple {2354#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(21, 2);call #Ultimate.allocInit(12, 3); {2354#true} is VALID [2022-02-20 14:21:02,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {2354#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_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1, main_~q~0#1, main_~s~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;main_~m~0#1 := 1000;main_~n~0#1 := 1500;main_~q~0#1 := 500;main_~s~0#1 := 700;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~m~0#1);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~m~0#1); {2362#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:02,239 INFO L272 TraceCheckUtils]: 2: Hoare triple {2362#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} call assume_abort_if_not((if main_~q~0#1 < main_~m~0#1 then 1 else 0)); {2354#true} is VALID [2022-02-20 14:21:02,239 INFO L290 TraceCheckUtils]: 3: Hoare triple {2354#true} ~cond := #in~cond; {2354#true} is VALID [2022-02-20 14:21:02,240 INFO L290 TraceCheckUtils]: 4: Hoare triple {2354#true} assume !(0 == ~cond); {2354#true} is VALID [2022-02-20 14:21:02,240 INFO L290 TraceCheckUtils]: 5: Hoare triple {2354#true} assume true; {2354#true} is VALID [2022-02-20 14:21:02,240 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2354#true} {2362#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} #107#return; {2362#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:02,241 INFO L272 TraceCheckUtils]: 7: Hoare triple {2362#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} call assume_abort_if_not((if main_~s~0#1 < main_~n~0#1 then 1 else 0)); {2354#true} is VALID [2022-02-20 14:21:02,241 INFO L290 TraceCheckUtils]: 8: Hoare triple {2354#true} ~cond := #in~cond; {2354#true} is VALID [2022-02-20 14:21:02,241 INFO L290 TraceCheckUtils]: 9: Hoare triple {2354#true} assume !(0 == ~cond); {2354#true} is VALID [2022-02-20 14:21:02,241 INFO L290 TraceCheckUtils]: 10: Hoare triple {2354#true} assume true; {2354#true} is VALID [2022-02-20 14:21:02,242 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {2354#true} {2362#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} #109#return; {2362#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:02,242 INFO L290 TraceCheckUtils]: 12: Hoare triple {2362#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} main_~i~0#1 := 0;main_~j~0#1 := 0; {2362#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:02,243 INFO L290 TraceCheckUtils]: 13: Hoare triple {2362#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~i~0#1 < main_~m~0#1);main_~j~0#1 := 0; {2399#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:21:02,248 INFO L290 TraceCheckUtils]: 14: Hoare triple {2399#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {2403#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (<= 1500 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 14:21:02,248 INFO L290 TraceCheckUtils]: 15: Hoare triple {2403#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (<= 1500 |ULTIMATE.start_main_~n~0#1|))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {2407#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 2))} is VALID [2022-02-20 14:21:02,249 INFO L290 TraceCheckUtils]: 16: Hoare triple {2407#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 2))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {2411#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 3))} is VALID [2022-02-20 14:21:02,250 INFO L290 TraceCheckUtils]: 17: Hoare triple {2411#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 3))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {2415#(and (<= |ULTIMATE.start_main_~j~0#1| 4) (<= 1500 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 14:21:02,250 INFO L290 TraceCheckUtils]: 18: Hoare triple {2415#(and (<= |ULTIMATE.start_main_~j~0#1| 4) (<= 1500 |ULTIMATE.start_main_~n~0#1|))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {2419#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 5))} is VALID [2022-02-20 14:21:02,251 INFO L290 TraceCheckUtils]: 19: Hoare triple {2419#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 5))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {2423#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 6))} is VALID [2022-02-20 14:21:02,252 INFO L290 TraceCheckUtils]: 20: Hoare triple {2423#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 6))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {2427#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 7))} is VALID [2022-02-20 14:21:02,253 INFO L290 TraceCheckUtils]: 21: Hoare triple {2427#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 7))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {2431#(and (<= |ULTIMATE.start_main_~j~0#1| 8) (<= 1500 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 14:21:02,253 INFO L290 TraceCheckUtils]: 22: Hoare triple {2431#(and (<= |ULTIMATE.start_main_~j~0#1| 8) (<= 1500 |ULTIMATE.start_main_~n~0#1|))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {2435#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 9))} is VALID [2022-02-20 14:21:02,254 INFO L290 TraceCheckUtils]: 23: Hoare triple {2435#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 9))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {2439#(and (<= |ULTIMATE.start_main_~j~0#1| 10) (<= 1500 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 14:21:02,255 INFO L290 TraceCheckUtils]: 24: Hoare triple {2439#(and (<= |ULTIMATE.start_main_~j~0#1| 10) (<= 1500 |ULTIMATE.start_main_~n~0#1|))} assume !(main_~j~0#1 < main_~n~0#1); {2355#false} is VALID [2022-02-20 14:21:02,255 INFO L290 TraceCheckUtils]: 25: Hoare triple {2355#false} main_~i~0#1 := 1 + main_~i~0#1; {2355#false} is VALID [2022-02-20 14:21:02,256 INFO L290 TraceCheckUtils]: 26: Hoare triple {2355#false} assume !(main_~i~0#1 < main_~m~0#1); {2355#false} is VALID [2022-02-20 14:21:02,256 INFO L290 TraceCheckUtils]: 27: Hoare triple {2355#false} main_~i~0#1 := 0;main_~j~0#1 := 0; {2355#false} is VALID [2022-02-20 14:21:02,256 INFO L290 TraceCheckUtils]: 28: Hoare triple {2355#false} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {2355#false} is VALID [2022-02-20 14:21:02,256 INFO L290 TraceCheckUtils]: 29: Hoare triple {2355#false} assume !(main_~j~0#1 < main_~s~0#1); {2355#false} is VALID [2022-02-20 14:21:02,256 INFO L290 TraceCheckUtils]: 30: Hoare triple {2355#false} main_~i~0#1 := 1 + main_~i~0#1; {2355#false} is VALID [2022-02-20 14:21:02,256 INFO L290 TraceCheckUtils]: 31: Hoare triple {2355#false} assume !(main_~i~0#1 < main_~q~0#1); {2355#false} is VALID [2022-02-20 14:21:02,256 INFO L290 TraceCheckUtils]: 32: Hoare triple {2355#false} main_~i~0#1 := 0;main_~j~0#1 := 0; {2355#false} is VALID [2022-02-20 14:21:02,257 INFO L290 TraceCheckUtils]: 33: Hoare triple {2355#false} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {2355#false} is VALID [2022-02-20 14:21:02,257 INFO L290 TraceCheckUtils]: 34: Hoare triple {2355#false} assume !!(main_~j~0#1 < main_~s~0#1);call main_#t~mem6#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);call main_#t~mem7#1 := read~int(main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem6#1 == main_#t~mem7#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2355#false} is VALID [2022-02-20 14:21:02,257 INFO L290 TraceCheckUtils]: 35: Hoare triple {2355#false} assume 0 == __VERIFIER_assert_~cond#1; {2355#false} is VALID [2022-02-20 14:21:02,262 INFO L290 TraceCheckUtils]: 36: Hoare triple {2355#false} assume !false; {2355#false} is VALID [2022-02-20 14:21:02,263 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 1 proven. 55 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 14:21:02,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:21:02,614 INFO L290 TraceCheckUtils]: 36: Hoare triple {2355#false} assume !false; {2355#false} is VALID [2022-02-20 14:21:02,614 INFO L290 TraceCheckUtils]: 35: Hoare triple {2355#false} assume 0 == __VERIFIER_assert_~cond#1; {2355#false} is VALID [2022-02-20 14:21:02,614 INFO L290 TraceCheckUtils]: 34: Hoare triple {2355#false} assume !!(main_~j~0#1 < main_~s~0#1);call main_#t~mem6#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);call main_#t~mem7#1 := read~int(main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem6#1 == main_#t~mem7#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2355#false} is VALID [2022-02-20 14:21:02,614 INFO L290 TraceCheckUtils]: 33: Hoare triple {2355#false} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {2355#false} is VALID [2022-02-20 14:21:02,615 INFO L290 TraceCheckUtils]: 32: Hoare triple {2355#false} main_~i~0#1 := 0;main_~j~0#1 := 0; {2355#false} is VALID [2022-02-20 14:21:02,615 INFO L290 TraceCheckUtils]: 31: Hoare triple {2355#false} assume !(main_~i~0#1 < main_~q~0#1); {2355#false} is VALID [2022-02-20 14:21:02,615 INFO L290 TraceCheckUtils]: 30: Hoare triple {2355#false} main_~i~0#1 := 1 + main_~i~0#1; {2355#false} is VALID [2022-02-20 14:21:02,615 INFO L290 TraceCheckUtils]: 29: Hoare triple {2355#false} assume !(main_~j~0#1 < main_~s~0#1); {2355#false} is VALID [2022-02-20 14:21:02,615 INFO L290 TraceCheckUtils]: 28: Hoare triple {2355#false} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {2355#false} is VALID [2022-02-20 14:21:02,615 INFO L290 TraceCheckUtils]: 27: Hoare triple {2355#false} main_~i~0#1 := 0;main_~j~0#1 := 0; {2355#false} is VALID [2022-02-20 14:21:02,616 INFO L290 TraceCheckUtils]: 26: Hoare triple {2355#false} assume !(main_~i~0#1 < main_~m~0#1); {2355#false} is VALID [2022-02-20 14:21:02,616 INFO L290 TraceCheckUtils]: 25: Hoare triple {2355#false} main_~i~0#1 := 1 + main_~i~0#1; {2355#false} is VALID [2022-02-20 14:21:02,617 INFO L290 TraceCheckUtils]: 24: Hoare triple {2515#(< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|)} assume !(main_~j~0#1 < main_~n~0#1); {2355#false} is VALID [2022-02-20 14:21:02,618 INFO L290 TraceCheckUtils]: 23: Hoare triple {2519#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {2515#(< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:02,619 INFO L290 TraceCheckUtils]: 22: Hoare triple {2523#(< (+ 2 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {2519#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:02,619 INFO L290 TraceCheckUtils]: 21: Hoare triple {2527#(< (+ 3 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {2523#(< (+ 2 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:02,620 INFO L290 TraceCheckUtils]: 20: Hoare triple {2531#(< (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {2527#(< (+ 3 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:02,621 INFO L290 TraceCheckUtils]: 19: Hoare triple {2535#(< (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {2531#(< (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:02,623 INFO L290 TraceCheckUtils]: 18: Hoare triple {2539#(< (+ 6 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {2535#(< (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:02,624 INFO L290 TraceCheckUtils]: 17: Hoare triple {2543#(< (+ 7 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {2539#(< (+ 6 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:02,625 INFO L290 TraceCheckUtils]: 16: Hoare triple {2547#(< (+ |ULTIMATE.start_main_~j~0#1| 8) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {2543#(< (+ 7 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:02,626 INFO L290 TraceCheckUtils]: 15: Hoare triple {2551#(< (+ 9 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {2547#(< (+ |ULTIMATE.start_main_~j~0#1| 8) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:02,626 INFO L290 TraceCheckUtils]: 14: Hoare triple {2555#(< (+ |ULTIMATE.start_main_~j~0#1| 10) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {2551#(< (+ 9 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:02,627 INFO L290 TraceCheckUtils]: 13: Hoare triple {2559#(< 10 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~i~0#1 < main_~m~0#1);main_~j~0#1 := 0; {2555#(< (+ |ULTIMATE.start_main_~j~0#1| 10) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:02,627 INFO L290 TraceCheckUtils]: 12: Hoare triple {2559#(< 10 |ULTIMATE.start_main_~n~0#1|)} main_~i~0#1 := 0;main_~j~0#1 := 0; {2559#(< 10 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:02,628 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {2354#true} {2559#(< 10 |ULTIMATE.start_main_~n~0#1|)} #109#return; {2559#(< 10 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:02,628 INFO L290 TraceCheckUtils]: 10: Hoare triple {2354#true} assume true; {2354#true} is VALID [2022-02-20 14:21:02,628 INFO L290 TraceCheckUtils]: 9: Hoare triple {2354#true} assume !(0 == ~cond); {2354#true} is VALID [2022-02-20 14:21:02,628 INFO L290 TraceCheckUtils]: 8: Hoare triple {2354#true} ~cond := #in~cond; {2354#true} is VALID [2022-02-20 14:21:02,628 INFO L272 TraceCheckUtils]: 7: Hoare triple {2559#(< 10 |ULTIMATE.start_main_~n~0#1|)} call assume_abort_if_not((if main_~s~0#1 < main_~n~0#1 then 1 else 0)); {2354#true} is VALID [2022-02-20 14:21:02,628 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2354#true} {2559#(< 10 |ULTIMATE.start_main_~n~0#1|)} #107#return; {2559#(< 10 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:02,629 INFO L290 TraceCheckUtils]: 5: Hoare triple {2354#true} assume true; {2354#true} is VALID [2022-02-20 14:21:02,629 INFO L290 TraceCheckUtils]: 4: Hoare triple {2354#true} assume !(0 == ~cond); {2354#true} is VALID [2022-02-20 14:21:02,629 INFO L290 TraceCheckUtils]: 3: Hoare triple {2354#true} ~cond := #in~cond; {2354#true} is VALID [2022-02-20 14:21:02,629 INFO L272 TraceCheckUtils]: 2: Hoare triple {2559#(< 10 |ULTIMATE.start_main_~n~0#1|)} call assume_abort_if_not((if main_~q~0#1 < main_~m~0#1 then 1 else 0)); {2354#true} is VALID [2022-02-20 14:21:02,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {2354#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_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1, main_~q~0#1, main_~s~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;main_~m~0#1 := 1000;main_~n~0#1 := 1500;main_~q~0#1 := 500;main_~s~0#1 := 700;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~m~0#1);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~m~0#1); {2559#(< 10 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:02,636 INFO L290 TraceCheckUtils]: 0: Hoare triple {2354#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(21, 2);call #Ultimate.allocInit(12, 3); {2354#true} is VALID [2022-02-20 14:21:02,638 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 1 proven. 55 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 14:21:02,638 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:21:02,638 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634029041] [2022-02-20 14:21:02,638 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:21:02,638 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954272805] [2022-02-20 14:21:02,638 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954272805] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:21:02,638 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:21:02,638 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-02-20 14:21:02,638 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51838753] [2022-02-20 14:21:02,638 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:21:02,639 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 26 states have internal predecessors, (44), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2022-02-20 14:21:02,640 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:21:02,641 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 26 states have internal predecessors, (44), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 14:21:02,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:21:02,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-02-20 14:21:02,674 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:21:02,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-02-20 14:21:02,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=347, Unknown=0, NotChecked=0, Total=650 [2022-02-20 14:21:02,676 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 26 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 26 states have internal predecessors, (44), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 14:21:05,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:21:05,218 INFO L93 Difference]: Finished difference Result 316 states and 405 transitions. [2022-02-20 14:21:05,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-02-20 14:21:05,218 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 26 states have internal predecessors, (44), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2022-02-20 14:21:05,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:21:05,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 26 states have internal predecessors, (44), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 14:21:05,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 393 transitions. [2022-02-20 14:21:05,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 26 states have internal predecessors, (44), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 14:21:05,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 393 transitions. [2022-02-20 14:21:05,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 393 transitions. [2022-02-20 14:21:05,553 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 393 edges. 393 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:21:05,560 INFO L225 Difference]: With dead ends: 316 [2022-02-20 14:21:05,561 INFO L226 Difference]: Without dead ends: 290 [2022-02-20 14:21:05,562 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=589, Invalid=743, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 14:21:05,562 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 654 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 532 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 532 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 14:21:05,563 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [654 Valid, 215 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [532 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 14:21:05,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-02-20 14:21:05,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 48. [2022-02-20 14:21:05,704 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:21:05,705 INFO L82 GeneralOperation]: Start isEquivalent. First operand 290 states. Second operand has 48 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 states have internal predecessors, (50), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:21:05,705 INFO L74 IsIncluded]: Start isIncluded. First operand 290 states. Second operand has 48 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 states have internal predecessors, (50), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:21:05,705 INFO L87 Difference]: Start difference. First operand 290 states. Second operand has 48 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 states have internal predecessors, (50), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:21:05,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:21:05,714 INFO L93 Difference]: Finished difference Result 290 states and 362 transitions. [2022-02-20 14:21:05,714 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 362 transitions. [2022-02-20 14:21:05,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:21:05,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:21:05,715 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 states have internal predecessors, (50), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 290 states. [2022-02-20 14:21:05,715 INFO L87 Difference]: Start difference. First operand has 48 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 states have internal predecessors, (50), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 290 states. [2022-02-20 14:21:05,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:21:05,724 INFO L93 Difference]: Finished difference Result 290 states and 362 transitions. [2022-02-20 14:21:05,724 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 362 transitions. [2022-02-20 14:21:05,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:21:05,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:21:05,725 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:21:05,725 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:21:05,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 states have internal predecessors, (50), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:21:05,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2022-02-20 14:21:05,727 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 37 [2022-02-20 14:21:05,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:21:05,727 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2022-02-20 14:21:05,727 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 26 states have internal predecessors, (44), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 14:21:05,727 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2022-02-20 14:21:05,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-02-20 14:21:05,728 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:21:05,728 INFO L514 BasicCegarLoop]: trace histogram [22, 2, 2, 2, 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:05,751 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:05,943 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:05,944 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:21:05,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:21:05,944 INFO L85 PathProgramCache]: Analyzing trace with hash 633180131, now seen corresponding path program 3 times [2022-02-20 14:21:05,944 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:21:05,945 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320931462] [2022-02-20 14:21:05,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:21:05,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:21:05,985 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:21:05,985 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2122622513] [2022-02-20 14:21:05,986 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 14:21:05,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:21:05,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:21:05,987 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:05,998 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:06,078 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-20 14:21:06,078 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:21:06,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 14:21:06,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:21:06,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:21:06,404 INFO L290 TraceCheckUtils]: 0: Hoare triple {3760#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(21, 2);call #Ultimate.allocInit(12, 3); {3760#true} is VALID [2022-02-20 14:21:06,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {3760#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_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1, main_~q~0#1, main_~s~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;main_~m~0#1 := 1000;main_~n~0#1 := 1500;main_~q~0#1 := 500;main_~s~0#1 := 700;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~m~0#1);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~m~0#1); {3768#(<= 1000 |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 14:21:06,405 INFO L272 TraceCheckUtils]: 2: Hoare triple {3768#(<= 1000 |ULTIMATE.start_main_~m~0#1|)} call assume_abort_if_not((if main_~q~0#1 < main_~m~0#1 then 1 else 0)); {3760#true} is VALID [2022-02-20 14:21:06,405 INFO L290 TraceCheckUtils]: 3: Hoare triple {3760#true} ~cond := #in~cond; {3760#true} is VALID [2022-02-20 14:21:06,405 INFO L290 TraceCheckUtils]: 4: Hoare triple {3760#true} assume !(0 == ~cond); {3760#true} is VALID [2022-02-20 14:21:06,405 INFO L290 TraceCheckUtils]: 5: Hoare triple {3760#true} assume true; {3760#true} is VALID [2022-02-20 14:21:06,406 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3760#true} {3768#(<= 1000 |ULTIMATE.start_main_~m~0#1|)} #107#return; {3768#(<= 1000 |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 14:21:06,406 INFO L272 TraceCheckUtils]: 7: Hoare triple {3768#(<= 1000 |ULTIMATE.start_main_~m~0#1|)} call assume_abort_if_not((if main_~s~0#1 < main_~n~0#1 then 1 else 0)); {3760#true} is VALID [2022-02-20 14:21:06,406 INFO L290 TraceCheckUtils]: 8: Hoare triple {3760#true} ~cond := #in~cond; {3760#true} is VALID [2022-02-20 14:21:06,406 INFO L290 TraceCheckUtils]: 9: Hoare triple {3760#true} assume !(0 == ~cond); {3760#true} is VALID [2022-02-20 14:21:06,406 INFO L290 TraceCheckUtils]: 10: Hoare triple {3760#true} assume true; {3760#true} is VALID [2022-02-20 14:21:06,407 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {3760#true} {3768#(<= 1000 |ULTIMATE.start_main_~m~0#1|)} #109#return; {3768#(<= 1000 |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 14:21:06,407 INFO L290 TraceCheckUtils]: 12: Hoare triple {3768#(<= 1000 |ULTIMATE.start_main_~m~0#1|)} main_~i~0#1 := 0;main_~j~0#1 := 0; {3802#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000 |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 14:21:06,408 INFO L290 TraceCheckUtils]: 13: Hoare triple {3802#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000 |ULTIMATE.start_main_~m~0#1|))} assume !!(main_~i~0#1 < main_~m~0#1);main_~j~0#1 := 0; {3802#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000 |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 14:21:06,408 INFO L290 TraceCheckUtils]: 14: Hoare triple {3802#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000 |ULTIMATE.start_main_~m~0#1|))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {3802#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000 |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 14:21:06,409 INFO L290 TraceCheckUtils]: 15: Hoare triple {3802#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000 |ULTIMATE.start_main_~m~0#1|))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {3802#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000 |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 14:21:06,410 INFO L290 TraceCheckUtils]: 16: Hoare triple {3802#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000 |ULTIMATE.start_main_~m~0#1|))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {3802#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000 |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 14:21:06,410 INFO L290 TraceCheckUtils]: 17: Hoare triple {3802#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000 |ULTIMATE.start_main_~m~0#1|))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {3802#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000 |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 14:21:06,411 INFO L290 TraceCheckUtils]: 18: Hoare triple {3802#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000 |ULTIMATE.start_main_~m~0#1|))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {3802#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000 |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 14:21:06,412 INFO L290 TraceCheckUtils]: 19: Hoare triple {3802#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000 |ULTIMATE.start_main_~m~0#1|))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {3802#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000 |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 14:21:06,412 INFO L290 TraceCheckUtils]: 20: Hoare triple {3802#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000 |ULTIMATE.start_main_~m~0#1|))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {3802#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000 |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 14:21:06,413 INFO L290 TraceCheckUtils]: 21: Hoare triple {3802#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000 |ULTIMATE.start_main_~m~0#1|))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {3802#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000 |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 14:21:06,413 INFO L290 TraceCheckUtils]: 22: Hoare triple {3802#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000 |ULTIMATE.start_main_~m~0#1|))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {3802#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000 |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 14:21:06,414 INFO L290 TraceCheckUtils]: 23: Hoare triple {3802#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000 |ULTIMATE.start_main_~m~0#1|))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {3802#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000 |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 14:21:06,416 INFO L290 TraceCheckUtils]: 24: Hoare triple {3802#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000 |ULTIMATE.start_main_~m~0#1|))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {3802#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000 |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 14:21:06,416 INFO L290 TraceCheckUtils]: 25: Hoare triple {3802#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000 |ULTIMATE.start_main_~m~0#1|))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {3802#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000 |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 14:21:06,417 INFO L290 TraceCheckUtils]: 26: Hoare triple {3802#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000 |ULTIMATE.start_main_~m~0#1|))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {3802#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000 |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 14:21:06,417 INFO L290 TraceCheckUtils]: 27: Hoare triple {3802#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000 |ULTIMATE.start_main_~m~0#1|))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {3802#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000 |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 14:21:06,418 INFO L290 TraceCheckUtils]: 28: Hoare triple {3802#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000 |ULTIMATE.start_main_~m~0#1|))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {3802#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000 |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 14:21:06,419 INFO L290 TraceCheckUtils]: 29: Hoare triple {3802#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000 |ULTIMATE.start_main_~m~0#1|))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {3802#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000 |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 14:21:06,419 INFO L290 TraceCheckUtils]: 30: Hoare triple {3802#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000 |ULTIMATE.start_main_~m~0#1|))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {3802#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000 |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 14:21:06,420 INFO L290 TraceCheckUtils]: 31: Hoare triple {3802#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000 |ULTIMATE.start_main_~m~0#1|))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {3802#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000 |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 14:21:06,420 INFO L290 TraceCheckUtils]: 32: Hoare triple {3802#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000 |ULTIMATE.start_main_~m~0#1|))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {3802#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000 |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 14:21:06,421 INFO L290 TraceCheckUtils]: 33: Hoare triple {3802#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000 |ULTIMATE.start_main_~m~0#1|))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {3802#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000 |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 14:21:06,421 INFO L290 TraceCheckUtils]: 34: Hoare triple {3802#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000 |ULTIMATE.start_main_~m~0#1|))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {3802#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000 |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 14:21:06,422 INFO L290 TraceCheckUtils]: 35: Hoare triple {3802#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000 |ULTIMATE.start_main_~m~0#1|))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {3802#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000 |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 14:21:06,422 INFO L290 TraceCheckUtils]: 36: Hoare triple {3802#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000 |ULTIMATE.start_main_~m~0#1|))} assume !(main_~j~0#1 < main_~n~0#1); {3802#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000 |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-20 14:21:06,423 INFO L290 TraceCheckUtils]: 37: Hoare triple {3802#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000 |ULTIMATE.start_main_~m~0#1|))} main_~i~0#1 := 1 + main_~i~0#1; {3878#(and (<= 1000 |ULTIMATE.start_main_~m~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:21:06,424 INFO L290 TraceCheckUtils]: 38: Hoare triple {3878#(and (<= 1000 |ULTIMATE.start_main_~m~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !(main_~i~0#1 < main_~m~0#1); {3761#false} is VALID [2022-02-20 14:21:06,424 INFO L290 TraceCheckUtils]: 39: Hoare triple {3761#false} main_~i~0#1 := 0;main_~j~0#1 := 0; {3761#false} is VALID [2022-02-20 14:21:06,424 INFO L290 TraceCheckUtils]: 40: Hoare triple {3761#false} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {3761#false} is VALID [2022-02-20 14:21:06,424 INFO L290 TraceCheckUtils]: 41: Hoare triple {3761#false} assume !(main_~j~0#1 < main_~s~0#1); {3761#false} is VALID [2022-02-20 14:21:06,425 INFO L290 TraceCheckUtils]: 42: Hoare triple {3761#false} main_~i~0#1 := 1 + main_~i~0#1; {3761#false} is VALID [2022-02-20 14:21:06,425 INFO L290 TraceCheckUtils]: 43: Hoare triple {3761#false} assume !(main_~i~0#1 < main_~q~0#1); {3761#false} is VALID [2022-02-20 14:21:06,425 INFO L290 TraceCheckUtils]: 44: Hoare triple {3761#false} main_~i~0#1 := 0;main_~j~0#1 := 0; {3761#false} is VALID [2022-02-20 14:21:06,425 INFO L290 TraceCheckUtils]: 45: Hoare triple {3761#false} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {3761#false} is VALID [2022-02-20 14:21:06,425 INFO L290 TraceCheckUtils]: 46: Hoare triple {3761#false} assume !!(main_~j~0#1 < main_~s~0#1);call main_#t~mem6#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);call main_#t~mem7#1 := read~int(main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem6#1 == main_#t~mem7#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3761#false} is VALID [2022-02-20 14:21:06,425 INFO L290 TraceCheckUtils]: 47: Hoare triple {3761#false} assume 0 == __VERIFIER_assert_~cond#1; {3761#false} is VALID [2022-02-20 14:21:06,425 INFO L290 TraceCheckUtils]: 48: Hoare triple {3761#false} assume !false; {3761#false} is VALID [2022-02-20 14:21:06,426 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2022-02-20 14:21:06,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:21:06,631 INFO L290 TraceCheckUtils]: 48: Hoare triple {3761#false} assume !false; {3761#false} is VALID [2022-02-20 14:21:06,631 INFO L290 TraceCheckUtils]: 47: Hoare triple {3761#false} assume 0 == __VERIFIER_assert_~cond#1; {3761#false} is VALID [2022-02-20 14:21:06,631 INFO L290 TraceCheckUtils]: 46: Hoare triple {3761#false} assume !!(main_~j~0#1 < main_~s~0#1);call main_#t~mem6#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);call main_#t~mem7#1 := read~int(main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem6#1 == main_#t~mem7#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3761#false} is VALID [2022-02-20 14:21:06,631 INFO L290 TraceCheckUtils]: 45: Hoare triple {3761#false} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {3761#false} is VALID [2022-02-20 14:21:06,631 INFO L290 TraceCheckUtils]: 44: Hoare triple {3761#false} main_~i~0#1 := 0;main_~j~0#1 := 0; {3761#false} is VALID [2022-02-20 14:21:06,631 INFO L290 TraceCheckUtils]: 43: Hoare triple {3761#false} assume !(main_~i~0#1 < main_~q~0#1); {3761#false} is VALID [2022-02-20 14:21:06,631 INFO L290 TraceCheckUtils]: 42: Hoare triple {3761#false} main_~i~0#1 := 1 + main_~i~0#1; {3761#false} is VALID [2022-02-20 14:21:06,632 INFO L290 TraceCheckUtils]: 41: Hoare triple {3761#false} assume !(main_~j~0#1 < main_~s~0#1); {3761#false} is VALID [2022-02-20 14:21:06,632 INFO L290 TraceCheckUtils]: 40: Hoare triple {3761#false} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {3761#false} is VALID [2022-02-20 14:21:06,632 INFO L290 TraceCheckUtils]: 39: Hoare triple {3761#false} main_~i~0#1 := 0;main_~j~0#1 := 0; {3761#false} is VALID [2022-02-20 14:21:06,632 INFO L290 TraceCheckUtils]: 38: Hoare triple {3942#(< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~m~0#1|)} assume !(main_~i~0#1 < main_~m~0#1); {3761#false} is VALID [2022-02-20 14:21:06,633 INFO L290 TraceCheckUtils]: 37: Hoare triple {3946#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} main_~i~0#1 := 1 + main_~i~0#1; {3942#(< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 14:21:06,633 INFO L290 TraceCheckUtils]: 36: Hoare triple {3946#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} assume !(main_~j~0#1 < main_~n~0#1); {3946#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 14:21:06,634 INFO L290 TraceCheckUtils]: 35: Hoare triple {3946#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {3946#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 14:21:06,634 INFO L290 TraceCheckUtils]: 34: Hoare triple {3946#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {3946#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 14:21:06,634 INFO L290 TraceCheckUtils]: 33: Hoare triple {3946#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {3946#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 14:21:06,635 INFO L290 TraceCheckUtils]: 32: Hoare triple {3946#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {3946#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 14:21:06,635 INFO L290 TraceCheckUtils]: 31: Hoare triple {3946#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {3946#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 14:21:06,636 INFO L290 TraceCheckUtils]: 30: Hoare triple {3946#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {3946#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 14:21:06,636 INFO L290 TraceCheckUtils]: 29: Hoare triple {3946#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {3946#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 14:21:06,636 INFO L290 TraceCheckUtils]: 28: Hoare triple {3946#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {3946#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 14:21:06,637 INFO L290 TraceCheckUtils]: 27: Hoare triple {3946#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {3946#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 14:21:06,637 INFO L290 TraceCheckUtils]: 26: Hoare triple {3946#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {3946#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 14:21:06,637 INFO L290 TraceCheckUtils]: 25: Hoare triple {3946#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {3946#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 14:21:06,638 INFO L290 TraceCheckUtils]: 24: Hoare triple {3946#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {3946#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 14:21:06,638 INFO L290 TraceCheckUtils]: 23: Hoare triple {3946#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {3946#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 14:21:06,638 INFO L290 TraceCheckUtils]: 22: Hoare triple {3946#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {3946#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 14:21:06,639 INFO L290 TraceCheckUtils]: 21: Hoare triple {3946#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {3946#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 14:21:06,639 INFO L290 TraceCheckUtils]: 20: Hoare triple {3946#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {3946#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 14:21:06,639 INFO L290 TraceCheckUtils]: 19: Hoare triple {3946#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {3946#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 14:21:06,640 INFO L290 TraceCheckUtils]: 18: Hoare triple {3946#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {3946#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 14:21:06,640 INFO L290 TraceCheckUtils]: 17: Hoare triple {3946#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {3946#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 14:21:06,641 INFO L290 TraceCheckUtils]: 16: Hoare triple {3946#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {3946#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 14:21:06,641 INFO L290 TraceCheckUtils]: 15: Hoare triple {3946#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {3946#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 14:21:06,641 INFO L290 TraceCheckUtils]: 14: Hoare triple {3946#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {3946#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 14:21:06,642 INFO L290 TraceCheckUtils]: 13: Hoare triple {3946#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} assume !!(main_~i~0#1 < main_~m~0#1);main_~j~0#1 := 0; {3946#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 14:21:06,642 INFO L290 TraceCheckUtils]: 12: Hoare triple {4022#(< 1 |ULTIMATE.start_main_~m~0#1|)} main_~i~0#1 := 0;main_~j~0#1 := 0; {3946#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 14:21:06,643 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {3760#true} {4022#(< 1 |ULTIMATE.start_main_~m~0#1|)} #109#return; {4022#(< 1 |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 14:21:06,643 INFO L290 TraceCheckUtils]: 10: Hoare triple {3760#true} assume true; {3760#true} is VALID [2022-02-20 14:21:06,643 INFO L290 TraceCheckUtils]: 9: Hoare triple {3760#true} assume !(0 == ~cond); {3760#true} is VALID [2022-02-20 14:21:06,643 INFO L290 TraceCheckUtils]: 8: Hoare triple {3760#true} ~cond := #in~cond; {3760#true} is VALID [2022-02-20 14:21:06,643 INFO L272 TraceCheckUtils]: 7: Hoare triple {4022#(< 1 |ULTIMATE.start_main_~m~0#1|)} call assume_abort_if_not((if main_~s~0#1 < main_~n~0#1 then 1 else 0)); {3760#true} is VALID [2022-02-20 14:21:06,644 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3760#true} {4022#(< 1 |ULTIMATE.start_main_~m~0#1|)} #107#return; {4022#(< 1 |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 14:21:06,644 INFO L290 TraceCheckUtils]: 5: Hoare triple {3760#true} assume true; {3760#true} is VALID [2022-02-20 14:21:06,644 INFO L290 TraceCheckUtils]: 4: Hoare triple {3760#true} assume !(0 == ~cond); {3760#true} is VALID [2022-02-20 14:21:06,644 INFO L290 TraceCheckUtils]: 3: Hoare triple {3760#true} ~cond := #in~cond; {3760#true} is VALID [2022-02-20 14:21:06,644 INFO L272 TraceCheckUtils]: 2: Hoare triple {4022#(< 1 |ULTIMATE.start_main_~m~0#1|)} call assume_abort_if_not((if main_~q~0#1 < main_~m~0#1 then 1 else 0)); {3760#true} is VALID [2022-02-20 14:21:06,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {3760#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_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1, main_~q~0#1, main_~s~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;main_~m~0#1 := 1000;main_~n~0#1 := 1500;main_~q~0#1 := 500;main_~s~0#1 := 700;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~m~0#1);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~m~0#1); {4022#(< 1 |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-20 14:21:06,645 INFO L290 TraceCheckUtils]: 0: Hoare triple {3760#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(21, 2);call #Ultimate.allocInit(12, 3); {3760#true} is VALID [2022-02-20 14:21:06,646 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2022-02-20 14:21:06,646 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:21:06,646 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320931462] [2022-02-20 14:21:06,646 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:21:06,646 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122622513] [2022-02-20 14:21:06,646 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122622513] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:21:06,647 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:21:06,647 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-02-20 14:21:06,647 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266015343] [2022-02-20 14:21:06,647 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:21:06,648 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 49 [2022-02-20 14:21:06,648 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:21:06,648 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 14:21:06,695 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:21:06,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 14:21:06,696 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:21:06,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 14:21:06,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-02-20 14:21:06,696 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 14:21:07,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:21:07,601 INFO L93 Difference]: Finished difference Result 178 states and 204 transitions. [2022-02-20 14:21:07,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 14:21:07,602 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 49 [2022-02-20 14:21:07,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:21:07,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 14:21:07,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2022-02-20 14:21:07,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 14:21:07,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2022-02-20 14:21:07,607 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 115 transitions. [2022-02-20 14:21:07,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:21:07,702 INFO L225 Difference]: With dead ends: 178 [2022-02-20 14:21:07,702 INFO L226 Difference]: Without dead ends: 165 [2022-02-20 14:21:07,702 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 90 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:07,702 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 211 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:21:07,703 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [211 Valid, 64 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:21:07,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-02-20 14:21:08,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 123. [2022-02-20 14:21:08,029 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:21:08,030 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand has 123 states, 119 states have (on average 1.0756302521008403) internal successors, (128), 119 states have internal predecessors, (128), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:21:08,030 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand has 123 states, 119 states have (on average 1.0756302521008403) internal successors, (128), 119 states have internal predecessors, (128), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:21:08,031 INFO L87 Difference]: Start difference. First operand 165 states. Second operand has 123 states, 119 states have (on average 1.0756302521008403) internal successors, (128), 119 states have internal predecessors, (128), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:21:08,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:21:08,034 INFO L93 Difference]: Finished difference Result 165 states and 185 transitions. [2022-02-20 14:21:08,034 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 185 transitions. [2022-02-20 14:21:08,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:21:08,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:21:08,035 INFO L74 IsIncluded]: Start isIncluded. First operand has 123 states, 119 states have (on average 1.0756302521008403) internal successors, (128), 119 states have internal predecessors, (128), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 165 states. [2022-02-20 14:21:08,035 INFO L87 Difference]: Start difference. First operand has 123 states, 119 states have (on average 1.0756302521008403) internal successors, (128), 119 states have internal predecessors, (128), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 165 states. [2022-02-20 14:21:08,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:21:08,039 INFO L93 Difference]: Finished difference Result 165 states and 185 transitions. [2022-02-20 14:21:08,039 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 185 transitions. [2022-02-20 14:21:08,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:21:08,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:21:08,039 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:21:08,039 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:21:08,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 119 states have (on average 1.0756302521008403) internal successors, (128), 119 states have internal predecessors, (128), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:21:08,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 132 transitions. [2022-02-20 14:21:08,043 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 132 transitions. Word has length 49 [2022-02-20 14:21:08,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:21:08,043 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 132 transitions. [2022-02-20 14:21:08,043 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 14:21:08,043 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 132 transitions. [2022-02-20 14:21:08,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-20 14:21:08,045 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:21:08,045 INFO L514 BasicCegarLoop]: trace histogram [88, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:21:08,069 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:08,259 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:08,260 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:21:08,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:21:08,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1798415483, now seen corresponding path program 4 times [2022-02-20 14:21:08,260 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:21:08,260 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642168396] [2022-02-20 14:21:08,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:21:08,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:21:08,358 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:21:08,358 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1685737281] [2022-02-20 14:21:08,358 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 14:21:08,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:21:08,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:21:08,360 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:08,368 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:08,553 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 14:21:08,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:21:08,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 14:21:08,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:21:08,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:21:08,859 INFO L290 TraceCheckUtils]: 0: Hoare triple {4930#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(21, 2);call #Ultimate.allocInit(12, 3); {4930#true} is VALID [2022-02-20 14:21:08,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {4930#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_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1, main_~q~0#1, main_~s~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;main_~m~0#1 := 1000;main_~n~0#1 := 1500;main_~q~0#1 := 500;main_~s~0#1 := 700;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~m~0#1);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~m~0#1); {4930#true} is VALID [2022-02-20 14:21:08,860 INFO L272 TraceCheckUtils]: 2: Hoare triple {4930#true} call assume_abort_if_not((if main_~q~0#1 < main_~m~0#1 then 1 else 0)); {4930#true} is VALID [2022-02-20 14:21:08,860 INFO L290 TraceCheckUtils]: 3: Hoare triple {4930#true} ~cond := #in~cond; {4930#true} is VALID [2022-02-20 14:21:08,860 INFO L290 TraceCheckUtils]: 4: Hoare triple {4930#true} assume !(0 == ~cond); {4930#true} is VALID [2022-02-20 14:21:08,860 INFO L290 TraceCheckUtils]: 5: Hoare triple {4930#true} assume true; {4930#true} is VALID [2022-02-20 14:21:08,860 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {4930#true} {4930#true} #107#return; {4930#true} is VALID [2022-02-20 14:21:08,860 INFO L272 TraceCheckUtils]: 7: Hoare triple {4930#true} call assume_abort_if_not((if main_~s~0#1 < main_~n~0#1 then 1 else 0)); {4930#true} is VALID [2022-02-20 14:21:08,860 INFO L290 TraceCheckUtils]: 8: Hoare triple {4930#true} ~cond := #in~cond; {4930#true} is VALID [2022-02-20 14:21:08,860 INFO L290 TraceCheckUtils]: 9: Hoare triple {4930#true} assume !(0 == ~cond); {4930#true} is VALID [2022-02-20 14:21:08,861 INFO L290 TraceCheckUtils]: 10: Hoare triple {4930#true} assume true; {4930#true} is VALID [2022-02-20 14:21:08,861 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {4930#true} {4930#true} #109#return; {4930#true} is VALID [2022-02-20 14:21:08,861 INFO L290 TraceCheckUtils]: 12: Hoare triple {4930#true} main_~i~0#1 := 0;main_~j~0#1 := 0; {4930#true} is VALID [2022-02-20 14:21:08,861 INFO L290 TraceCheckUtils]: 13: Hoare triple {4930#true} assume !!(main_~i~0#1 < main_~m~0#1);main_~j~0#1 := 0; {4930#true} is VALID [2022-02-20 14:21:08,861 INFO L290 TraceCheckUtils]: 14: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,861 INFO L290 TraceCheckUtils]: 15: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,861 INFO L290 TraceCheckUtils]: 16: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,861 INFO L290 TraceCheckUtils]: 17: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,861 INFO L290 TraceCheckUtils]: 18: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,861 INFO L290 TraceCheckUtils]: 19: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,863 INFO L290 TraceCheckUtils]: 20: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,863 INFO L290 TraceCheckUtils]: 21: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,863 INFO L290 TraceCheckUtils]: 22: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,863 INFO L290 TraceCheckUtils]: 23: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,863 INFO L290 TraceCheckUtils]: 24: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,863 INFO L290 TraceCheckUtils]: 25: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,863 INFO L290 TraceCheckUtils]: 26: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,863 INFO L290 TraceCheckUtils]: 27: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,863 INFO L290 TraceCheckUtils]: 28: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,863 INFO L290 TraceCheckUtils]: 29: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,863 INFO L290 TraceCheckUtils]: 30: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,864 INFO L290 TraceCheckUtils]: 31: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,864 INFO L290 TraceCheckUtils]: 32: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,864 INFO L290 TraceCheckUtils]: 33: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,864 INFO L290 TraceCheckUtils]: 34: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,864 INFO L290 TraceCheckUtils]: 35: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,864 INFO L290 TraceCheckUtils]: 36: Hoare triple {4930#true} assume !(main_~j~0#1 < main_~n~0#1); {4930#true} is VALID [2022-02-20 14:21:08,864 INFO L290 TraceCheckUtils]: 37: Hoare triple {4930#true} main_~i~0#1 := 1 + main_~i~0#1; {4930#true} is VALID [2022-02-20 14:21:08,864 INFO L290 TraceCheckUtils]: 38: Hoare triple {4930#true} assume !!(main_~i~0#1 < main_~m~0#1);main_~j~0#1 := 0; {4930#true} is VALID [2022-02-20 14:21:08,864 INFO L290 TraceCheckUtils]: 39: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,864 INFO L290 TraceCheckUtils]: 40: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,865 INFO L290 TraceCheckUtils]: 41: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,865 INFO L290 TraceCheckUtils]: 42: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,865 INFO L290 TraceCheckUtils]: 43: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,865 INFO L290 TraceCheckUtils]: 44: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,865 INFO L290 TraceCheckUtils]: 45: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,865 INFO L290 TraceCheckUtils]: 46: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,865 INFO L290 TraceCheckUtils]: 47: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,865 INFO L290 TraceCheckUtils]: 48: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,865 INFO L290 TraceCheckUtils]: 49: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,865 INFO L290 TraceCheckUtils]: 50: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,866 INFO L290 TraceCheckUtils]: 51: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,866 INFO L290 TraceCheckUtils]: 52: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,866 INFO L290 TraceCheckUtils]: 53: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,866 INFO L290 TraceCheckUtils]: 54: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,866 INFO L290 TraceCheckUtils]: 55: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,866 INFO L290 TraceCheckUtils]: 56: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,866 INFO L290 TraceCheckUtils]: 57: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,866 INFO L290 TraceCheckUtils]: 58: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,866 INFO L290 TraceCheckUtils]: 59: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,866 INFO L290 TraceCheckUtils]: 60: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,866 INFO L290 TraceCheckUtils]: 61: Hoare triple {4930#true} assume !(main_~j~0#1 < main_~n~0#1); {4930#true} is VALID [2022-02-20 14:21:08,867 INFO L290 TraceCheckUtils]: 62: Hoare triple {4930#true} main_~i~0#1 := 1 + main_~i~0#1; {4930#true} is VALID [2022-02-20 14:21:08,867 INFO L290 TraceCheckUtils]: 63: Hoare triple {4930#true} assume !!(main_~i~0#1 < main_~m~0#1);main_~j~0#1 := 0; {4930#true} is VALID [2022-02-20 14:21:08,867 INFO L290 TraceCheckUtils]: 64: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,867 INFO L290 TraceCheckUtils]: 65: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,867 INFO L290 TraceCheckUtils]: 66: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,867 INFO L290 TraceCheckUtils]: 67: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,867 INFO L290 TraceCheckUtils]: 68: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,867 INFO L290 TraceCheckUtils]: 69: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,867 INFO L290 TraceCheckUtils]: 70: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,867 INFO L290 TraceCheckUtils]: 71: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,868 INFO L290 TraceCheckUtils]: 72: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,868 INFO L290 TraceCheckUtils]: 73: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,868 INFO L290 TraceCheckUtils]: 74: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,868 INFO L290 TraceCheckUtils]: 75: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,868 INFO L290 TraceCheckUtils]: 76: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,868 INFO L290 TraceCheckUtils]: 77: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,868 INFO L290 TraceCheckUtils]: 78: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,868 INFO L290 TraceCheckUtils]: 79: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,868 INFO L290 TraceCheckUtils]: 80: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,868 INFO L290 TraceCheckUtils]: 81: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,869 INFO L290 TraceCheckUtils]: 82: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,869 INFO L290 TraceCheckUtils]: 83: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,869 INFO L290 TraceCheckUtils]: 84: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,869 INFO L290 TraceCheckUtils]: 85: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,869 INFO L290 TraceCheckUtils]: 86: Hoare triple {4930#true} assume !(main_~j~0#1 < main_~n~0#1); {4930#true} is VALID [2022-02-20 14:21:08,869 INFO L290 TraceCheckUtils]: 87: Hoare triple {4930#true} main_~i~0#1 := 1 + main_~i~0#1; {4930#true} is VALID [2022-02-20 14:21:08,869 INFO L290 TraceCheckUtils]: 88: Hoare triple {4930#true} assume !!(main_~i~0#1 < main_~m~0#1);main_~j~0#1 := 0; {4930#true} is VALID [2022-02-20 14:21:08,869 INFO L290 TraceCheckUtils]: 89: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,869 INFO L290 TraceCheckUtils]: 90: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,869 INFO L290 TraceCheckUtils]: 91: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,869 INFO L290 TraceCheckUtils]: 92: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,870 INFO L290 TraceCheckUtils]: 93: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,870 INFO L290 TraceCheckUtils]: 94: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,870 INFO L290 TraceCheckUtils]: 95: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,870 INFO L290 TraceCheckUtils]: 96: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,870 INFO L290 TraceCheckUtils]: 97: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,870 INFO L290 TraceCheckUtils]: 98: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,870 INFO L290 TraceCheckUtils]: 99: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,870 INFO L290 TraceCheckUtils]: 100: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,870 INFO L290 TraceCheckUtils]: 101: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,870 INFO L290 TraceCheckUtils]: 102: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,870 INFO L290 TraceCheckUtils]: 103: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,871 INFO L290 TraceCheckUtils]: 104: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,871 INFO L290 TraceCheckUtils]: 105: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,871 INFO L290 TraceCheckUtils]: 106: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,871 INFO L290 TraceCheckUtils]: 107: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,871 INFO L290 TraceCheckUtils]: 108: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,871 INFO L290 TraceCheckUtils]: 109: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,871 INFO L290 TraceCheckUtils]: 110: Hoare triple {4930#true} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {4930#true} is VALID [2022-02-20 14:21:08,871 INFO L290 TraceCheckUtils]: 111: Hoare triple {4930#true} assume !(main_~j~0#1 < main_~n~0#1); {4930#true} is VALID [2022-02-20 14:21:08,871 INFO L290 TraceCheckUtils]: 112: Hoare triple {4930#true} main_~i~0#1 := 1 + main_~i~0#1; {4930#true} is VALID [2022-02-20 14:21:08,871 INFO L290 TraceCheckUtils]: 113: Hoare triple {4930#true} assume !(main_~i~0#1 < main_~m~0#1); {4930#true} is VALID [2022-02-20 14:21:08,872 INFO L290 TraceCheckUtils]: 114: Hoare triple {4930#true} main_~i~0#1 := 0;main_~j~0#1 := 0; {4930#true} is VALID [2022-02-20 14:21:08,872 INFO L290 TraceCheckUtils]: 115: Hoare triple {4930#true} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {5280#(<= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-20 14:21:08,873 INFO L290 TraceCheckUtils]: 116: Hoare triple {5280#(<= |ULTIMATE.start_main_~j~0#1| 0)} assume !(main_~j~0#1 < main_~s~0#1); {5284#(<= |ULTIMATE.start_main_~s~0#1| 0)} is VALID [2022-02-20 14:21:08,873 INFO L290 TraceCheckUtils]: 117: Hoare triple {5284#(<= |ULTIMATE.start_main_~s~0#1| 0)} main_~i~0#1 := 1 + main_~i~0#1; {5284#(<= |ULTIMATE.start_main_~s~0#1| 0)} is VALID [2022-02-20 14:21:08,874 INFO L290 TraceCheckUtils]: 118: Hoare triple {5284#(<= |ULTIMATE.start_main_~s~0#1| 0)} assume !(main_~i~0#1 < main_~q~0#1); {5284#(<= |ULTIMATE.start_main_~s~0#1| 0)} is VALID [2022-02-20 14:21:08,874 INFO L290 TraceCheckUtils]: 119: Hoare triple {5284#(<= |ULTIMATE.start_main_~s~0#1| 0)} main_~i~0#1 := 0;main_~j~0#1 := 0; {5284#(<= |ULTIMATE.start_main_~s~0#1| 0)} is VALID [2022-02-20 14:21:08,874 INFO L290 TraceCheckUtils]: 120: Hoare triple {5284#(<= |ULTIMATE.start_main_~s~0#1| 0)} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {5297#(and (<= |ULTIMATE.start_main_~s~0#1| 0) (<= 0 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 14:21:08,875 INFO L290 TraceCheckUtils]: 121: Hoare triple {5297#(and (<= |ULTIMATE.start_main_~s~0#1| 0) (<= 0 |ULTIMATE.start_main_~j~0#1|))} assume !!(main_~j~0#1 < main_~s~0#1);call main_#t~mem6#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);call main_#t~mem7#1 := read~int(main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem6#1 == main_#t~mem7#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {4931#false} is VALID [2022-02-20 14:21:08,875 INFO L290 TraceCheckUtils]: 122: Hoare triple {4931#false} assume 0 == __VERIFIER_assert_~cond#1; {4931#false} is VALID [2022-02-20 14:21:08,875 INFO L290 TraceCheckUtils]: 123: Hoare triple {4931#false} assume !false; {4931#false} is VALID [2022-02-20 14:21:08,877 INFO L134 CoverageAnalysis]: Checked inductivity of 4207 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4206 trivial. 0 not checked. [2022-02-20 14:21:08,877 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:21:08,877 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:21:08,877 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642168396] [2022-02-20 14:21:08,877 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:21:08,877 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685737281] [2022-02-20 14:21:08,877 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685737281] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:21:08,877 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:21:08,878 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 14:21:08,878 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86630731] [2022-02-20 14:21:08,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:21:08,878 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 124 [2022-02-20 14:21:08,879 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:21:08,879 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:21:08,897 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:08,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 14:21:08,897 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:21:08,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 14:21:08,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:21:08,898 INFO L87 Difference]: Start difference. First operand 123 states and 132 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:21:09,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:21:09,500 INFO L93 Difference]: Finished difference Result 153 states and 171 transitions. [2022-02-20 14:21:09,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 14:21:09,500 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 124 [2022-02-20 14:21:09,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:21:09,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:21:09,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-02-20 14:21:09,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:21:09,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-02-20 14:21:09,503 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 72 transitions. [2022-02-20 14:21:09,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:21:09,574 INFO L225 Difference]: With dead ends: 153 [2022-02-20 14:21:09,574 INFO L226 Difference]: Without dead ends: 130 [2022-02-20 14:21:09,575 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:21:09,575 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 22 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:21:09,576 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 71 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:21:09,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-02-20 14:21:09,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 125. [2022-02-20 14:21:09,930 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:21:09,931 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand has 125 states, 121 states have (on average 1.0743801652892562) internal successors, (130), 121 states have internal predecessors, (130), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:21:09,931 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand has 125 states, 121 states have (on average 1.0743801652892562) internal successors, (130), 121 states have internal predecessors, (130), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:21:09,931 INFO L87 Difference]: Start difference. First operand 130 states. Second operand has 125 states, 121 states have (on average 1.0743801652892562) internal successors, (130), 121 states have internal predecessors, (130), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:21:09,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:21:09,933 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2022-02-20 14:21:09,934 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2022-02-20 14:21:09,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:21:09,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:21:09,934 INFO L74 IsIncluded]: Start isIncluded. First operand has 125 states, 121 states have (on average 1.0743801652892562) internal successors, (130), 121 states have internal predecessors, (130), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 130 states. [2022-02-20 14:21:09,934 INFO L87 Difference]: Start difference. First operand has 125 states, 121 states have (on average 1.0743801652892562) internal successors, (130), 121 states have internal predecessors, (130), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 130 states. [2022-02-20 14:21:09,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:21:09,936 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2022-02-20 14:21:09,936 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2022-02-20 14:21:09,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:21:09,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:21:09,936 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:21:09,936 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:21:09,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 121 states have (on average 1.0743801652892562) internal successors, (130), 121 states have internal predecessors, (130), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:21:09,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 134 transitions. [2022-02-20 14:21:09,939 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 134 transitions. Word has length 124 [2022-02-20 14:21:09,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:21:09,939 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 134 transitions. [2022-02-20 14:21:09,939 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:21:09,939 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 134 transitions. [2022-02-20 14:21:09,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-02-20 14:21:09,940 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:21:09,940 INFO L514 BasicCegarLoop]: trace histogram [88, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:21:09,958 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:10,147 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:10,147 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:21:10,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:21:10,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1395447138, now seen corresponding path program 1 times [2022-02-20 14:21:10,148 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:21:10,148 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465971084] [2022-02-20 14:21:10,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:21:10,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:21:10,251 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:21:10,252 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [29329599] [2022-02-20 14:21:10,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:21:10,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:21:10,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:21:10,253 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:10,261 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:10,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:21:10,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 933 conjuncts, 25 conjunts are in the unsatisfiable core [2022-02-20 14:21:10,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:21:10,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:21:11,399 INFO L290 TraceCheckUtils]: 0: Hoare triple {6077#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(21, 2);call #Ultimate.allocInit(12, 3); {6077#true} is VALID [2022-02-20 14:21:11,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {6077#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_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1, main_~q~0#1, main_~s~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;main_~m~0#1 := 1000;main_~n~0#1 := 1500;main_~q~0#1 := 500;main_~s~0#1 := 700;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~m~0#1);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~m~0#1); {6085#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:11,400 INFO L272 TraceCheckUtils]: 2: Hoare triple {6085#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} call assume_abort_if_not((if main_~q~0#1 < main_~m~0#1 then 1 else 0)); {6077#true} is VALID [2022-02-20 14:21:11,401 INFO L290 TraceCheckUtils]: 3: Hoare triple {6077#true} ~cond := #in~cond; {6077#true} is VALID [2022-02-20 14:21:11,401 INFO L290 TraceCheckUtils]: 4: Hoare triple {6077#true} assume !(0 == ~cond); {6077#true} is VALID [2022-02-20 14:21:11,401 INFO L290 TraceCheckUtils]: 5: Hoare triple {6077#true} assume true; {6077#true} is VALID [2022-02-20 14:21:11,405 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {6077#true} {6085#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} #107#return; {6085#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:11,405 INFO L272 TraceCheckUtils]: 7: Hoare triple {6085#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} call assume_abort_if_not((if main_~s~0#1 < main_~n~0#1 then 1 else 0)); {6077#true} is VALID [2022-02-20 14:21:11,405 INFO L290 TraceCheckUtils]: 8: Hoare triple {6077#true} ~cond := #in~cond; {6077#true} is VALID [2022-02-20 14:21:11,405 INFO L290 TraceCheckUtils]: 9: Hoare triple {6077#true} assume !(0 == ~cond); {6077#true} is VALID [2022-02-20 14:21:11,405 INFO L290 TraceCheckUtils]: 10: Hoare triple {6077#true} assume true; {6077#true} is VALID [2022-02-20 14:21:11,406 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {6077#true} {6085#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} #109#return; {6085#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:11,406 INFO L290 TraceCheckUtils]: 12: Hoare triple {6085#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} main_~i~0#1 := 0;main_~j~0#1 := 0; {6085#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:11,406 INFO L290 TraceCheckUtils]: 13: Hoare triple {6085#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~i~0#1 < main_~m~0#1);main_~j~0#1 := 0; {6122#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:21:11,407 INFO L290 TraceCheckUtils]: 14: Hoare triple {6122#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6126#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (<= 1500 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 14:21:11,408 INFO L290 TraceCheckUtils]: 15: Hoare triple {6126#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (<= 1500 |ULTIMATE.start_main_~n~0#1|))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6130#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 2))} is VALID [2022-02-20 14:21:11,408 INFO L290 TraceCheckUtils]: 16: Hoare triple {6130#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 2))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6134#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 3))} is VALID [2022-02-20 14:21:11,409 INFO L290 TraceCheckUtils]: 17: Hoare triple {6134#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 3))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6138#(and (<= |ULTIMATE.start_main_~j~0#1| 4) (<= 1500 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 14:21:11,410 INFO L290 TraceCheckUtils]: 18: Hoare triple {6138#(and (<= |ULTIMATE.start_main_~j~0#1| 4) (<= 1500 |ULTIMATE.start_main_~n~0#1|))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6142#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 5))} is VALID [2022-02-20 14:21:11,410 INFO L290 TraceCheckUtils]: 19: Hoare triple {6142#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 5))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6146#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 6))} is VALID [2022-02-20 14:21:11,411 INFO L290 TraceCheckUtils]: 20: Hoare triple {6146#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 6))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6150#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 7))} is VALID [2022-02-20 14:21:11,411 INFO L290 TraceCheckUtils]: 21: Hoare triple {6150#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 7))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6154#(and (<= |ULTIMATE.start_main_~j~0#1| 8) (<= 1500 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 14:21:11,412 INFO L290 TraceCheckUtils]: 22: Hoare triple {6154#(and (<= |ULTIMATE.start_main_~j~0#1| 8) (<= 1500 |ULTIMATE.start_main_~n~0#1|))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6158#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 9))} is VALID [2022-02-20 14:21:11,413 INFO L290 TraceCheckUtils]: 23: Hoare triple {6158#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 9))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6162#(and (<= |ULTIMATE.start_main_~j~0#1| 10) (<= 1500 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 14:21:11,414 INFO L290 TraceCheckUtils]: 24: Hoare triple {6162#(and (<= |ULTIMATE.start_main_~j~0#1| 10) (<= 1500 |ULTIMATE.start_main_~n~0#1|))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6166#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 11))} is VALID [2022-02-20 14:21:11,414 INFO L290 TraceCheckUtils]: 25: Hoare triple {6166#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 11))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6170#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 12))} is VALID [2022-02-20 14:21:11,415 INFO L290 TraceCheckUtils]: 26: Hoare triple {6170#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 12))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6174#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 13))} is VALID [2022-02-20 14:21:11,415 INFO L290 TraceCheckUtils]: 27: Hoare triple {6174#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 13))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6178#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 14))} is VALID [2022-02-20 14:21:11,416 INFO L290 TraceCheckUtils]: 28: Hoare triple {6178#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 14))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6182#(and (<= |ULTIMATE.start_main_~j~0#1| 15) (<= 1500 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 14:21:11,417 INFO L290 TraceCheckUtils]: 29: Hoare triple {6182#(and (<= |ULTIMATE.start_main_~j~0#1| 15) (<= 1500 |ULTIMATE.start_main_~n~0#1|))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6186#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 16))} is VALID [2022-02-20 14:21:11,417 INFO L290 TraceCheckUtils]: 30: Hoare triple {6186#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 16))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6190#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 17))} is VALID [2022-02-20 14:21:11,418 INFO L290 TraceCheckUtils]: 31: Hoare triple {6190#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 17))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6194#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 18))} is VALID [2022-02-20 14:21:11,418 INFO L290 TraceCheckUtils]: 32: Hoare triple {6194#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 18))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6198#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 19))} is VALID [2022-02-20 14:21:11,419 INFO L290 TraceCheckUtils]: 33: Hoare triple {6198#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 19))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6202#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 20))} is VALID [2022-02-20 14:21:11,420 INFO L290 TraceCheckUtils]: 34: Hoare triple {6202#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 20))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6206#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 21))} is VALID [2022-02-20 14:21:11,420 INFO L290 TraceCheckUtils]: 35: Hoare triple {6206#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 21))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6210#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 22))} is VALID [2022-02-20 14:21:11,421 INFO L290 TraceCheckUtils]: 36: Hoare triple {6210#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 22))} assume !(main_~j~0#1 < main_~n~0#1); {6078#false} is VALID [2022-02-20 14:21:11,421 INFO L290 TraceCheckUtils]: 37: Hoare triple {6078#false} main_~i~0#1 := 1 + main_~i~0#1; {6078#false} is VALID [2022-02-20 14:21:11,421 INFO L290 TraceCheckUtils]: 38: Hoare triple {6078#false} assume !!(main_~i~0#1 < main_~m~0#1);main_~j~0#1 := 0; {6078#false} is VALID [2022-02-20 14:21:11,421 INFO L290 TraceCheckUtils]: 39: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,421 INFO L290 TraceCheckUtils]: 40: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,421 INFO L290 TraceCheckUtils]: 41: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,421 INFO L290 TraceCheckUtils]: 42: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,421 INFO L290 TraceCheckUtils]: 43: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,421 INFO L290 TraceCheckUtils]: 44: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,422 INFO L290 TraceCheckUtils]: 45: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,422 INFO L290 TraceCheckUtils]: 46: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,422 INFO L290 TraceCheckUtils]: 47: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,422 INFO L290 TraceCheckUtils]: 48: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,422 INFO L290 TraceCheckUtils]: 49: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,422 INFO L290 TraceCheckUtils]: 50: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,423 INFO L290 TraceCheckUtils]: 51: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,423 INFO L290 TraceCheckUtils]: 52: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,423 INFO L290 TraceCheckUtils]: 53: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,423 INFO L290 TraceCheckUtils]: 54: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,423 INFO L290 TraceCheckUtils]: 55: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,424 INFO L290 TraceCheckUtils]: 56: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,424 INFO L290 TraceCheckUtils]: 57: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,424 INFO L290 TraceCheckUtils]: 58: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,424 INFO L290 TraceCheckUtils]: 59: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,424 INFO L290 TraceCheckUtils]: 60: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,424 INFO L290 TraceCheckUtils]: 61: Hoare triple {6078#false} assume !(main_~j~0#1 < main_~n~0#1); {6078#false} is VALID [2022-02-20 14:21:11,424 INFO L290 TraceCheckUtils]: 62: Hoare triple {6078#false} main_~i~0#1 := 1 + main_~i~0#1; {6078#false} is VALID [2022-02-20 14:21:11,424 INFO L290 TraceCheckUtils]: 63: Hoare triple {6078#false} assume !!(main_~i~0#1 < main_~m~0#1);main_~j~0#1 := 0; {6078#false} is VALID [2022-02-20 14:21:11,425 INFO L290 TraceCheckUtils]: 64: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,425 INFO L290 TraceCheckUtils]: 65: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,425 INFO L290 TraceCheckUtils]: 66: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,425 INFO L290 TraceCheckUtils]: 67: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,425 INFO L290 TraceCheckUtils]: 68: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,425 INFO L290 TraceCheckUtils]: 69: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,425 INFO L290 TraceCheckUtils]: 70: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,426 INFO L290 TraceCheckUtils]: 71: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,426 INFO L290 TraceCheckUtils]: 72: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,426 INFO L290 TraceCheckUtils]: 73: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,426 INFO L290 TraceCheckUtils]: 74: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,426 INFO L290 TraceCheckUtils]: 75: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,426 INFO L290 TraceCheckUtils]: 76: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,426 INFO L290 TraceCheckUtils]: 77: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,427 INFO L290 TraceCheckUtils]: 78: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,427 INFO L290 TraceCheckUtils]: 79: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,427 INFO L290 TraceCheckUtils]: 80: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,427 INFO L290 TraceCheckUtils]: 81: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,427 INFO L290 TraceCheckUtils]: 82: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,427 INFO L290 TraceCheckUtils]: 83: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,427 INFO L290 TraceCheckUtils]: 84: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,427 INFO L290 TraceCheckUtils]: 85: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,428 INFO L290 TraceCheckUtils]: 86: Hoare triple {6078#false} assume !(main_~j~0#1 < main_~n~0#1); {6078#false} is VALID [2022-02-20 14:21:11,428 INFO L290 TraceCheckUtils]: 87: Hoare triple {6078#false} main_~i~0#1 := 1 + main_~i~0#1; {6078#false} is VALID [2022-02-20 14:21:11,428 INFO L290 TraceCheckUtils]: 88: Hoare triple {6078#false} assume !!(main_~i~0#1 < main_~m~0#1);main_~j~0#1 := 0; {6078#false} is VALID [2022-02-20 14:21:11,428 INFO L290 TraceCheckUtils]: 89: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,428 INFO L290 TraceCheckUtils]: 90: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,428 INFO L290 TraceCheckUtils]: 91: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,428 INFO L290 TraceCheckUtils]: 92: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,428 INFO L290 TraceCheckUtils]: 93: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,428 INFO L290 TraceCheckUtils]: 94: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,428 INFO L290 TraceCheckUtils]: 95: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,428 INFO L290 TraceCheckUtils]: 96: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,428 INFO L290 TraceCheckUtils]: 97: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,428 INFO L290 TraceCheckUtils]: 98: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,428 INFO L290 TraceCheckUtils]: 99: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,428 INFO L290 TraceCheckUtils]: 100: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,428 INFO L290 TraceCheckUtils]: 101: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,428 INFO L290 TraceCheckUtils]: 102: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,429 INFO L290 TraceCheckUtils]: 103: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,429 INFO L290 TraceCheckUtils]: 104: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,429 INFO L290 TraceCheckUtils]: 105: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,429 INFO L290 TraceCheckUtils]: 106: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,429 INFO L290 TraceCheckUtils]: 107: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,429 INFO L290 TraceCheckUtils]: 108: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,429 INFO L290 TraceCheckUtils]: 109: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,429 INFO L290 TraceCheckUtils]: 110: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,429 INFO L290 TraceCheckUtils]: 111: Hoare triple {6078#false} assume !(main_~j~0#1 < main_~n~0#1); {6078#false} is VALID [2022-02-20 14:21:11,429 INFO L290 TraceCheckUtils]: 112: Hoare triple {6078#false} main_~i~0#1 := 1 + main_~i~0#1; {6078#false} is VALID [2022-02-20 14:21:11,429 INFO L290 TraceCheckUtils]: 113: Hoare triple {6078#false} assume !(main_~i~0#1 < main_~m~0#1); {6078#false} is VALID [2022-02-20 14:21:11,429 INFO L290 TraceCheckUtils]: 114: Hoare triple {6078#false} main_~i~0#1 := 0;main_~j~0#1 := 0; {6078#false} is VALID [2022-02-20 14:21:11,429 INFO L290 TraceCheckUtils]: 115: Hoare triple {6078#false} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {6078#false} is VALID [2022-02-20 14:21:11,429 INFO L290 TraceCheckUtils]: 116: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~s~0#1);call main_#t~mem5#1 := read~int(main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);call write~int(main_#t~mem5#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~mem5#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:11,429 INFO L290 TraceCheckUtils]: 117: Hoare triple {6078#false} assume !(main_~j~0#1 < main_~s~0#1); {6078#false} is VALID [2022-02-20 14:21:11,429 INFO L290 TraceCheckUtils]: 118: Hoare triple {6078#false} main_~i~0#1 := 1 + main_~i~0#1; {6078#false} is VALID [2022-02-20 14:21:11,430 INFO L290 TraceCheckUtils]: 119: Hoare triple {6078#false} assume !(main_~i~0#1 < main_~q~0#1); {6078#false} is VALID [2022-02-20 14:21:11,430 INFO L290 TraceCheckUtils]: 120: Hoare triple {6078#false} main_~i~0#1 := 0;main_~j~0#1 := 0; {6078#false} is VALID [2022-02-20 14:21:11,430 INFO L290 TraceCheckUtils]: 121: Hoare triple {6078#false} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {6078#false} is VALID [2022-02-20 14:21:11,430 INFO L290 TraceCheckUtils]: 122: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~s~0#1);call main_#t~mem6#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);call main_#t~mem7#1 := read~int(main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem6#1 == main_#t~mem7#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {6078#false} is VALID [2022-02-20 14:21:11,430 INFO L290 TraceCheckUtils]: 123: Hoare triple {6078#false} assume 0 == __VERIFIER_assert_~cond#1; {6078#false} is VALID [2022-02-20 14:21:11,430 INFO L290 TraceCheckUtils]: 124: Hoare triple {6078#false} assume !false; {6078#false} is VALID [2022-02-20 14:21:11,431 INFO L134 CoverageAnalysis]: Checked inductivity of 4208 backedges. 1591 proven. 253 refuted. 0 times theorem prover too weak. 2364 trivial. 0 not checked. [2022-02-20 14:21:11,431 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:21:12,511 INFO L290 TraceCheckUtils]: 124: Hoare triple {6078#false} assume !false; {6078#false} is VALID [2022-02-20 14:21:12,511 INFO L290 TraceCheckUtils]: 123: Hoare triple {6078#false} assume 0 == __VERIFIER_assert_~cond#1; {6078#false} is VALID [2022-02-20 14:21:12,512 INFO L290 TraceCheckUtils]: 122: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~s~0#1);call main_#t~mem6#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);call main_#t~mem7#1 := read~int(main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem6#1 == main_#t~mem7#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {6078#false} is VALID [2022-02-20 14:21:12,512 INFO L290 TraceCheckUtils]: 121: Hoare triple {6078#false} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {6078#false} is VALID [2022-02-20 14:21:12,512 INFO L290 TraceCheckUtils]: 120: Hoare triple {6078#false} main_~i~0#1 := 0;main_~j~0#1 := 0; {6078#false} is VALID [2022-02-20 14:21:12,512 INFO L290 TraceCheckUtils]: 119: Hoare triple {6078#false} assume !(main_~i~0#1 < main_~q~0#1); {6078#false} is VALID [2022-02-20 14:21:12,512 INFO L290 TraceCheckUtils]: 118: Hoare triple {6078#false} main_~i~0#1 := 1 + main_~i~0#1; {6078#false} is VALID [2022-02-20 14:21:12,512 INFO L290 TraceCheckUtils]: 117: Hoare triple {6078#false} assume !(main_~j~0#1 < main_~s~0#1); {6078#false} is VALID [2022-02-20 14:21:12,512 INFO L290 TraceCheckUtils]: 116: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~s~0#1);call main_#t~mem5#1 := read~int(main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);call write~int(main_#t~mem5#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~mem5#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,512 INFO L290 TraceCheckUtils]: 115: Hoare triple {6078#false} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {6078#false} is VALID [2022-02-20 14:21:12,512 INFO L290 TraceCheckUtils]: 114: Hoare triple {6078#false} main_~i~0#1 := 0;main_~j~0#1 := 0; {6078#false} is VALID [2022-02-20 14:21:12,512 INFO L290 TraceCheckUtils]: 113: Hoare triple {6078#false} assume !(main_~i~0#1 < main_~m~0#1); {6078#false} is VALID [2022-02-20 14:21:12,512 INFO L290 TraceCheckUtils]: 112: Hoare triple {6078#false} main_~i~0#1 := 1 + main_~i~0#1; {6078#false} is VALID [2022-02-20 14:21:12,512 INFO L290 TraceCheckUtils]: 111: Hoare triple {6078#false} assume !(main_~j~0#1 < main_~n~0#1); {6078#false} is VALID [2022-02-20 14:21:12,512 INFO L290 TraceCheckUtils]: 110: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,512 INFO L290 TraceCheckUtils]: 109: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,512 INFO L290 TraceCheckUtils]: 108: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,512 INFO L290 TraceCheckUtils]: 107: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,512 INFO L290 TraceCheckUtils]: 106: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,513 INFO L290 TraceCheckUtils]: 105: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,513 INFO L290 TraceCheckUtils]: 104: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,513 INFO L290 TraceCheckUtils]: 103: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,513 INFO L290 TraceCheckUtils]: 102: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,513 INFO L290 TraceCheckUtils]: 101: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,513 INFO L290 TraceCheckUtils]: 100: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,513 INFO L290 TraceCheckUtils]: 99: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,514 INFO L290 TraceCheckUtils]: 98: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,514 INFO L290 TraceCheckUtils]: 97: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,514 INFO L290 TraceCheckUtils]: 96: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,514 INFO L290 TraceCheckUtils]: 95: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,514 INFO L290 TraceCheckUtils]: 94: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,514 INFO L290 TraceCheckUtils]: 93: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,514 INFO L290 TraceCheckUtils]: 92: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,514 INFO L290 TraceCheckUtils]: 91: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,514 INFO L290 TraceCheckUtils]: 90: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,514 INFO L290 TraceCheckUtils]: 89: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,514 INFO L290 TraceCheckUtils]: 88: Hoare triple {6078#false} assume !!(main_~i~0#1 < main_~m~0#1);main_~j~0#1 := 0; {6078#false} is VALID [2022-02-20 14:21:12,515 INFO L290 TraceCheckUtils]: 87: Hoare triple {6078#false} main_~i~0#1 := 1 + main_~i~0#1; {6078#false} is VALID [2022-02-20 14:21:12,515 INFO L290 TraceCheckUtils]: 86: Hoare triple {6078#false} assume !(main_~j~0#1 < main_~n~0#1); {6078#false} is VALID [2022-02-20 14:21:12,515 INFO L290 TraceCheckUtils]: 85: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,515 INFO L290 TraceCheckUtils]: 84: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,515 INFO L290 TraceCheckUtils]: 83: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,515 INFO L290 TraceCheckUtils]: 82: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,515 INFO L290 TraceCheckUtils]: 81: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,515 INFO L290 TraceCheckUtils]: 80: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,515 INFO L290 TraceCheckUtils]: 79: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,515 INFO L290 TraceCheckUtils]: 78: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,515 INFO L290 TraceCheckUtils]: 77: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,515 INFO L290 TraceCheckUtils]: 76: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,515 INFO L290 TraceCheckUtils]: 75: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,515 INFO L290 TraceCheckUtils]: 74: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,515 INFO L290 TraceCheckUtils]: 73: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,515 INFO L290 TraceCheckUtils]: 72: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,515 INFO L290 TraceCheckUtils]: 71: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,516 INFO L290 TraceCheckUtils]: 70: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,516 INFO L290 TraceCheckUtils]: 69: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,516 INFO L290 TraceCheckUtils]: 68: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,516 INFO L290 TraceCheckUtils]: 67: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,516 INFO L290 TraceCheckUtils]: 66: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,516 INFO L290 TraceCheckUtils]: 65: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,516 INFO L290 TraceCheckUtils]: 64: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,516 INFO L290 TraceCheckUtils]: 63: Hoare triple {6078#false} assume !!(main_~i~0#1 < main_~m~0#1);main_~j~0#1 := 0; {6078#false} is VALID [2022-02-20 14:21:12,516 INFO L290 TraceCheckUtils]: 62: Hoare triple {6078#false} main_~i~0#1 := 1 + main_~i~0#1; {6078#false} is VALID [2022-02-20 14:21:12,516 INFO L290 TraceCheckUtils]: 61: Hoare triple {6078#false} assume !(main_~j~0#1 < main_~n~0#1); {6078#false} is VALID [2022-02-20 14:21:12,516 INFO L290 TraceCheckUtils]: 60: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,516 INFO L290 TraceCheckUtils]: 59: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,516 INFO L290 TraceCheckUtils]: 58: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,516 INFO L290 TraceCheckUtils]: 57: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,516 INFO L290 TraceCheckUtils]: 56: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,516 INFO L290 TraceCheckUtils]: 55: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,516 INFO L290 TraceCheckUtils]: 54: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,516 INFO L290 TraceCheckUtils]: 53: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,517 INFO L290 TraceCheckUtils]: 52: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,517 INFO L290 TraceCheckUtils]: 51: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,517 INFO L290 TraceCheckUtils]: 50: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,517 INFO L290 TraceCheckUtils]: 49: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,517 INFO L290 TraceCheckUtils]: 48: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,517 INFO L290 TraceCheckUtils]: 47: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,517 INFO L290 TraceCheckUtils]: 46: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,517 INFO L290 TraceCheckUtils]: 45: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,517 INFO L290 TraceCheckUtils]: 44: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,517 INFO L290 TraceCheckUtils]: 43: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,517 INFO L290 TraceCheckUtils]: 42: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,517 INFO L290 TraceCheckUtils]: 41: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,517 INFO L290 TraceCheckUtils]: 40: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,517 INFO L290 TraceCheckUtils]: 39: Hoare triple {6078#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6078#false} is VALID [2022-02-20 14:21:12,517 INFO L290 TraceCheckUtils]: 38: Hoare triple {6078#false} assume !!(main_~i~0#1 < main_~m~0#1);main_~j~0#1 := 0; {6078#false} is VALID [2022-02-20 14:21:12,517 INFO L290 TraceCheckUtils]: 37: Hoare triple {6078#false} main_~i~0#1 := 1 + main_~i~0#1; {6078#false} is VALID [2022-02-20 14:21:12,518 INFO L290 TraceCheckUtils]: 36: Hoare triple {6742#(< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|)} assume !(main_~j~0#1 < main_~n~0#1); {6078#false} is VALID [2022-02-20 14:21:12,518 INFO L290 TraceCheckUtils]: 35: Hoare triple {6746#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6742#(< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:12,519 INFO L290 TraceCheckUtils]: 34: Hoare triple {6750#(< (+ 2 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6746#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:12,520 INFO L290 TraceCheckUtils]: 33: Hoare triple {6754#(< (+ 3 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6750#(< (+ 2 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:12,520 INFO L290 TraceCheckUtils]: 32: Hoare triple {6758#(< (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6754#(< (+ 3 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:12,521 INFO L290 TraceCheckUtils]: 31: Hoare triple {6762#(< (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6758#(< (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:12,522 INFO L290 TraceCheckUtils]: 30: Hoare triple {6766#(< (+ 6 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6762#(< (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:12,522 INFO L290 TraceCheckUtils]: 29: Hoare triple {6770#(< (+ 7 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6766#(< (+ 6 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:12,523 INFO L290 TraceCheckUtils]: 28: Hoare triple {6774#(< (+ |ULTIMATE.start_main_~j~0#1| 8) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6770#(< (+ 7 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:12,523 INFO L290 TraceCheckUtils]: 27: Hoare triple {6778#(< (+ 9 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6774#(< (+ |ULTIMATE.start_main_~j~0#1| 8) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:12,524 INFO L290 TraceCheckUtils]: 26: Hoare triple {6782#(< (+ |ULTIMATE.start_main_~j~0#1| 10) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6778#(< (+ 9 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:12,524 INFO L290 TraceCheckUtils]: 25: Hoare triple {6786#(< (+ |ULTIMATE.start_main_~j~0#1| 11) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6782#(< (+ |ULTIMATE.start_main_~j~0#1| 10) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:12,525 INFO L290 TraceCheckUtils]: 24: Hoare triple {6790#(< (+ |ULTIMATE.start_main_~j~0#1| 12) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6786#(< (+ |ULTIMATE.start_main_~j~0#1| 11) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:12,526 INFO L290 TraceCheckUtils]: 23: Hoare triple {6794#(< (+ |ULTIMATE.start_main_~j~0#1| 13) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6790#(< (+ |ULTIMATE.start_main_~j~0#1| 12) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:12,526 INFO L290 TraceCheckUtils]: 22: Hoare triple {6798#(< (+ 14 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6794#(< (+ |ULTIMATE.start_main_~j~0#1| 13) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:12,527 INFO L290 TraceCheckUtils]: 21: Hoare triple {6802#(< (+ |ULTIMATE.start_main_~j~0#1| 15) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6798#(< (+ 14 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:12,528 INFO L290 TraceCheckUtils]: 20: Hoare triple {6806#(< (+ 16 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6802#(< (+ |ULTIMATE.start_main_~j~0#1| 15) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:12,528 INFO L290 TraceCheckUtils]: 19: Hoare triple {6810#(< (+ |ULTIMATE.start_main_~j~0#1| 17) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6806#(< (+ 16 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:12,529 INFO L290 TraceCheckUtils]: 18: Hoare triple {6814#(< (+ |ULTIMATE.start_main_~j~0#1| 18) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6810#(< (+ |ULTIMATE.start_main_~j~0#1| 17) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:12,529 INFO L290 TraceCheckUtils]: 17: Hoare triple {6818#(< (+ 19 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6814#(< (+ |ULTIMATE.start_main_~j~0#1| 18) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:12,530 INFO L290 TraceCheckUtils]: 16: Hoare triple {6822#(< (+ |ULTIMATE.start_main_~j~0#1| 20) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6818#(< (+ 19 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:12,531 INFO L290 TraceCheckUtils]: 15: Hoare triple {6826#(< (+ 21 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6822#(< (+ |ULTIMATE.start_main_~j~0#1| 20) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:12,531 INFO L290 TraceCheckUtils]: 14: Hoare triple {6830#(< (+ 22 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {6826#(< (+ 21 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:12,532 INFO L290 TraceCheckUtils]: 13: Hoare triple {6834#(< 22 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~i~0#1 < main_~m~0#1);main_~j~0#1 := 0; {6830#(< (+ 22 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:12,532 INFO L290 TraceCheckUtils]: 12: Hoare triple {6834#(< 22 |ULTIMATE.start_main_~n~0#1|)} main_~i~0#1 := 0;main_~j~0#1 := 0; {6834#(< 22 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:12,533 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {6077#true} {6834#(< 22 |ULTIMATE.start_main_~n~0#1|)} #109#return; {6834#(< 22 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:12,533 INFO L290 TraceCheckUtils]: 10: Hoare triple {6077#true} assume true; {6077#true} is VALID [2022-02-20 14:21:12,533 INFO L290 TraceCheckUtils]: 9: Hoare triple {6077#true} assume !(0 == ~cond); {6077#true} is VALID [2022-02-20 14:21:12,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {6077#true} ~cond := #in~cond; {6077#true} is VALID [2022-02-20 14:21:12,533 INFO L272 TraceCheckUtils]: 7: Hoare triple {6834#(< 22 |ULTIMATE.start_main_~n~0#1|)} call assume_abort_if_not((if main_~s~0#1 < main_~n~0#1 then 1 else 0)); {6077#true} is VALID [2022-02-20 14:21:12,533 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {6077#true} {6834#(< 22 |ULTIMATE.start_main_~n~0#1|)} #107#return; {6834#(< 22 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:12,533 INFO L290 TraceCheckUtils]: 5: Hoare triple {6077#true} assume true; {6077#true} is VALID [2022-02-20 14:21:12,533 INFO L290 TraceCheckUtils]: 4: Hoare triple {6077#true} assume !(0 == ~cond); {6077#true} is VALID [2022-02-20 14:21:12,533 INFO L290 TraceCheckUtils]: 3: Hoare triple {6077#true} ~cond := #in~cond; {6077#true} is VALID [2022-02-20 14:21:12,534 INFO L272 TraceCheckUtils]: 2: Hoare triple {6834#(< 22 |ULTIMATE.start_main_~n~0#1|)} call assume_abort_if_not((if main_~q~0#1 < main_~m~0#1 then 1 else 0)); {6077#true} is VALID [2022-02-20 14:21:12,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {6077#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_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1, main_~q~0#1, main_~s~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;main_~m~0#1 := 1000;main_~n~0#1 := 1500;main_~q~0#1 := 500;main_~s~0#1 := 700;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~m~0#1);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~m~0#1); {6834#(< 22 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:12,534 INFO L290 TraceCheckUtils]: 0: Hoare triple {6077#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(21, 2);call #Ultimate.allocInit(12, 3); {6077#true} is VALID [2022-02-20 14:21:12,535 INFO L134 CoverageAnalysis]: Checked inductivity of 4208 backedges. 1591 proven. 253 refuted. 0 times theorem prover too weak. 2364 trivial. 0 not checked. [2022-02-20 14:21:12,535 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:21:12,535 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465971084] [2022-02-20 14:21:12,536 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:21:12,536 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29329599] [2022-02-20 14:21:12,536 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [29329599] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:21:12,536 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:21:12,536 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-02-20 14:21:12,536 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911378640] [2022-02-20 14:21:12,536 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:21:12,537 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.44) internal successors, (72), 50 states have internal predecessors, (72), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 125 [2022-02-20 14:21:12,537 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:21:12,537 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 50 states, 50 states have (on average 1.44) internal successors, (72), 50 states have internal predecessors, (72), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 14:21:12,588 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:21:12,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-02-20 14:21:12,588 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:21:12,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-02-20 14:21:12,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1179, Invalid=1271, Unknown=0, NotChecked=0, Total=2450 [2022-02-20 14:21:12,590 INFO L87 Difference]: Start difference. First operand 125 states and 134 transitions. Second operand has 50 states, 50 states have (on average 1.44) internal successors, (72), 50 states have internal predecessors, (72), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 14:21:20,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:21:20,343 INFO L93 Difference]: Finished difference Result 813 states and 1060 transitions. [2022-02-20 14:21:20,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-02-20 14:21:20,344 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.44) internal successors, (72), 50 states have internal predecessors, (72), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 125 [2022-02-20 14:21:20,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:21:20,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.44) internal successors, (72), 50 states have internal predecessors, (72), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 14:21:20,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 759 transitions. [2022-02-20 14:21:20,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.44) internal successors, (72), 50 states have internal predecessors, (72), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 14:21:20,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 759 transitions. [2022-02-20 14:21:20,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states and 759 transitions. [2022-02-20 14:21:21,074 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 759 edges. 759 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:21:21,100 INFO L225 Difference]: With dead ends: 813 [2022-02-20 14:21:21,100 INFO L226 Difference]: Without dead ends: 721 [2022-02-20 14:21:21,102 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 200 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,103 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 1643 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 1191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1643 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 1498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1191 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 14:21:21,103 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1643 Valid, 353 Invalid, 1498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1191 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-20 14:21:21,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2022-02-20 14:21:21,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 221. [2022-02-20 14:21:21,763 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:21:21,763 INFO L82 GeneralOperation]: Start isEquivalent. First operand 721 states. Second operand has 221 states, 217 states have (on average 1.0414746543778801) internal successors, (226), 217 states have internal predecessors, (226), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:21:21,764 INFO L74 IsIncluded]: Start isIncluded. First operand 721 states. Second operand has 221 states, 217 states have (on average 1.0414746543778801) internal successors, (226), 217 states have internal predecessors, (226), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:21:21,764 INFO L87 Difference]: Start difference. First operand 721 states. Second operand has 221 states, 217 states have (on average 1.0414746543778801) internal successors, (226), 217 states have internal predecessors, (226), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:21:21,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:21:21,788 INFO L93 Difference]: Finished difference Result 721 states and 865 transitions. [2022-02-20 14:21:21,788 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 865 transitions. [2022-02-20 14:21:21,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:21:21,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:21:21,790 INFO L74 IsIncluded]: Start isIncluded. First operand has 221 states, 217 states have (on average 1.0414746543778801) internal successors, (226), 217 states have internal predecessors, (226), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 721 states. [2022-02-20 14:21:21,790 INFO L87 Difference]: Start difference. First operand has 221 states, 217 states have (on average 1.0414746543778801) internal successors, (226), 217 states have internal predecessors, (226), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 721 states. [2022-02-20 14:21:21,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:21:21,812 INFO L93 Difference]: Finished difference Result 721 states and 865 transitions. [2022-02-20 14:21:21,812 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 865 transitions. [2022-02-20 14:21:21,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:21:21,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:21:21,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:21:21,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:21:21,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 217 states have (on average 1.0414746543778801) internal successors, (226), 217 states have internal predecessors, (226), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:21:21,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 230 transitions. [2022-02-20 14:21:21,819 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 230 transitions. Word has length 125 [2022-02-20 14:21:21,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:21:21,819 INFO L470 AbstractCegarLoop]: Abstraction has 221 states and 230 transitions. [2022-02-20 14:21:21,819 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.44) internal successors, (72), 50 states have internal predecessors, (72), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 14:21:21,819 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 230 transitions. [2022-02-20 14:21:21,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-02-20 14:21:21,822 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:21:21,822 INFO L514 BasicCegarLoop]: trace histogram [184, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:21:21,847 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,043 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,044 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:21:22,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:21:22,044 INFO L85 PathProgramCache]: Analyzing trace with hash -387556706, now seen corresponding path program 2 times [2022-02-20 14:21:22,044 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:21:22,044 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207822263] [2022-02-20 14:21:22,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:21:22,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:21:22,214 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:21:22,214 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [96519845] [2022-02-20 14:21:22,214 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:21:22,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:21:22,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:21:22,216 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,229 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,819 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:21:22,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:21:22,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 1797 conjuncts, 49 conjunts are in the unsatisfiable core [2022-02-20 14:21:22,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:21:22,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:21:24,902 INFO L290 TraceCheckUtils]: 0: Hoare triple {10111#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(21, 2);call #Ultimate.allocInit(12, 3); {10111#true} is VALID [2022-02-20 14:21:24,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {10111#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_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1, main_~q~0#1, main_~s~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;main_~m~0#1 := 1000;main_~n~0#1 := 1500;main_~q~0#1 := 500;main_~s~0#1 := 700;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~m~0#1);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~m~0#1); {10119#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:24,903 INFO L272 TraceCheckUtils]: 2: Hoare triple {10119#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} call assume_abort_if_not((if main_~q~0#1 < main_~m~0#1 then 1 else 0)); {10111#true} is VALID [2022-02-20 14:21:24,903 INFO L290 TraceCheckUtils]: 3: Hoare triple {10111#true} ~cond := #in~cond; {10111#true} is VALID [2022-02-20 14:21:24,903 INFO L290 TraceCheckUtils]: 4: Hoare triple {10111#true} assume !(0 == ~cond); {10111#true} is VALID [2022-02-20 14:21:24,903 INFO L290 TraceCheckUtils]: 5: Hoare triple {10111#true} assume true; {10111#true} is VALID [2022-02-20 14:21:24,904 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {10111#true} {10119#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} #107#return; {10119#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:24,904 INFO L272 TraceCheckUtils]: 7: Hoare triple {10119#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} call assume_abort_if_not((if main_~s~0#1 < main_~n~0#1 then 1 else 0)); {10111#true} is VALID [2022-02-20 14:21:24,904 INFO L290 TraceCheckUtils]: 8: Hoare triple {10111#true} ~cond := #in~cond; {10111#true} is VALID [2022-02-20 14:21:24,904 INFO L290 TraceCheckUtils]: 9: Hoare triple {10111#true} assume !(0 == ~cond); {10111#true} is VALID [2022-02-20 14:21:24,904 INFO L290 TraceCheckUtils]: 10: Hoare triple {10111#true} assume true; {10111#true} is VALID [2022-02-20 14:21:24,905 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {10111#true} {10119#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} #109#return; {10119#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:24,905 INFO L290 TraceCheckUtils]: 12: Hoare triple {10119#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} main_~i~0#1 := 0;main_~j~0#1 := 0; {10119#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:24,905 INFO L290 TraceCheckUtils]: 13: Hoare triple {10119#(<= 1500 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~i~0#1 < main_~m~0#1);main_~j~0#1 := 0; {10156#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:21:24,906 INFO L290 TraceCheckUtils]: 14: Hoare triple {10156#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10160#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (<= 1500 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 14:21:24,907 INFO L290 TraceCheckUtils]: 15: Hoare triple {10160#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (<= 1500 |ULTIMATE.start_main_~n~0#1|))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10164#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 2))} is VALID [2022-02-20 14:21:24,907 INFO L290 TraceCheckUtils]: 16: Hoare triple {10164#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 2))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10168#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 3))} is VALID [2022-02-20 14:21:24,908 INFO L290 TraceCheckUtils]: 17: Hoare triple {10168#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 3))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10172#(and (<= |ULTIMATE.start_main_~j~0#1| 4) (<= 1500 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 14:21:24,909 INFO L290 TraceCheckUtils]: 18: Hoare triple {10172#(and (<= |ULTIMATE.start_main_~j~0#1| 4) (<= 1500 |ULTIMATE.start_main_~n~0#1|))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10176#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 5))} is VALID [2022-02-20 14:21:24,910 INFO L290 TraceCheckUtils]: 19: Hoare triple {10176#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 5))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10180#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 6))} is VALID [2022-02-20 14:21:24,910 INFO L290 TraceCheckUtils]: 20: Hoare triple {10180#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 6))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10184#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 7))} is VALID [2022-02-20 14:21:24,911 INFO L290 TraceCheckUtils]: 21: Hoare triple {10184#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 7))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10188#(and (<= |ULTIMATE.start_main_~j~0#1| 8) (<= 1500 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 14:21:24,912 INFO L290 TraceCheckUtils]: 22: Hoare triple {10188#(and (<= |ULTIMATE.start_main_~j~0#1| 8) (<= 1500 |ULTIMATE.start_main_~n~0#1|))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10192#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 9))} is VALID [2022-02-20 14:21:24,912 INFO L290 TraceCheckUtils]: 23: Hoare triple {10192#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 9))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10196#(and (<= |ULTIMATE.start_main_~j~0#1| 10) (<= 1500 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 14:21:24,913 INFO L290 TraceCheckUtils]: 24: Hoare triple {10196#(and (<= |ULTIMATE.start_main_~j~0#1| 10) (<= 1500 |ULTIMATE.start_main_~n~0#1|))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10200#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 11))} is VALID [2022-02-20 14:21:24,913 INFO L290 TraceCheckUtils]: 25: Hoare triple {10200#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 11))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10204#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 12))} is VALID [2022-02-20 14:21:24,914 INFO L290 TraceCheckUtils]: 26: Hoare triple {10204#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 12))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10208#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 13))} is VALID [2022-02-20 14:21:24,915 INFO L290 TraceCheckUtils]: 27: Hoare triple {10208#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 13))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10212#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 14))} is VALID [2022-02-20 14:21:24,919 INFO L290 TraceCheckUtils]: 28: Hoare triple {10212#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 14))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10216#(and (<= |ULTIMATE.start_main_~j~0#1| 15) (<= 1500 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 14:21:24,932 INFO L290 TraceCheckUtils]: 29: Hoare triple {10216#(and (<= |ULTIMATE.start_main_~j~0#1| 15) (<= 1500 |ULTIMATE.start_main_~n~0#1|))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10220#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 16))} is VALID [2022-02-20 14:21:24,933 INFO L290 TraceCheckUtils]: 30: Hoare triple {10220#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 16))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10224#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 17))} is VALID [2022-02-20 14:21:24,934 INFO L290 TraceCheckUtils]: 31: Hoare triple {10224#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 17))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10228#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 18))} is VALID [2022-02-20 14:21:24,935 INFO L290 TraceCheckUtils]: 32: Hoare triple {10228#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 18))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10232#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 19))} is VALID [2022-02-20 14:21:24,935 INFO L290 TraceCheckUtils]: 33: Hoare triple {10232#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 19))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10236#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 20))} is VALID [2022-02-20 14:21:24,936 INFO L290 TraceCheckUtils]: 34: Hoare triple {10236#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 20))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10240#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 21))} is VALID [2022-02-20 14:21:24,937 INFO L290 TraceCheckUtils]: 35: Hoare triple {10240#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 21))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10244#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 22))} is VALID [2022-02-20 14:21:24,938 INFO L290 TraceCheckUtils]: 36: Hoare triple {10244#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 22))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10248#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 23))} is VALID [2022-02-20 14:21:24,938 INFO L290 TraceCheckUtils]: 37: Hoare triple {10248#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 23))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10252#(and (<= |ULTIMATE.start_main_~j~0#1| 24) (<= 1500 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 14:21:24,940 INFO L290 TraceCheckUtils]: 38: Hoare triple {10252#(and (<= |ULTIMATE.start_main_~j~0#1| 24) (<= 1500 |ULTIMATE.start_main_~n~0#1|))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10256#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 25))} is VALID [2022-02-20 14:21:24,940 INFO L290 TraceCheckUtils]: 39: Hoare triple {10256#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 25))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10260#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 26))} is VALID [2022-02-20 14:21:24,941 INFO L290 TraceCheckUtils]: 40: Hoare triple {10260#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 26))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10264#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 27))} is VALID [2022-02-20 14:21:24,942 INFO L290 TraceCheckUtils]: 41: Hoare triple {10264#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 27))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10268#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 28))} is VALID [2022-02-20 14:21:24,943 INFO L290 TraceCheckUtils]: 42: Hoare triple {10268#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 28))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10272#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 29))} is VALID [2022-02-20 14:21:24,944 INFO L290 TraceCheckUtils]: 43: Hoare triple {10272#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 29))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10276#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 30))} is VALID [2022-02-20 14:21:24,944 INFO L290 TraceCheckUtils]: 44: Hoare triple {10276#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 30))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10280#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 31))} is VALID [2022-02-20 14:21:24,945 INFO L290 TraceCheckUtils]: 45: Hoare triple {10280#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 31))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10284#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 32))} is VALID [2022-02-20 14:21:24,946 INFO L290 TraceCheckUtils]: 46: Hoare triple {10284#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 32))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10288#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 33))} is VALID [2022-02-20 14:21:24,947 INFO L290 TraceCheckUtils]: 47: Hoare triple {10288#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 33))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10292#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 34))} is VALID [2022-02-20 14:21:24,948 INFO L290 TraceCheckUtils]: 48: Hoare triple {10292#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 34))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10296#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 35))} is VALID [2022-02-20 14:21:24,948 INFO L290 TraceCheckUtils]: 49: Hoare triple {10296#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 35))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10300#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 36))} is VALID [2022-02-20 14:21:24,949 INFO L290 TraceCheckUtils]: 50: Hoare triple {10300#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 36))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10304#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 37))} is VALID [2022-02-20 14:21:24,949 INFO L290 TraceCheckUtils]: 51: Hoare triple {10304#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 37))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10308#(and (<= |ULTIMATE.start_main_~j~0#1| 38) (<= 1500 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 14:21:24,950 INFO L290 TraceCheckUtils]: 52: Hoare triple {10308#(and (<= |ULTIMATE.start_main_~j~0#1| 38) (<= 1500 |ULTIMATE.start_main_~n~0#1|))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10312#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 39))} is VALID [2022-02-20 14:21:24,951 INFO L290 TraceCheckUtils]: 53: Hoare triple {10312#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 39))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10316#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 40))} is VALID [2022-02-20 14:21:24,951 INFO L290 TraceCheckUtils]: 54: Hoare triple {10316#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 40))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10320#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 41))} is VALID [2022-02-20 14:21:24,952 INFO L290 TraceCheckUtils]: 55: Hoare triple {10320#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 41))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10324#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 42))} is VALID [2022-02-20 14:21:24,953 INFO L290 TraceCheckUtils]: 56: Hoare triple {10324#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 42))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10328#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 43))} is VALID [2022-02-20 14:21:24,953 INFO L290 TraceCheckUtils]: 57: Hoare triple {10328#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 43))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10332#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 44))} is VALID [2022-02-20 14:21:24,954 INFO L290 TraceCheckUtils]: 58: Hoare triple {10332#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 44))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10336#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 45))} is VALID [2022-02-20 14:21:24,955 INFO L290 TraceCheckUtils]: 59: Hoare triple {10336#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 45))} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10340#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 46))} is VALID [2022-02-20 14:21:24,956 INFO L290 TraceCheckUtils]: 60: Hoare triple {10340#(and (<= 1500 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 46))} assume !(main_~j~0#1 < main_~n~0#1); {10112#false} is VALID [2022-02-20 14:21:24,956 INFO L290 TraceCheckUtils]: 61: Hoare triple {10112#false} main_~i~0#1 := 1 + main_~i~0#1; {10112#false} is VALID [2022-02-20 14:21:24,956 INFO L290 TraceCheckUtils]: 62: Hoare triple {10112#false} assume !!(main_~i~0#1 < main_~m~0#1);main_~j~0#1 := 0; {10112#false} is VALID [2022-02-20 14:21:24,956 INFO L290 TraceCheckUtils]: 63: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,956 INFO L290 TraceCheckUtils]: 64: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,956 INFO L290 TraceCheckUtils]: 65: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,956 INFO L290 TraceCheckUtils]: 66: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,956 INFO L290 TraceCheckUtils]: 67: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,957 INFO L290 TraceCheckUtils]: 68: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,957 INFO L290 TraceCheckUtils]: 69: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,957 INFO L290 TraceCheckUtils]: 70: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,957 INFO L290 TraceCheckUtils]: 71: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,957 INFO L290 TraceCheckUtils]: 72: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,957 INFO L290 TraceCheckUtils]: 73: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,957 INFO L290 TraceCheckUtils]: 74: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,957 INFO L290 TraceCheckUtils]: 75: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,957 INFO L290 TraceCheckUtils]: 76: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,957 INFO L290 TraceCheckUtils]: 77: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,957 INFO L290 TraceCheckUtils]: 78: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,957 INFO L290 TraceCheckUtils]: 79: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,957 INFO L290 TraceCheckUtils]: 80: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,957 INFO L290 TraceCheckUtils]: 81: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,957 INFO L290 TraceCheckUtils]: 82: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,957 INFO L290 TraceCheckUtils]: 83: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,958 INFO L290 TraceCheckUtils]: 84: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,958 INFO L290 TraceCheckUtils]: 85: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,958 INFO L290 TraceCheckUtils]: 86: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,958 INFO L290 TraceCheckUtils]: 87: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,958 INFO L290 TraceCheckUtils]: 88: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,958 INFO L290 TraceCheckUtils]: 89: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,958 INFO L290 TraceCheckUtils]: 90: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,958 INFO L290 TraceCheckUtils]: 91: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,958 INFO L290 TraceCheckUtils]: 92: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,958 INFO L290 TraceCheckUtils]: 93: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,958 INFO L290 TraceCheckUtils]: 94: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,958 INFO L290 TraceCheckUtils]: 95: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,959 INFO L290 TraceCheckUtils]: 96: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,959 INFO L290 TraceCheckUtils]: 97: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,959 INFO L290 TraceCheckUtils]: 98: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,959 INFO L290 TraceCheckUtils]: 99: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,959 INFO L290 TraceCheckUtils]: 100: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,959 INFO L290 TraceCheckUtils]: 101: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,959 INFO L290 TraceCheckUtils]: 102: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,959 INFO L290 TraceCheckUtils]: 103: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,959 INFO L290 TraceCheckUtils]: 104: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,959 INFO L290 TraceCheckUtils]: 105: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,959 INFO L290 TraceCheckUtils]: 106: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,960 INFO L290 TraceCheckUtils]: 107: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,960 INFO L290 TraceCheckUtils]: 108: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,960 INFO L290 TraceCheckUtils]: 109: Hoare triple {10112#false} assume !(main_~j~0#1 < main_~n~0#1); {10112#false} is VALID [2022-02-20 14:21:24,960 INFO L290 TraceCheckUtils]: 110: Hoare triple {10112#false} main_~i~0#1 := 1 + main_~i~0#1; {10112#false} is VALID [2022-02-20 14:21:24,960 INFO L290 TraceCheckUtils]: 111: Hoare triple {10112#false} assume !!(main_~i~0#1 < main_~m~0#1);main_~j~0#1 := 0; {10112#false} is VALID [2022-02-20 14:21:24,960 INFO L290 TraceCheckUtils]: 112: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,960 INFO L290 TraceCheckUtils]: 113: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,960 INFO L290 TraceCheckUtils]: 114: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,960 INFO L290 TraceCheckUtils]: 115: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,960 INFO L290 TraceCheckUtils]: 116: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,960 INFO L290 TraceCheckUtils]: 117: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,960 INFO L290 TraceCheckUtils]: 118: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,961 INFO L290 TraceCheckUtils]: 119: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,961 INFO L290 TraceCheckUtils]: 120: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,961 INFO L290 TraceCheckUtils]: 121: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,961 INFO L290 TraceCheckUtils]: 122: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,961 INFO L290 TraceCheckUtils]: 123: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,961 INFO L290 TraceCheckUtils]: 124: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,961 INFO L290 TraceCheckUtils]: 125: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,961 INFO L290 TraceCheckUtils]: 126: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,961 INFO L290 TraceCheckUtils]: 127: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,961 INFO L290 TraceCheckUtils]: 128: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,961 INFO L290 TraceCheckUtils]: 129: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,962 INFO L290 TraceCheckUtils]: 130: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,962 INFO L290 TraceCheckUtils]: 131: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,962 INFO L290 TraceCheckUtils]: 132: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,962 INFO L290 TraceCheckUtils]: 133: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,962 INFO L290 TraceCheckUtils]: 134: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,962 INFO L290 TraceCheckUtils]: 135: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,962 INFO L290 TraceCheckUtils]: 136: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,962 INFO L290 TraceCheckUtils]: 137: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,962 INFO L290 TraceCheckUtils]: 138: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,962 INFO L290 TraceCheckUtils]: 139: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,962 INFO L290 TraceCheckUtils]: 140: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,963 INFO L290 TraceCheckUtils]: 141: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,963 INFO L290 TraceCheckUtils]: 142: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,963 INFO L290 TraceCheckUtils]: 143: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,963 INFO L290 TraceCheckUtils]: 144: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,963 INFO L290 TraceCheckUtils]: 145: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,963 INFO L290 TraceCheckUtils]: 146: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,963 INFO L290 TraceCheckUtils]: 147: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,963 INFO L290 TraceCheckUtils]: 148: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,963 INFO L290 TraceCheckUtils]: 149: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,963 INFO L290 TraceCheckUtils]: 150: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,963 INFO L290 TraceCheckUtils]: 151: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,963 INFO L290 TraceCheckUtils]: 152: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,964 INFO L290 TraceCheckUtils]: 153: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,964 INFO L290 TraceCheckUtils]: 154: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,964 INFO L290 TraceCheckUtils]: 155: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,964 INFO L290 TraceCheckUtils]: 156: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,964 INFO L290 TraceCheckUtils]: 157: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,964 INFO L290 TraceCheckUtils]: 158: Hoare triple {10112#false} assume !(main_~j~0#1 < main_~n~0#1); {10112#false} is VALID [2022-02-20 14:21:24,964 INFO L290 TraceCheckUtils]: 159: Hoare triple {10112#false} main_~i~0#1 := 1 + main_~i~0#1; {10112#false} is VALID [2022-02-20 14:21:24,964 INFO L290 TraceCheckUtils]: 160: Hoare triple {10112#false} assume !!(main_~i~0#1 < main_~m~0#1);main_~j~0#1 := 0; {10112#false} is VALID [2022-02-20 14:21:24,964 INFO L290 TraceCheckUtils]: 161: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,964 INFO L290 TraceCheckUtils]: 162: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,964 INFO L290 TraceCheckUtils]: 163: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,965 INFO L290 TraceCheckUtils]: 164: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,965 INFO L290 TraceCheckUtils]: 165: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,965 INFO L290 TraceCheckUtils]: 166: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,965 INFO L290 TraceCheckUtils]: 167: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,965 INFO L290 TraceCheckUtils]: 168: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,965 INFO L290 TraceCheckUtils]: 169: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,965 INFO L290 TraceCheckUtils]: 170: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,965 INFO L290 TraceCheckUtils]: 171: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,965 INFO L290 TraceCheckUtils]: 172: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,965 INFO L290 TraceCheckUtils]: 173: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,965 INFO L290 TraceCheckUtils]: 174: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,966 INFO L290 TraceCheckUtils]: 175: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,966 INFO L290 TraceCheckUtils]: 176: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,966 INFO L290 TraceCheckUtils]: 177: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,966 INFO L290 TraceCheckUtils]: 178: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,966 INFO L290 TraceCheckUtils]: 179: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,966 INFO L290 TraceCheckUtils]: 180: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,966 INFO L290 TraceCheckUtils]: 181: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,966 INFO L290 TraceCheckUtils]: 182: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,966 INFO L290 TraceCheckUtils]: 183: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,966 INFO L290 TraceCheckUtils]: 184: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,966 INFO L290 TraceCheckUtils]: 185: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,966 INFO L290 TraceCheckUtils]: 186: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,967 INFO L290 TraceCheckUtils]: 187: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,967 INFO L290 TraceCheckUtils]: 188: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,967 INFO L290 TraceCheckUtils]: 189: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,967 INFO L290 TraceCheckUtils]: 190: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,967 INFO L290 TraceCheckUtils]: 191: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,967 INFO L290 TraceCheckUtils]: 192: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,967 INFO L290 TraceCheckUtils]: 193: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,967 INFO L290 TraceCheckUtils]: 194: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,967 INFO L290 TraceCheckUtils]: 195: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,967 INFO L290 TraceCheckUtils]: 196: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,967 INFO L290 TraceCheckUtils]: 197: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,968 INFO L290 TraceCheckUtils]: 198: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,968 INFO L290 TraceCheckUtils]: 199: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,968 INFO L290 TraceCheckUtils]: 200: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,968 INFO L290 TraceCheckUtils]: 201: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,968 INFO L290 TraceCheckUtils]: 202: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,968 INFO L290 TraceCheckUtils]: 203: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,968 INFO L290 TraceCheckUtils]: 204: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,968 INFO L290 TraceCheckUtils]: 205: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,968 INFO L290 TraceCheckUtils]: 206: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,968 INFO L290 TraceCheckUtils]: 207: Hoare triple {10112#false} assume !(main_~j~0#1 < main_~n~0#1); {10112#false} is VALID [2022-02-20 14:21:24,968 INFO L290 TraceCheckUtils]: 208: Hoare triple {10112#false} main_~i~0#1 := 1 + main_~i~0#1; {10112#false} is VALID [2022-02-20 14:21:24,968 INFO L290 TraceCheckUtils]: 209: Hoare triple {10112#false} assume !(main_~i~0#1 < main_~m~0#1); {10112#false} is VALID [2022-02-20 14:21:24,969 INFO L290 TraceCheckUtils]: 210: Hoare triple {10112#false} main_~i~0#1 := 0;main_~j~0#1 := 0; {10112#false} is VALID [2022-02-20 14:21:24,969 INFO L290 TraceCheckUtils]: 211: Hoare triple {10112#false} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {10112#false} is VALID [2022-02-20 14:21:24,969 INFO L290 TraceCheckUtils]: 212: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~s~0#1);call main_#t~mem5#1 := read~int(main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);call write~int(main_#t~mem5#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~mem5#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:24,969 INFO L290 TraceCheckUtils]: 213: Hoare triple {10112#false} assume !(main_~j~0#1 < main_~s~0#1); {10112#false} is VALID [2022-02-20 14:21:24,969 INFO L290 TraceCheckUtils]: 214: Hoare triple {10112#false} main_~i~0#1 := 1 + main_~i~0#1; {10112#false} is VALID [2022-02-20 14:21:24,969 INFO L290 TraceCheckUtils]: 215: Hoare triple {10112#false} assume !(main_~i~0#1 < main_~q~0#1); {10112#false} is VALID [2022-02-20 14:21:24,969 INFO L290 TraceCheckUtils]: 216: Hoare triple {10112#false} main_~i~0#1 := 0;main_~j~0#1 := 0; {10112#false} is VALID [2022-02-20 14:21:24,969 INFO L290 TraceCheckUtils]: 217: Hoare triple {10112#false} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {10112#false} is VALID [2022-02-20 14:21:24,969 INFO L290 TraceCheckUtils]: 218: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~s~0#1);call main_#t~mem6#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);call main_#t~mem7#1 := read~int(main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem6#1 == main_#t~mem7#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {10112#false} is VALID [2022-02-20 14:21:24,969 INFO L290 TraceCheckUtils]: 219: Hoare triple {10112#false} assume 0 == __VERIFIER_assert_~cond#1; {10112#false} is VALID [2022-02-20 14:21:24,969 INFO L290 TraceCheckUtils]: 220: Hoare triple {10112#false} assume !false; {10112#false} is VALID [2022-02-20 14:21:24,975 INFO L134 CoverageAnalysis]: Checked inductivity of 17600 backedges. 6631 proven. 1081 refuted. 0 times theorem prover too weak. 9888 trivial. 0 not checked. [2022-02-20 14:21:24,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:21:29,240 INFO L290 TraceCheckUtils]: 220: Hoare triple {10112#false} assume !false; {10112#false} is VALID [2022-02-20 14:21:29,240 INFO L290 TraceCheckUtils]: 219: Hoare triple {10112#false} assume 0 == __VERIFIER_assert_~cond#1; {10112#false} is VALID [2022-02-20 14:21:29,241 INFO L290 TraceCheckUtils]: 218: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~s~0#1);call main_#t~mem6#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);call main_#t~mem7#1 := read~int(main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem6#1 == main_#t~mem7#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {10112#false} is VALID [2022-02-20 14:21:29,241 INFO L290 TraceCheckUtils]: 217: Hoare triple {10112#false} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {10112#false} is VALID [2022-02-20 14:21:29,241 INFO L290 TraceCheckUtils]: 216: Hoare triple {10112#false} main_~i~0#1 := 0;main_~j~0#1 := 0; {10112#false} is VALID [2022-02-20 14:21:29,241 INFO L290 TraceCheckUtils]: 215: Hoare triple {10112#false} assume !(main_~i~0#1 < main_~q~0#1); {10112#false} is VALID [2022-02-20 14:21:29,241 INFO L290 TraceCheckUtils]: 214: Hoare triple {10112#false} main_~i~0#1 := 1 + main_~i~0#1; {10112#false} is VALID [2022-02-20 14:21:29,241 INFO L290 TraceCheckUtils]: 213: Hoare triple {10112#false} assume !(main_~j~0#1 < main_~s~0#1); {10112#false} is VALID [2022-02-20 14:21:29,241 INFO L290 TraceCheckUtils]: 212: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~s~0#1);call main_#t~mem5#1 := read~int(main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);call write~int(main_#t~mem5#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~mem5#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,241 INFO L290 TraceCheckUtils]: 211: Hoare triple {10112#false} assume !!(main_~i~0#1 < main_~q~0#1);main_~j~0#1 := 0; {10112#false} is VALID [2022-02-20 14:21:29,241 INFO L290 TraceCheckUtils]: 210: Hoare triple {10112#false} main_~i~0#1 := 0;main_~j~0#1 := 0; {10112#false} is VALID [2022-02-20 14:21:29,241 INFO L290 TraceCheckUtils]: 209: Hoare triple {10112#false} assume !(main_~i~0#1 < main_~m~0#1); {10112#false} is VALID [2022-02-20 14:21:29,242 INFO L290 TraceCheckUtils]: 208: Hoare triple {10112#false} main_~i~0#1 := 1 + main_~i~0#1; {10112#false} is VALID [2022-02-20 14:21:29,242 INFO L290 TraceCheckUtils]: 207: Hoare triple {10112#false} assume !(main_~j~0#1 < main_~n~0#1); {10112#false} is VALID [2022-02-20 14:21:29,242 INFO L290 TraceCheckUtils]: 206: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,242 INFO L290 TraceCheckUtils]: 205: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,242 INFO L290 TraceCheckUtils]: 204: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,242 INFO L290 TraceCheckUtils]: 203: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,242 INFO L290 TraceCheckUtils]: 202: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,242 INFO L290 TraceCheckUtils]: 201: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,243 INFO L290 TraceCheckUtils]: 200: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,243 INFO L290 TraceCheckUtils]: 199: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,243 INFO L290 TraceCheckUtils]: 198: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,243 INFO L290 TraceCheckUtils]: 197: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,243 INFO L290 TraceCheckUtils]: 196: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,243 INFO L290 TraceCheckUtils]: 195: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,243 INFO L290 TraceCheckUtils]: 194: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,244 INFO L290 TraceCheckUtils]: 193: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,244 INFO L290 TraceCheckUtils]: 192: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,244 INFO L290 TraceCheckUtils]: 191: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,244 INFO L290 TraceCheckUtils]: 190: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,244 INFO L290 TraceCheckUtils]: 189: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,244 INFO L290 TraceCheckUtils]: 188: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,244 INFO L290 TraceCheckUtils]: 187: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,244 INFO L290 TraceCheckUtils]: 186: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,245 INFO L290 TraceCheckUtils]: 185: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,245 INFO L290 TraceCheckUtils]: 184: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,245 INFO L290 TraceCheckUtils]: 183: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,245 INFO L290 TraceCheckUtils]: 182: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,245 INFO L290 TraceCheckUtils]: 181: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,245 INFO L290 TraceCheckUtils]: 180: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,245 INFO L290 TraceCheckUtils]: 179: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,245 INFO L290 TraceCheckUtils]: 178: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,245 INFO L290 TraceCheckUtils]: 177: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,245 INFO L290 TraceCheckUtils]: 176: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,245 INFO L290 TraceCheckUtils]: 175: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,245 INFO L290 TraceCheckUtils]: 174: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,245 INFO L290 TraceCheckUtils]: 173: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,245 INFO L290 TraceCheckUtils]: 172: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,246 INFO L290 TraceCheckUtils]: 171: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,246 INFO L290 TraceCheckUtils]: 170: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,246 INFO L290 TraceCheckUtils]: 169: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,246 INFO L290 TraceCheckUtils]: 168: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,246 INFO L290 TraceCheckUtils]: 167: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,246 INFO L290 TraceCheckUtils]: 166: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,246 INFO L290 TraceCheckUtils]: 165: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,246 INFO L290 TraceCheckUtils]: 164: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,246 INFO L290 TraceCheckUtils]: 163: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,246 INFO L290 TraceCheckUtils]: 162: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,246 INFO L290 TraceCheckUtils]: 161: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,246 INFO L290 TraceCheckUtils]: 160: Hoare triple {10112#false} assume !!(main_~i~0#1 < main_~m~0#1);main_~j~0#1 := 0; {10112#false} is VALID [2022-02-20 14:21:29,246 INFO L290 TraceCheckUtils]: 159: Hoare triple {10112#false} main_~i~0#1 := 1 + main_~i~0#1; {10112#false} is VALID [2022-02-20 14:21:29,246 INFO L290 TraceCheckUtils]: 158: Hoare triple {10112#false} assume !(main_~j~0#1 < main_~n~0#1); {10112#false} is VALID [2022-02-20 14:21:29,246 INFO L290 TraceCheckUtils]: 157: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,246 INFO L290 TraceCheckUtils]: 156: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,246 INFO L290 TraceCheckUtils]: 155: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,246 INFO L290 TraceCheckUtils]: 154: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,247 INFO L290 TraceCheckUtils]: 153: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,247 INFO L290 TraceCheckUtils]: 152: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,247 INFO L290 TraceCheckUtils]: 151: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,247 INFO L290 TraceCheckUtils]: 150: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,247 INFO L290 TraceCheckUtils]: 149: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,247 INFO L290 TraceCheckUtils]: 148: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,247 INFO L290 TraceCheckUtils]: 147: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,247 INFO L290 TraceCheckUtils]: 146: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,247 INFO L290 TraceCheckUtils]: 145: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,247 INFO L290 TraceCheckUtils]: 144: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,247 INFO L290 TraceCheckUtils]: 143: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,247 INFO L290 TraceCheckUtils]: 142: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,247 INFO L290 TraceCheckUtils]: 141: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,247 INFO L290 TraceCheckUtils]: 140: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,247 INFO L290 TraceCheckUtils]: 139: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,247 INFO L290 TraceCheckUtils]: 138: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,247 INFO L290 TraceCheckUtils]: 137: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,247 INFO L290 TraceCheckUtils]: 136: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,248 INFO L290 TraceCheckUtils]: 135: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,248 INFO L290 TraceCheckUtils]: 134: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,248 INFO L290 TraceCheckUtils]: 133: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,248 INFO L290 TraceCheckUtils]: 132: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,248 INFO L290 TraceCheckUtils]: 131: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,248 INFO L290 TraceCheckUtils]: 130: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,248 INFO L290 TraceCheckUtils]: 129: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,248 INFO L290 TraceCheckUtils]: 128: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,248 INFO L290 TraceCheckUtils]: 127: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,248 INFO L290 TraceCheckUtils]: 126: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,248 INFO L290 TraceCheckUtils]: 125: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,248 INFO L290 TraceCheckUtils]: 124: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,248 INFO L290 TraceCheckUtils]: 123: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,248 INFO L290 TraceCheckUtils]: 122: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,248 INFO L290 TraceCheckUtils]: 121: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,248 INFO L290 TraceCheckUtils]: 120: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,248 INFO L290 TraceCheckUtils]: 119: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,248 INFO L290 TraceCheckUtils]: 118: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,249 INFO L290 TraceCheckUtils]: 117: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,249 INFO L290 TraceCheckUtils]: 116: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,249 INFO L290 TraceCheckUtils]: 115: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,249 INFO L290 TraceCheckUtils]: 114: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,249 INFO L290 TraceCheckUtils]: 113: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,249 INFO L290 TraceCheckUtils]: 112: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,249 INFO L290 TraceCheckUtils]: 111: Hoare triple {10112#false} assume !!(main_~i~0#1 < main_~m~0#1);main_~j~0#1 := 0; {10112#false} is VALID [2022-02-20 14:21:29,249 INFO L290 TraceCheckUtils]: 110: Hoare triple {10112#false} main_~i~0#1 := 1 + main_~i~0#1; {10112#false} is VALID [2022-02-20 14:21:29,249 INFO L290 TraceCheckUtils]: 109: Hoare triple {10112#false} assume !(main_~j~0#1 < main_~n~0#1); {10112#false} is VALID [2022-02-20 14:21:29,249 INFO L290 TraceCheckUtils]: 108: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,249 INFO L290 TraceCheckUtils]: 107: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,249 INFO L290 TraceCheckUtils]: 106: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,249 INFO L290 TraceCheckUtils]: 105: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,249 INFO L290 TraceCheckUtils]: 104: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,249 INFO L290 TraceCheckUtils]: 103: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,250 INFO L290 TraceCheckUtils]: 102: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,250 INFO L290 TraceCheckUtils]: 101: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,250 INFO L290 TraceCheckUtils]: 100: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,250 INFO L290 TraceCheckUtils]: 99: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,250 INFO L290 TraceCheckUtils]: 98: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,250 INFO L290 TraceCheckUtils]: 97: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,250 INFO L290 TraceCheckUtils]: 96: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,250 INFO L290 TraceCheckUtils]: 95: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,251 INFO L290 TraceCheckUtils]: 94: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,251 INFO L290 TraceCheckUtils]: 93: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,251 INFO L290 TraceCheckUtils]: 92: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,251 INFO L290 TraceCheckUtils]: 91: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,251 INFO L290 TraceCheckUtils]: 90: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,251 INFO L290 TraceCheckUtils]: 89: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,251 INFO L290 TraceCheckUtils]: 88: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,252 INFO L290 TraceCheckUtils]: 87: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,252 INFO L290 TraceCheckUtils]: 86: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,252 INFO L290 TraceCheckUtils]: 85: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,252 INFO L290 TraceCheckUtils]: 84: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,252 INFO L290 TraceCheckUtils]: 83: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,252 INFO L290 TraceCheckUtils]: 82: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,252 INFO L290 TraceCheckUtils]: 81: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,253 INFO L290 TraceCheckUtils]: 80: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,253 INFO L290 TraceCheckUtils]: 79: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,253 INFO L290 TraceCheckUtils]: 78: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,253 INFO L290 TraceCheckUtils]: 77: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,253 INFO L290 TraceCheckUtils]: 76: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,253 INFO L290 TraceCheckUtils]: 75: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,253 INFO L290 TraceCheckUtils]: 74: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,253 INFO L290 TraceCheckUtils]: 73: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,254 INFO L290 TraceCheckUtils]: 72: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,254 INFO L290 TraceCheckUtils]: 71: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,254 INFO L290 TraceCheckUtils]: 70: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,254 INFO L290 TraceCheckUtils]: 69: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,254 INFO L290 TraceCheckUtils]: 68: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,254 INFO L290 TraceCheckUtils]: 67: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,254 INFO L290 TraceCheckUtils]: 66: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,254 INFO L290 TraceCheckUtils]: 65: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,255 INFO L290 TraceCheckUtils]: 64: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,255 INFO L290 TraceCheckUtils]: 63: Hoare triple {10112#false} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {10112#false} is VALID [2022-02-20 14:21:29,255 INFO L290 TraceCheckUtils]: 62: Hoare triple {10112#false} assume !!(main_~i~0#1 < main_~m~0#1);main_~j~0#1 := 0; {10112#false} is VALID [2022-02-20 14:21:29,255 INFO L290 TraceCheckUtils]: 61: Hoare triple {10112#false} main_~i~0#1 := 1 + main_~i~0#1; {10112#false} is VALID [2022-02-20 14:21:29,259 INFO L290 TraceCheckUtils]: 60: Hoare triple {11304#(< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|)} assume !(main_~j~0#1 < main_~n~0#1); {10112#false} is VALID [2022-02-20 14:21:29,260 INFO L290 TraceCheckUtils]: 59: Hoare triple {11308#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {11304#(< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,261 INFO L290 TraceCheckUtils]: 58: Hoare triple {11312#(< (+ 2 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {11308#(< (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,262 INFO L290 TraceCheckUtils]: 57: Hoare triple {11316#(< (+ 3 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {11312#(< (+ 2 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,263 INFO L290 TraceCheckUtils]: 56: Hoare triple {11320#(< (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {11316#(< (+ 3 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,264 INFO L290 TraceCheckUtils]: 55: Hoare triple {11324#(< (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {11320#(< (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,265 INFO L290 TraceCheckUtils]: 54: Hoare triple {11328#(< (+ 6 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {11324#(< (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,266 INFO L290 TraceCheckUtils]: 53: Hoare triple {11332#(< (+ 7 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {11328#(< (+ 6 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,266 INFO L290 TraceCheckUtils]: 52: Hoare triple {11336#(< (+ |ULTIMATE.start_main_~j~0#1| 8) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {11332#(< (+ 7 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,267 INFO L290 TraceCheckUtils]: 51: Hoare triple {11340#(< (+ 9 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {11336#(< (+ |ULTIMATE.start_main_~j~0#1| 8) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,268 INFO L290 TraceCheckUtils]: 50: Hoare triple {11344#(< (+ |ULTIMATE.start_main_~j~0#1| 10) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {11340#(< (+ 9 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,269 INFO L290 TraceCheckUtils]: 49: Hoare triple {11348#(< (+ |ULTIMATE.start_main_~j~0#1| 11) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {11344#(< (+ |ULTIMATE.start_main_~j~0#1| 10) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,270 INFO L290 TraceCheckUtils]: 48: Hoare triple {11352#(< (+ |ULTIMATE.start_main_~j~0#1| 12) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {11348#(< (+ |ULTIMATE.start_main_~j~0#1| 11) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,271 INFO L290 TraceCheckUtils]: 47: Hoare triple {11356#(< (+ |ULTIMATE.start_main_~j~0#1| 13) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {11352#(< (+ |ULTIMATE.start_main_~j~0#1| 12) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,272 INFO L290 TraceCheckUtils]: 46: Hoare triple {11360#(< (+ 14 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {11356#(< (+ |ULTIMATE.start_main_~j~0#1| 13) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,273 INFO L290 TraceCheckUtils]: 45: Hoare triple {11364#(< (+ |ULTIMATE.start_main_~j~0#1| 15) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {11360#(< (+ 14 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,273 INFO L290 TraceCheckUtils]: 44: Hoare triple {11368#(< (+ 16 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {11364#(< (+ |ULTIMATE.start_main_~j~0#1| 15) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,274 INFO L290 TraceCheckUtils]: 43: Hoare triple {11372#(< (+ |ULTIMATE.start_main_~j~0#1| 17) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {11368#(< (+ 16 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,275 INFO L290 TraceCheckUtils]: 42: Hoare triple {11376#(< (+ |ULTIMATE.start_main_~j~0#1| 18) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {11372#(< (+ |ULTIMATE.start_main_~j~0#1| 17) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,276 INFO L290 TraceCheckUtils]: 41: Hoare triple {11380#(< (+ 19 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {11376#(< (+ |ULTIMATE.start_main_~j~0#1| 18) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,277 INFO L290 TraceCheckUtils]: 40: Hoare triple {11384#(< (+ |ULTIMATE.start_main_~j~0#1| 20) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {11380#(< (+ 19 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,278 INFO L290 TraceCheckUtils]: 39: Hoare triple {11388#(< (+ 21 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {11384#(< (+ |ULTIMATE.start_main_~j~0#1| 20) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,279 INFO L290 TraceCheckUtils]: 38: Hoare triple {11392#(< (+ 22 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {11388#(< (+ 21 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,280 INFO L290 TraceCheckUtils]: 37: Hoare triple {11396#(< (+ 23 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {11392#(< (+ 22 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,281 INFO L290 TraceCheckUtils]: 36: Hoare triple {11400#(< (+ |ULTIMATE.start_main_~j~0#1| 24) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {11396#(< (+ 23 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,282 INFO L290 TraceCheckUtils]: 35: Hoare triple {11404#(< (+ |ULTIMATE.start_main_~j~0#1| 25) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {11400#(< (+ |ULTIMATE.start_main_~j~0#1| 24) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,282 INFO L290 TraceCheckUtils]: 34: Hoare triple {11408#(< (+ |ULTIMATE.start_main_~j~0#1| 26) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {11404#(< (+ |ULTIMATE.start_main_~j~0#1| 25) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,283 INFO L290 TraceCheckUtils]: 33: Hoare triple {11412#(< (+ |ULTIMATE.start_main_~j~0#1| 27) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {11408#(< (+ |ULTIMATE.start_main_~j~0#1| 26) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,284 INFO L290 TraceCheckUtils]: 32: Hoare triple {11416#(< (+ |ULTIMATE.start_main_~j~0#1| 28) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {11412#(< (+ |ULTIMATE.start_main_~j~0#1| 27) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,285 INFO L290 TraceCheckUtils]: 31: Hoare triple {11420#(< (+ 29 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {11416#(< (+ |ULTIMATE.start_main_~j~0#1| 28) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,285 INFO L290 TraceCheckUtils]: 30: Hoare triple {11424#(< (+ 30 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {11420#(< (+ 29 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,286 INFO L290 TraceCheckUtils]: 29: Hoare triple {11428#(< (+ 31 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {11424#(< (+ 30 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,287 INFO L290 TraceCheckUtils]: 28: Hoare triple {11432#(< (+ 32 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {11428#(< (+ 31 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,287 INFO L290 TraceCheckUtils]: 27: Hoare triple {11436#(< (+ |ULTIMATE.start_main_~j~0#1| 33) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {11432#(< (+ 32 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,288 INFO L290 TraceCheckUtils]: 26: Hoare triple {11440#(< (+ |ULTIMATE.start_main_~j~0#1| 34) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {11436#(< (+ |ULTIMATE.start_main_~j~0#1| 33) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,289 INFO L290 TraceCheckUtils]: 25: Hoare triple {11444#(< (+ 35 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {11440#(< (+ |ULTIMATE.start_main_~j~0#1| 34) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,291 INFO L290 TraceCheckUtils]: 24: Hoare triple {11448#(< (+ |ULTIMATE.start_main_~j~0#1| 36) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {11444#(< (+ 35 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,291 INFO L290 TraceCheckUtils]: 23: Hoare triple {11452#(< (+ |ULTIMATE.start_main_~j~0#1| 37) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {11448#(< (+ |ULTIMATE.start_main_~j~0#1| 36) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,292 INFO L290 TraceCheckUtils]: 22: Hoare triple {11456#(< (+ |ULTIMATE.start_main_~j~0#1| 38) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {11452#(< (+ |ULTIMATE.start_main_~j~0#1| 37) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,293 INFO L290 TraceCheckUtils]: 21: Hoare triple {11460#(< (+ |ULTIMATE.start_main_~j~0#1| 39) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {11456#(< (+ |ULTIMATE.start_main_~j~0#1| 38) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,293 INFO L290 TraceCheckUtils]: 20: Hoare triple {11464#(< (+ 40 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {11460#(< (+ |ULTIMATE.start_main_~j~0#1| 39) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,294 INFO L290 TraceCheckUtils]: 19: Hoare triple {11468#(< (+ 41 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {11464#(< (+ 40 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,295 INFO L290 TraceCheckUtils]: 18: Hoare triple {11472#(< (+ 42 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {11468#(< (+ 41 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,295 INFO L290 TraceCheckUtils]: 17: Hoare triple {11476#(< (+ |ULTIMATE.start_main_~j~0#1| 43) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {11472#(< (+ 42 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,296 INFO L290 TraceCheckUtils]: 16: Hoare triple {11480#(< (+ 44 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {11476#(< (+ |ULTIMATE.start_main_~j~0#1| 43) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,297 INFO L290 TraceCheckUtils]: 15: Hoare triple {11484#(< (+ |ULTIMATE.start_main_~j~0#1| 45) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {11480#(< (+ 44 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,297 INFO L290 TraceCheckUtils]: 14: Hoare triple {11488#(< (+ 46 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 < main_~n~0#1);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;call write~int(main_#t~nondet4#1, main_~#B~0#1.base, main_~#B~0#1.offset + main_~i~0#1 * (4 * main_~n~0#1) + 4 * main_~j~0#1, 4);havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; {11484#(< (+ |ULTIMATE.start_main_~j~0#1| 45) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,298 INFO L290 TraceCheckUtils]: 13: Hoare triple {11492#(< 46 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~i~0#1 < main_~m~0#1);main_~j~0#1 := 0; {11488#(< (+ 46 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,298 INFO L290 TraceCheckUtils]: 12: Hoare triple {11492#(< 46 |ULTIMATE.start_main_~n~0#1|)} main_~i~0#1 := 0;main_~j~0#1 := 0; {11492#(< 46 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,299 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {10111#true} {11492#(< 46 |ULTIMATE.start_main_~n~0#1|)} #109#return; {11492#(< 46 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,299 INFO L290 TraceCheckUtils]: 10: Hoare triple {10111#true} assume true; {10111#true} is VALID [2022-02-20 14:21:29,299 INFO L290 TraceCheckUtils]: 9: Hoare triple {10111#true} assume !(0 == ~cond); {10111#true} is VALID [2022-02-20 14:21:29,299 INFO L290 TraceCheckUtils]: 8: Hoare triple {10111#true} ~cond := #in~cond; {10111#true} is VALID [2022-02-20 14:21:29,299 INFO L272 TraceCheckUtils]: 7: Hoare triple {11492#(< 46 |ULTIMATE.start_main_~n~0#1|)} call assume_abort_if_not((if main_~s~0#1 < main_~n~0#1 then 1 else 0)); {10111#true} is VALID [2022-02-20 14:21:29,299 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {10111#true} {11492#(< 46 |ULTIMATE.start_main_~n~0#1|)} #107#return; {11492#(< 46 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,299 INFO L290 TraceCheckUtils]: 5: Hoare triple {10111#true} assume true; {10111#true} is VALID [2022-02-20 14:21:29,299 INFO L290 TraceCheckUtils]: 4: Hoare triple {10111#true} assume !(0 == ~cond); {10111#true} is VALID [2022-02-20 14:21:29,299 INFO L290 TraceCheckUtils]: 3: Hoare triple {10111#true} ~cond := #in~cond; {10111#true} is VALID [2022-02-20 14:21:29,300 INFO L272 TraceCheckUtils]: 2: Hoare triple {11492#(< 46 |ULTIMATE.start_main_~n~0#1|)} call assume_abort_if_not((if main_~q~0#1 < main_~m~0#1 then 1 else 0)); {10111#true} is VALID [2022-02-20 14:21:29,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {10111#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_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1, main_~q~0#1, main_~s~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;main_~m~0#1 := 1000;main_~n~0#1 := 1500;main_~q~0#1 := 500;main_~s~0#1 := 700;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~m~0#1);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(4 * main_~n~0#1 * main_~m~0#1); {11492#(< 46 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 14:21:29,300 INFO L290 TraceCheckUtils]: 0: Hoare triple {10111#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(21, 2);call #Ultimate.allocInit(12, 3); {10111#true} is VALID [2022-02-20 14:21:29,305 INFO L134 CoverageAnalysis]: Checked inductivity of 17600 backedges. 6631 proven. 1081 refuted. 0 times theorem prover too weak. 9888 trivial. 0 not checked. [2022-02-20 14:21:29,305 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:21:29,305 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207822263] [2022-02-20 14:21:29,305 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:21:29,305 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96519845] [2022-02-20 14:21:29,305 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96519845] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:21:29,305 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:21:29,305 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 98 [2022-02-20 14:21:29,305 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291428052] [2022-02-20 14:21:29,305 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:21:29,306 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 98 states have (on average 1.2244897959183674) internal successors, (120), 98 states have internal predecessors, (120), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 221 [2022-02-20 14:21:29,307 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:21:29,307 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 98 states, 98 states have (on average 1.2244897959183674) internal successors, (120), 98 states have internal predecessors, (120), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 14:21:29,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:21:29,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2022-02-20 14:21:29,393 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:21:29,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2022-02-20 14:21:29,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4659, Invalid=4847, Unknown=0, NotChecked=0, Total=9506 [2022-02-20 14:21:29,396 INFO L87 Difference]: Start difference. First operand 221 states and 230 transitions. Second operand has 98 states, 98 states have (on average 1.2244897959183674) internal successors, (120), 98 states have internal predecessors, (120), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)