./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-programs/partial_mod_count_limited_1.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-programs/partial_mod_count_limited_1.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 8f54012f988f8b18e3a56958a20c5d2f68df7899121416cbc3449d3f0665a6c5 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:16:25,379 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:16:25,382 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:16:25,427 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:16:25,427 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:16:25,431 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:16:25,432 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:16:25,434 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:16:25,436 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:16:25,442 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:16:25,443 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:16:25,444 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:16:25,445 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:16:25,447 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:16:25,448 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:16:25,451 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:16:25,452 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:16:25,453 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:16:25,455 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:16:25,458 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:16:25,460 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:16:25,461 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:16:25,463 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:16:25,464 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:16:25,468 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:16:25,468 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:16:25,468 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:16:25,470 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:16:25,470 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:16:25,471 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:16:25,471 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:16:25,472 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:16:25,473 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:16:25,474 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:16:25,475 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:16:25,476 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:16:25,476 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:16:25,476 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:16:25,476 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:16:25,477 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:16:25,478 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:16:25,478 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:16:25,500 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:16:25,500 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:16:25,501 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:16:25,501 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:16:25,502 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:16:25,502 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:16:25,502 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:16:25,502 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:16:25,502 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:16:25,503 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:16:25,503 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:16:25,504 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:16:25,504 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:16:25,504 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:16:25,504 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:16:25,504 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:16:25,504 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:16:25,505 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:16:25,505 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:16:25,505 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:16:25,505 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:16:25,505 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:16:25,505 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:16:25,506 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:16:25,506 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:16:25,506 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:16:25,506 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:16:25,506 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:16:25,506 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:16:25,506 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:16:25,507 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:16:25,507 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:16:25,507 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:16:25,507 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 -> 8f54012f988f8b18e3a56958a20c5d2f68df7899121416cbc3449d3f0665a6c5 [2022-02-20 14:16:25,717 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:16:25,739 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:16:25,741 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:16:25,742 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:16:25,742 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:16:25,743 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-programs/partial_mod_count_limited_1.c [2022-02-20 14:16:25,801 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67b4c94e0/f5ff58d7546e46b18353705c2df52ded/FLAG9404336cf [2022-02-20 14:16:26,152 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:16:26,152 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-programs/partial_mod_count_limited_1.c [2022-02-20 14:16:26,156 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67b4c94e0/f5ff58d7546e46b18353705c2df52ded/FLAG9404336cf [2022-02-20 14:16:26,167 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67b4c94e0/f5ff58d7546e46b18353705c2df52ded [2022-02-20 14:16:26,169 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:16:26,170 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:16:26,171 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:16:26,172 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:16:26,174 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:16:26,175 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:16:26" (1/1) ... [2022-02-20 14:16:26,176 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@749bd28d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:16:26, skipping insertion in model container [2022-02-20 14:16:26,176 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:16:26" (1/1) ... [2022-02-20 14:16:26,182 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:16:26,191 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:16:26,344 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-programs/partial_mod_count_limited_1.c[331,344] [2022-02-20 14:16:26,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:16:26,385 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:16:26,399 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-programs/partial_mod_count_limited_1.c[331,344] [2022-02-20 14:16:26,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:16:26,418 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:16:26,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:16:26 WrapperNode [2022-02-20 14:16:26,419 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:16:26,420 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:16:26,420 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:16:26,420 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:16:26,430 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:16:26" (1/1) ... [2022-02-20 14:16:26,446 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:16:26" (1/1) ... [2022-02-20 14:16:26,477 INFO L137 Inliner]: procedures = 15, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 68 [2022-02-20 14:16:26,480 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:16:26,481 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:16:26,481 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:16:26,481 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:16:26,488 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:16:26" (1/1) ... [2022-02-20 14:16:26,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:16:26" (1/1) ... [2022-02-20 14:16:26,497 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:16:26" (1/1) ... [2022-02-20 14:16:26,498 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:16:26" (1/1) ... [2022-02-20 14:16:26,509 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:16:26" (1/1) ... [2022-02-20 14:16:26,521 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:16:26" (1/1) ... [2022-02-20 14:16:26,522 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:16:26" (1/1) ... [2022-02-20 14:16:26,529 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:16:26,530 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:16:26,530 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:16:26,530 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:16:26,531 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:16:26" (1/1) ... [2022-02-20 14:16:26,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:16:26,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:16:26,563 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:16:26,587 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:16:26,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:16:26,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:16:26,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:16:26,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:16:26,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:16:26,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:16:26,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:16:26,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:16:26,660 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:16:26,661 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:16:26,820 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:16:26,825 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:16:26,825 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 14:16:26,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:16:26 BoogieIcfgContainer [2022-02-20 14:16:26,826 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:16:26,828 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:16:26,828 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:16:26,831 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:16:26,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:16:26" (1/3) ... [2022-02-20 14:16:26,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4592e916 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:16:26, skipping insertion in model container [2022-02-20 14:16:26,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:16:26" (2/3) ... [2022-02-20 14:16:26,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4592e916 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:16:26, skipping insertion in model container [2022-02-20 14:16:26,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:16:26" (3/3) ... [2022-02-20 14:16:26,833 INFO L111 eAbstractionObserver]: Analyzing ICFG partial_mod_count_limited_1.c [2022-02-20 14:16:26,837 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:16:26,837 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:16:26,892 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:16:26,898 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:16:26,898 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:16:26,933 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:16:26,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 14:16:26,938 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:16:26,939 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:16:26,939 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:16:26,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:16:26,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1939796378, now seen corresponding path program 1 times [2022-02-20 14:16:26,958 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:16:26,959 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864830621] [2022-02-20 14:16:26,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:16:26,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:16:27,074 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:16:27,075 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [754414885] [2022-02-20 14:16:27,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:16:27,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:16:27,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:16:27,083 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:16:27,093 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:16:27,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:16:27,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 14:16:27,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:16:27,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:16:27,276 INFO L290 TraceCheckUtils]: 0: Hoare triple {25#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(30, 2);call #Ultimate.allocInit(12, 3);~N~0 := 1000000; {25#true} is VALID [2022-02-20 14:16:27,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post5#1, main_#t~mem9#1, main_#t~post10#1, main_#t~post8#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~lim~0#1, main_~R~0#1;havoc main_~i~0#1;main_~j~0#1 := 0;main_~k~0#1 := 0;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~lim~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~R~0#1 := 1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if 0 < main_~lim~0#1 && main_~lim~0#1 % 4294967296 < (if ~N~0 % 4294967296 < 0 && 0 != ~N~0 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296) - 1 else 1 + ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296)) else ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296)) % 4294967296 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {25#true} is VALID [2022-02-20 14:16:27,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {26#false} is VALID [2022-02-20 14:16:27,278 INFO L290 TraceCheckUtils]: 3: Hoare triple {26#false} assume { :end_inline_assume_abort_if_not } true;main_~i~0#1 := 0; {26#false} is VALID [2022-02-20 14:16:27,279 INFO L290 TraceCheckUtils]: 4: Hoare triple {26#false} assume !true; {26#false} is VALID [2022-02-20 14:16:27,279 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#false} main_~i~0#1 := 0; {26#false} is VALID [2022-02-20 14:16:27,279 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#false} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem9#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {26#false} is VALID [2022-02-20 14:16:27,280 INFO L290 TraceCheckUtils]: 7: Hoare triple {26#false} assume !(0 == main_#t~mem9#1);havoc main_#t~mem9#1; {26#false} is VALID [2022-02-20 14:16:27,280 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 % 4294967296 < (if ~N~0 % 4294967296 < 0 && 0 != ~N~0 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296) - 1 else 1 + ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296)) else ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296)) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {26#false} is VALID [2022-02-20 14:16:27,281 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} assume 0 == __VERIFIER_assert_~cond#1; {26#false} is VALID [2022-02-20 14:16:27,281 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-02-20 14:16:27,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:16:27,282 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:16:27,282 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:16:27,282 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864830621] [2022-02-20 14:16:27,283 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:16:27,283 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754414885] [2022-02-20 14:16:27,284 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754414885] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:16:27,284 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:16:27,284 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 14:16:27,287 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805492978] [2022-02-20 14:16:27,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:16:27,294 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 14:16:27,294 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:16:27,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:16:27,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:16:27,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 14:16:27,316 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:16:27,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 14:16:27,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:16:27,348 INFO L87 Difference]: Start difference. First operand has 22 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:16:27,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:16:27,396 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2022-02-20 14:16:27,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 14:16:27,397 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 14:16:27,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:16:27,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:16:27,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 56 transitions. [2022-02-20 14:16:27,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:16:27,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 56 transitions. [2022-02-20 14:16:27,417 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 56 transitions. [2022-02-20 14:16:27,484 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:16:27,495 INFO L225 Difference]: With dead ends: 41 [2022-02-20 14:16:27,495 INFO L226 Difference]: Without dead ends: 18 [2022-02-20 14:16:27,498 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 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:16:27,501 INFO L933 BasicCegarLoop]: 26 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, 26 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:16:27,502 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:16:27,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-02-20 14:16:27,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-20 14:16:27,523 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:16:27,523 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:16:27,524 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:16:27,524 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:16:27,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:16:27,526 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2022-02-20 14:16:27,526 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-02-20 14:16:27,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:16:27,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:16:27,527 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states. [2022-02-20 14:16:27,527 INFO L87 Difference]: Start difference. First operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states. [2022-02-20 14:16:27,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:16:27,529 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2022-02-20 14:16:27,529 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-02-20 14:16:27,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:16:27,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:16:27,530 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:16:27,530 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:16:27,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:16:27,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-02-20 14:16:27,532 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2022-02-20 14:16:27,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:16:27,533 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-02-20 14:16:27,533 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:16:27,533 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-02-20 14:16:27,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 14:16:27,534 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:16:27,534 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:16:27,559 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:16:27,763 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:16:27,806 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:16:27,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:16:27,807 INFO L85 PathProgramCache]: Analyzing trace with hash -54935082, now seen corresponding path program 1 times [2022-02-20 14:16:27,807 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:16:27,807 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535640236] [2022-02-20 14:16:27,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:16:27,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:16:27,834 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:16:27,834 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1406449025] [2022-02-20 14:16:27,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:16:27,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:16:27,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:16:27,836 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:16:27,859 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:16:27,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:16:27,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 14:16:27,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:16:27,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:16:28,028 INFO L290 TraceCheckUtils]: 0: Hoare triple {162#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(30, 2);call #Ultimate.allocInit(12, 3);~N~0 := 1000000; {167#(<= 1000000 ~N~0)} is VALID [2022-02-20 14:16:28,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {167#(<= 1000000 ~N~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post5#1, main_#t~mem9#1, main_#t~post10#1, main_#t~post8#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~lim~0#1, main_~R~0#1;havoc main_~i~0#1;main_~j~0#1 := 0;main_~k~0#1 := 0;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~lim~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~R~0#1 := 1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if 0 < main_~lim~0#1 && main_~lim~0#1 % 4294967296 < (if ~N~0 % 4294967296 < 0 && 0 != ~N~0 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296) - 1 else 1 + ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296)) else ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296)) % 4294967296 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {167#(<= 1000000 ~N~0)} is VALID [2022-02-20 14:16:28,029 INFO L290 TraceCheckUtils]: 2: Hoare triple {167#(<= 1000000 ~N~0)} assume !(0 == assume_abort_if_not_~cond#1); {167#(<= 1000000 ~N~0)} is VALID [2022-02-20 14:16:28,029 INFO L290 TraceCheckUtils]: 3: Hoare triple {167#(<= 1000000 ~N~0)} assume { :end_inline_assume_abort_if_not } true;main_~i~0#1 := 0; {177#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:16:28,030 INFO L290 TraceCheckUtils]: 4: Hoare triple {177#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000000 ~N~0))} assume !(main_~i~0#1 < ~N~0); {163#false} is VALID [2022-02-20 14:16:28,030 INFO L290 TraceCheckUtils]: 5: Hoare triple {163#false} main_~i~0#1 := 0; {163#false} is VALID [2022-02-20 14:16:28,030 INFO L290 TraceCheckUtils]: 6: Hoare triple {163#false} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem9#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {163#false} is VALID [2022-02-20 14:16:28,030 INFO L290 TraceCheckUtils]: 7: Hoare triple {163#false} assume !(0 == main_#t~mem9#1);havoc main_#t~mem9#1; {163#false} is VALID [2022-02-20 14:16:28,031 INFO L290 TraceCheckUtils]: 8: Hoare triple {163#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 % 4294967296 < (if ~N~0 % 4294967296 < 0 && 0 != ~N~0 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296) - 1 else 1 + ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296)) else ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296)) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {163#false} is VALID [2022-02-20 14:16:28,031 INFO L290 TraceCheckUtils]: 9: Hoare triple {163#false} assume 0 == __VERIFIER_assert_~cond#1; {163#false} is VALID [2022-02-20 14:16:28,032 INFO L290 TraceCheckUtils]: 10: Hoare triple {163#false} assume !false; {163#false} is VALID [2022-02-20 14:16:28,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:16:28,032 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:16:28,032 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:16:28,033 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535640236] [2022-02-20 14:16:28,033 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:16:28,034 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406449025] [2022-02-20 14:16:28,035 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406449025] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:16:28,035 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:16:28,035 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:16:28,035 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683034205] [2022-02-20 14:16:28,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:16:28,036 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 14:16:28,036 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:16:28,037 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:16:28,048 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:16:28,048 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:16:28,049 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:16:28,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:16:28,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:16:28,050 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:16:28,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:16:28,123 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2022-02-20 14:16:28,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 14:16:28,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 14:16:28,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:16:28,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:16:28,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-02-20 14:16:28,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:16:28,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-02-20 14:16:28,126 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 49 transitions. [2022-02-20 14:16:28,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:16:28,172 INFO L225 Difference]: With dead ends: 40 [2022-02-20 14:16:28,172 INFO L226 Difference]: Without dead ends: 31 [2022-02-20 14:16:28,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 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:16:28,173 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 32 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:16:28,174 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 23 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:16:28,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-02-20 14:16:28,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 19. [2022-02-20 14:16:28,180 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:16:28,181 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:16:28,181 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:16:28,182 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:16:28,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:16:28,186 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-02-20 14:16:28,186 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-02-20 14:16:28,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:16:28,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:16:28,187 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 31 states. [2022-02-20 14:16:28,190 INFO L87 Difference]: Start difference. First operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 31 states. [2022-02-20 14:16:28,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:16:28,193 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-02-20 14:16:28,193 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-02-20 14:16:28,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:16:28,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:16:28,194 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:16:28,194 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:16:28,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:16:28,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-02-20 14:16:28,196 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 11 [2022-02-20 14:16:28,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:16:28,196 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-02-20 14:16:28,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:16:28,197 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-02-20 14:16:28,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 14:16:28,197 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:16:28,197 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:16:28,221 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:16:28,416 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:16:28,417 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:16:28,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:16:28,417 INFO L85 PathProgramCache]: Analyzing trace with hash 784383783, now seen corresponding path program 1 times [2022-02-20 14:16:28,418 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:16:28,418 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872272121] [2022-02-20 14:16:28,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:16:28,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:16:28,438 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:16:28,438 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [524690885] [2022-02-20 14:16:28,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:16:28,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:16:28,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:16:28,443 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:16:28,470 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:16:28,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:16:28,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 14:16:28,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:16:28,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:16:28,681 INFO L290 TraceCheckUtils]: 0: Hoare triple {327#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(30, 2);call #Ultimate.allocInit(12, 3);~N~0 := 1000000; {332#(<= 1000000 ~N~0)} is VALID [2022-02-20 14:16:28,682 INFO L290 TraceCheckUtils]: 1: Hoare triple {332#(<= 1000000 ~N~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post5#1, main_#t~mem9#1, main_#t~post10#1, main_#t~post8#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~lim~0#1, main_~R~0#1;havoc main_~i~0#1;main_~j~0#1 := 0;main_~k~0#1 := 0;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~lim~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~R~0#1 := 1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if 0 < main_~lim~0#1 && main_~lim~0#1 % 4294967296 < (if ~N~0 % 4294967296 < 0 && 0 != ~N~0 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296) - 1 else 1 + ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296)) else ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296)) % 4294967296 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {332#(<= 1000000 ~N~0)} is VALID [2022-02-20 14:16:28,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {332#(<= 1000000 ~N~0)} assume !(0 == assume_abort_if_not_~cond#1); {332#(<= 1000000 ~N~0)} is VALID [2022-02-20 14:16:28,683 INFO L290 TraceCheckUtils]: 3: Hoare triple {332#(<= 1000000 ~N~0)} assume { :end_inline_assume_abort_if_not } true;main_~i~0#1 := 0; {342#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:16:28,684 INFO L290 TraceCheckUtils]: 4: Hoare triple {342#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000000 ~N~0))} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {342#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:16:28,690 INFO L290 TraceCheckUtils]: 5: Hoare triple {342#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000000 ~N~0))} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {342#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:16:28,690 INFO L290 TraceCheckUtils]: 6: Hoare triple {342#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000000 ~N~0))} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {342#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:16:28,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {342#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000000 ~N~0))} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {342#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:16:28,692 INFO L290 TraceCheckUtils]: 8: Hoare triple {342#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000000 ~N~0))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {358#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:16:28,692 INFO L290 TraceCheckUtils]: 9: Hoare triple {358#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !(main_~i~0#1 < ~N~0); {328#false} is VALID [2022-02-20 14:16:28,692 INFO L290 TraceCheckUtils]: 10: Hoare triple {328#false} main_~i~0#1 := 0; {328#false} is VALID [2022-02-20 14:16:28,693 INFO L290 TraceCheckUtils]: 11: Hoare triple {328#false} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem9#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {328#false} is VALID [2022-02-20 14:16:28,693 INFO L290 TraceCheckUtils]: 12: Hoare triple {328#false} assume !(0 == main_#t~mem9#1);havoc main_#t~mem9#1; {328#false} is VALID [2022-02-20 14:16:28,693 INFO L290 TraceCheckUtils]: 13: Hoare triple {328#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 % 4294967296 < (if ~N~0 % 4294967296 < 0 && 0 != ~N~0 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296) - 1 else 1 + ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296)) else ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296)) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {328#false} is VALID [2022-02-20 14:16:28,693 INFO L290 TraceCheckUtils]: 14: Hoare triple {328#false} assume 0 == __VERIFIER_assert_~cond#1; {328#false} is VALID [2022-02-20 14:16:28,694 INFO L290 TraceCheckUtils]: 15: Hoare triple {328#false} assume !false; {328#false} is VALID [2022-02-20 14:16:28,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:16:28,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:16:28,806 INFO L290 TraceCheckUtils]: 15: Hoare triple {328#false} assume !false; {328#false} is VALID [2022-02-20 14:16:28,806 INFO L290 TraceCheckUtils]: 14: Hoare triple {328#false} assume 0 == __VERIFIER_assert_~cond#1; {328#false} is VALID [2022-02-20 14:16:28,806 INFO L290 TraceCheckUtils]: 13: Hoare triple {328#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 % 4294967296 < (if ~N~0 % 4294967296 < 0 && 0 != ~N~0 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296) - 1 else 1 + ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296)) else ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296)) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {328#false} is VALID [2022-02-20 14:16:28,806 INFO L290 TraceCheckUtils]: 12: Hoare triple {328#false} assume !(0 == main_#t~mem9#1);havoc main_#t~mem9#1; {328#false} is VALID [2022-02-20 14:16:28,807 INFO L290 TraceCheckUtils]: 11: Hoare triple {328#false} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem9#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {328#false} is VALID [2022-02-20 14:16:28,807 INFO L290 TraceCheckUtils]: 10: Hoare triple {328#false} main_~i~0#1 := 0; {328#false} is VALID [2022-02-20 14:16:28,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {398#(< |ULTIMATE.start_main_~i~0#1| ~N~0)} assume !(main_~i~0#1 < ~N~0); {328#false} is VALID [2022-02-20 14:16:28,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {402#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {398#(< |ULTIMATE.start_main_~i~0#1| ~N~0)} is VALID [2022-02-20 14:16:28,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {402#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {402#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} is VALID [2022-02-20 14:16:28,809 INFO L290 TraceCheckUtils]: 6: Hoare triple {402#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {402#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} is VALID [2022-02-20 14:16:28,809 INFO L290 TraceCheckUtils]: 5: Hoare triple {402#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {402#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} is VALID [2022-02-20 14:16:28,814 INFO L290 TraceCheckUtils]: 4: Hoare triple {402#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {402#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} is VALID [2022-02-20 14:16:28,814 INFO L290 TraceCheckUtils]: 3: Hoare triple {418#(< 1 ~N~0)} assume { :end_inline_assume_abort_if_not } true;main_~i~0#1 := 0; {402#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} is VALID [2022-02-20 14:16:28,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {418#(< 1 ~N~0)} assume !(0 == assume_abort_if_not_~cond#1); {418#(< 1 ~N~0)} is VALID [2022-02-20 14:16:28,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {418#(< 1 ~N~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post5#1, main_#t~mem9#1, main_#t~post10#1, main_#t~post8#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~lim~0#1, main_~R~0#1;havoc main_~i~0#1;main_~j~0#1 := 0;main_~k~0#1 := 0;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~lim~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~R~0#1 := 1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if 0 < main_~lim~0#1 && main_~lim~0#1 % 4294967296 < (if ~N~0 % 4294967296 < 0 && 0 != ~N~0 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296) - 1 else 1 + ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296)) else ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296)) % 4294967296 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {418#(< 1 ~N~0)} is VALID [2022-02-20 14:16:28,818 INFO L290 TraceCheckUtils]: 0: Hoare triple {327#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(30, 2);call #Ultimate.allocInit(12, 3);~N~0 := 1000000; {418#(< 1 ~N~0)} is VALID [2022-02-20 14:16:28,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:16:28,818 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:16:28,818 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872272121] [2022-02-20 14:16:28,818 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:16:28,818 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524690885] [2022-02-20 14:16:28,819 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524690885] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:16:28,819 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:16:28,819 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-02-20 14:16:28,819 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799107702] [2022-02-20 14:16:28,819 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:16:28,820 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 14:16:28,820 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:16:28,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:16:28,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:16:28,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 14:16:28,847 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:16:28,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 14:16:28,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-02-20 14:16:28,848 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:16:29,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:16:29,151 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2022-02-20 14:16:29,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 14:16:29,151 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 14:16:29,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:16:29,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:16:29,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 85 transitions. [2022-02-20 14:16:29,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:16:29,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 85 transitions. [2022-02-20 14:16:29,155 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 85 transitions. [2022-02-20 14:16:29,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:16:29,239 INFO L225 Difference]: With dead ends: 68 [2022-02-20 14:16:29,239 INFO L226 Difference]: Without dead ends: 59 [2022-02-20 14:16:29,239 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 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:16:29,240 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 236 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:16:29,241 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [236 Valid, 41 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:16:29,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-02-20 14:16:29,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 34. [2022-02-20 14:16:29,263 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:16:29,263 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 34 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:16:29,264 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 34 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:16:29,265 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 34 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:16:29,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:16:29,270 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2022-02-20 14:16:29,271 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2022-02-20 14:16:29,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:16:29,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:16:29,271 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 59 states. [2022-02-20 14:16:29,272 INFO L87 Difference]: Start difference. First operand has 34 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 59 states. [2022-02-20 14:16:29,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:16:29,275 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2022-02-20 14:16:29,275 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2022-02-20 14:16:29,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:16:29,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:16:29,276 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:16:29,277 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:16:29,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:16:29,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2022-02-20 14:16:29,278 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 16 [2022-02-20 14:16:29,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:16:29,279 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2022-02-20 14:16:29,279 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:16:29,279 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2022-02-20 14:16:29,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 14:16:29,281 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:16:29,281 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:16:29,307 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:16:29,499 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:16:29,500 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:16:29,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:16:29,500 INFO L85 PathProgramCache]: Analyzing trace with hash -520466666, now seen corresponding path program 2 times [2022-02-20 14:16:29,500 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:16:29,500 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020038805] [2022-02-20 14:16:29,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:16:29,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:16:29,520 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:16:29,520 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [103144570] [2022-02-20 14:16:29,520 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:16:29,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:16:29,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:16:29,522 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:16:29,525 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:16:29,615 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-20 14:16:29,615 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:16:29,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 14:16:29,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:16:29,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:16:52,641 INFO L290 TraceCheckUtils]: 0: Hoare triple {668#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(30, 2);call #Ultimate.allocInit(12, 3);~N~0 := 1000000; {668#true} is VALID [2022-02-20 14:16:52,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {668#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post5#1, main_#t~mem9#1, main_#t~post10#1, main_#t~post8#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~lim~0#1, main_~R~0#1;havoc main_~i~0#1;main_~j~0#1 := 0;main_~k~0#1 := 0;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~lim~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~R~0#1 := 1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if 0 < main_~lim~0#1 && main_~lim~0#1 % 4294967296 < (if ~N~0 % 4294967296 < 0 && 0 != ~N~0 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296) - 1 else 1 + ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296)) else ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296)) % 4294967296 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {676#(and (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (< 0 (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:16:52,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {676#(and (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (< 0 (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !(0 == assume_abort_if_not_~cond#1); {680#(and (< 0 (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296)) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:16:52,645 INFO L290 TraceCheckUtils]: 3: Hoare triple {680#(and (< 0 (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296)) (= |ULTIMATE.start_main_~j~0#1| 0))} assume { :end_inline_assume_abort_if_not } true;main_~i~0#1 := 0; {680#(and (< 0 (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296)) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:16:52,647 INFO L290 TraceCheckUtils]: 4: Hoare triple {680#(and (< 0 (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296)) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {680#(and (< 0 (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296)) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:16:52,648 INFO L290 TraceCheckUtils]: 5: Hoare triple {680#(and (< 0 (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296)) (= |ULTIMATE.start_main_~j~0#1| 0))} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {680#(and (< 0 (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296)) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:16:52,648 INFO L290 TraceCheckUtils]: 6: Hoare triple {680#(and (< 0 (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296)) (= |ULTIMATE.start_main_~j~0#1| 0))} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {680#(and (< 0 (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296)) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:16:52,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {680#(and (< 0 (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296)) (= |ULTIMATE.start_main_~j~0#1| 0))} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {680#(and (< 0 (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296)) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:16:52,652 INFO L290 TraceCheckUtils]: 8: Hoare triple {680#(and (< 0 (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296)) (= |ULTIMATE.start_main_~j~0#1| 0))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {680#(and (< 0 (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296)) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:16:52,653 INFO L290 TraceCheckUtils]: 9: Hoare triple {680#(and (< 0 (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296)) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {680#(and (< 0 (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296)) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:16:52,653 INFO L290 TraceCheckUtils]: 10: Hoare triple {680#(and (< 0 (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296)) (= |ULTIMATE.start_main_~j~0#1| 0))} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {680#(and (< 0 (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296)) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:16:52,654 INFO L290 TraceCheckUtils]: 11: Hoare triple {680#(and (< 0 (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296)) (= |ULTIMATE.start_main_~j~0#1| 0))} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {680#(and (< 0 (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296)) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:16:52,655 INFO L290 TraceCheckUtils]: 12: Hoare triple {680#(and (< 0 (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296)) (= |ULTIMATE.start_main_~j~0#1| 0))} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {680#(and (< 0 (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296)) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:16:52,655 INFO L290 TraceCheckUtils]: 13: Hoare triple {680#(and (< 0 (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296)) (= |ULTIMATE.start_main_~j~0#1| 0))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {680#(and (< 0 (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296)) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:16:52,656 INFO L290 TraceCheckUtils]: 14: Hoare triple {680#(and (< 0 (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296)) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {680#(and (< 0 (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296)) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:16:52,657 INFO L290 TraceCheckUtils]: 15: Hoare triple {680#(and (< 0 (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296)) (= |ULTIMATE.start_main_~j~0#1| 0))} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {680#(and (< 0 (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296)) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:16:52,658 INFO L290 TraceCheckUtils]: 16: Hoare triple {680#(and (< 0 (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296)) (= |ULTIMATE.start_main_~j~0#1| 0))} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {680#(and (< 0 (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296)) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:16:52,661 INFO L290 TraceCheckUtils]: 17: Hoare triple {680#(and (< 0 (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296)) (= |ULTIMATE.start_main_~j~0#1| 0))} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {680#(and (< 0 (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296)) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:16:52,661 INFO L290 TraceCheckUtils]: 18: Hoare triple {680#(and (< 0 (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296)) (= |ULTIMATE.start_main_~j~0#1| 0))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {680#(and (< 0 (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296)) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:16:52,662 INFO L290 TraceCheckUtils]: 19: Hoare triple {680#(and (< 0 (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296)) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {680#(and (< 0 (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296)) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:16:52,663 INFO L290 TraceCheckUtils]: 20: Hoare triple {680#(and (< 0 (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296)) (= |ULTIMATE.start_main_~j~0#1| 0))} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {680#(and (< 0 (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296)) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:16:52,663 INFO L290 TraceCheckUtils]: 21: Hoare triple {680#(and (< 0 (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296)) (= |ULTIMATE.start_main_~j~0#1| 0))} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {680#(and (< 0 (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296)) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:16:52,664 INFO L290 TraceCheckUtils]: 22: Hoare triple {680#(and (< 0 (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296)) (= |ULTIMATE.start_main_~j~0#1| 0))} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {680#(and (< 0 (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296)) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:16:52,664 INFO L290 TraceCheckUtils]: 23: Hoare triple {680#(and (< 0 (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296)) (= |ULTIMATE.start_main_~j~0#1| 0))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {680#(and (< 0 (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296)) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:16:52,665 INFO L290 TraceCheckUtils]: 24: Hoare triple {680#(and (< 0 (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296)) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !(main_~i~0#1 < ~N~0); {680#(and (< 0 (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296)) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:16:52,666 INFO L290 TraceCheckUtils]: 25: Hoare triple {680#(and (< 0 (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296)) (= |ULTIMATE.start_main_~j~0#1| 0))} main_~i~0#1 := 0; {680#(and (< 0 (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296)) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:16:52,667 INFO L290 TraceCheckUtils]: 26: Hoare triple {680#(and (< 0 (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296)) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem9#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {680#(and (< 0 (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296)) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:16:52,667 INFO L290 TraceCheckUtils]: 27: Hoare triple {680#(and (< 0 (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296)) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !(0 == main_#t~mem9#1);havoc main_#t~mem9#1; {680#(and (< 0 (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296)) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:16:52,668 INFO L290 TraceCheckUtils]: 28: Hoare triple {680#(and (< 0 (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296)) (= |ULTIMATE.start_main_~j~0#1| 0))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 % 4294967296 < (if ~N~0 % 4294967296 < 0 && 0 != ~N~0 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296) - 1 else 1 + ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296)) else ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296)) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {759#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:16:52,668 INFO L290 TraceCheckUtils]: 29: Hoare triple {759#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {669#false} is VALID [2022-02-20 14:16:52,669 INFO L290 TraceCheckUtils]: 30: Hoare triple {669#false} assume !false; {669#false} is VALID [2022-02-20 14:16:52,669 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-02-20 14:16:52,669 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:16:52,669 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:16:52,669 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020038805] [2022-02-20 14:16:52,669 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:16:52,670 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103144570] [2022-02-20 14:16:52,670 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103144570] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:16:52,670 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:16:52,670 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 14:16:52,670 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117686081] [2022-02-20 14:16:52,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:16:52,670 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-02-20 14:16:52,671 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:16:52,671 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:16:52,702 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:16:52,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 14:16:52,703 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:16:52,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 14:16:52,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:16:52,704 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:16:53,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:16:53,575 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2022-02-20 14:16:53,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 14:16:53,575 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-02-20 14:16:53,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:16:53,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:16:53,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-02-20 14:16:53,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:16:53,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-02-20 14:16:53,577 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 36 transitions. [2022-02-20 14:16:53,641 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:16:53,642 INFO L225 Difference]: With dead ends: 46 [2022-02-20 14:16:53,642 INFO L226 Difference]: Without dead ends: 44 [2022-02-20 14:16:53,642 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:16:53,643 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 28 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 14:16:53,643 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 40 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 14:16:53,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-02-20 14:16:53,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2022-02-20 14:16:53,663 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:16:53,664 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 40 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:16:53,664 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 40 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:16:53,664 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 40 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:16:53,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:16:53,666 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2022-02-20 14:16:53,666 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2022-02-20 14:16:53,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:16:53,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:16:53,666 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 44 states. [2022-02-20 14:16:53,667 INFO L87 Difference]: Start difference. First operand has 40 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 44 states. [2022-02-20 14:16:53,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:16:53,668 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2022-02-20 14:16:53,668 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2022-02-20 14:16:53,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:16:53,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:16:53,669 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:16:53,669 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:16:53,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:16:53,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2022-02-20 14:16:53,671 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 31 [2022-02-20 14:16:53,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:16:53,671 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 51 transitions. [2022-02-20 14:16:53,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:16:53,671 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2022-02-20 14:16:53,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 14:16:53,672 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:16:53,672 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:16:53,684 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:16:53,873 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:16:53,873 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:16:53,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:16:53,873 INFO L85 PathProgramCache]: Analyzing trace with hash -520526248, now seen corresponding path program 1 times [2022-02-20 14:16:53,874 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:16:53,874 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132639572] [2022-02-20 14:16:53,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:16:53,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:16:53,893 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:16:53,895 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [264026799] [2022-02-20 14:16:53,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:16:53,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:16:53,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:16:53,905 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:16:53,931 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:16:53,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:16:53,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 14:16:54,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:16:54,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:16:54,706 INFO L290 TraceCheckUtils]: 0: Hoare triple {958#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(30, 2);call #Ultimate.allocInit(12, 3);~N~0 := 1000000; {963#(<= 1000000 ~N~0)} is VALID [2022-02-20 14:16:54,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {963#(<= 1000000 ~N~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post5#1, main_#t~mem9#1, main_#t~post10#1, main_#t~post8#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~lim~0#1, main_~R~0#1;havoc main_~i~0#1;main_~j~0#1 := 0;main_~k~0#1 := 0;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~lim~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~R~0#1 := 1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if 0 < main_~lim~0#1 && main_~lim~0#1 % 4294967296 < (if ~N~0 % 4294967296 < 0 && 0 != ~N~0 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296) - 1 else 1 + ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296)) else ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296)) % 4294967296 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {963#(<= 1000000 ~N~0)} is VALID [2022-02-20 14:16:54,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {963#(<= 1000000 ~N~0)} assume !(0 == assume_abort_if_not_~cond#1); {963#(<= 1000000 ~N~0)} is VALID [2022-02-20 14:16:54,707 INFO L290 TraceCheckUtils]: 3: Hoare triple {963#(<= 1000000 ~N~0)} assume { :end_inline_assume_abort_if_not } true;main_~i~0#1 := 0; {973#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:16:54,708 INFO L290 TraceCheckUtils]: 4: Hoare triple {973#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000000 ~N~0))} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {973#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:16:54,709 INFO L290 TraceCheckUtils]: 5: Hoare triple {973#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000000 ~N~0))} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {973#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:16:54,709 INFO L290 TraceCheckUtils]: 6: Hoare triple {973#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000000 ~N~0))} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {973#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:16:54,710 INFO L290 TraceCheckUtils]: 7: Hoare triple {973#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000000 ~N~0))} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {973#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:16:54,716 INFO L290 TraceCheckUtils]: 8: Hoare triple {973#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000000 ~N~0))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {989#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:16:54,716 INFO L290 TraceCheckUtils]: 9: Hoare triple {989#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {989#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:16:54,717 INFO L290 TraceCheckUtils]: 10: Hoare triple {989#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {989#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:16:54,718 INFO L290 TraceCheckUtils]: 11: Hoare triple {989#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {989#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:16:54,718 INFO L290 TraceCheckUtils]: 12: Hoare triple {989#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {989#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:16:54,719 INFO L290 TraceCheckUtils]: 13: Hoare triple {989#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1005#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:16:54,719 INFO L290 TraceCheckUtils]: 14: Hoare triple {1005#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1000000 ~N~0))} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1005#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:16:54,720 INFO L290 TraceCheckUtils]: 15: Hoare triple {1005#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1000000 ~N~0))} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1005#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:16:54,720 INFO L290 TraceCheckUtils]: 16: Hoare triple {1005#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1000000 ~N~0))} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1005#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:16:54,721 INFO L290 TraceCheckUtils]: 17: Hoare triple {1005#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1000000 ~N~0))} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1005#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:16:54,722 INFO L290 TraceCheckUtils]: 18: Hoare triple {1005#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1000000 ~N~0))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1021#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:16:54,722 INFO L290 TraceCheckUtils]: 19: Hoare triple {1021#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 1000000 ~N~0))} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1021#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:16:54,723 INFO L290 TraceCheckUtils]: 20: Hoare triple {1021#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 1000000 ~N~0))} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1021#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:16:54,724 INFO L290 TraceCheckUtils]: 21: Hoare triple {1021#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 1000000 ~N~0))} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1021#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:16:54,724 INFO L290 TraceCheckUtils]: 22: Hoare triple {1021#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 1000000 ~N~0))} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1021#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:16:54,725 INFO L290 TraceCheckUtils]: 23: Hoare triple {1021#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 1000000 ~N~0))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1037#(and (<= |ULTIMATE.start_main_~i~0#1| 4) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:16:54,726 INFO L290 TraceCheckUtils]: 24: Hoare triple {1037#(and (<= |ULTIMATE.start_main_~i~0#1| 4) (<= 1000000 ~N~0))} assume !(main_~i~0#1 < ~N~0); {959#false} is VALID [2022-02-20 14:16:54,726 INFO L290 TraceCheckUtils]: 25: Hoare triple {959#false} main_~i~0#1 := 0; {959#false} is VALID [2022-02-20 14:16:54,726 INFO L290 TraceCheckUtils]: 26: Hoare triple {959#false} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem9#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {959#false} is VALID [2022-02-20 14:16:54,726 INFO L290 TraceCheckUtils]: 27: Hoare triple {959#false} assume 0 == main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {959#false} is VALID [2022-02-20 14:16:54,727 INFO L290 TraceCheckUtils]: 28: Hoare triple {959#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 % 4294967296 < (if ~N~0 % 4294967296 < 0 && 0 != ~N~0 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296) - 1 else 1 + ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296)) else ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296)) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {959#false} is VALID [2022-02-20 14:16:54,727 INFO L290 TraceCheckUtils]: 29: Hoare triple {959#false} assume 0 == __VERIFIER_assert_~cond#1; {959#false} is VALID [2022-02-20 14:16:54,727 INFO L290 TraceCheckUtils]: 30: Hoare triple {959#false} assume !false; {959#false} is VALID [2022-02-20 14:16:54,727 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:16:54,727 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:16:55,298 INFO L290 TraceCheckUtils]: 30: Hoare triple {959#false} assume !false; {959#false} is VALID [2022-02-20 14:16:55,298 INFO L290 TraceCheckUtils]: 29: Hoare triple {959#false} assume 0 == __VERIFIER_assert_~cond#1; {959#false} is VALID [2022-02-20 14:16:55,299 INFO L290 TraceCheckUtils]: 28: Hoare triple {959#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 % 4294967296 < (if ~N~0 % 4294967296 < 0 && 0 != ~N~0 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296) - 1 else 1 + ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296)) else ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296)) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {959#false} is VALID [2022-02-20 14:16:55,299 INFO L290 TraceCheckUtils]: 27: Hoare triple {959#false} assume 0 == main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {959#false} is VALID [2022-02-20 14:16:55,299 INFO L290 TraceCheckUtils]: 26: Hoare triple {959#false} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem9#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {959#false} is VALID [2022-02-20 14:16:55,299 INFO L290 TraceCheckUtils]: 25: Hoare triple {959#false} main_~i~0#1 := 0; {959#false} is VALID [2022-02-20 14:16:55,307 INFO L290 TraceCheckUtils]: 24: Hoare triple {1077#(< |ULTIMATE.start_main_~i~0#1| ~N~0)} assume !(main_~i~0#1 < ~N~0); {959#false} is VALID [2022-02-20 14:16:55,308 INFO L290 TraceCheckUtils]: 23: Hoare triple {1081#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1077#(< |ULTIMATE.start_main_~i~0#1| ~N~0)} is VALID [2022-02-20 14:16:55,309 INFO L290 TraceCheckUtils]: 22: Hoare triple {1081#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1081#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} is VALID [2022-02-20 14:16:55,309 INFO L290 TraceCheckUtils]: 21: Hoare triple {1081#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1081#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} is VALID [2022-02-20 14:16:55,310 INFO L290 TraceCheckUtils]: 20: Hoare triple {1081#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1081#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} is VALID [2022-02-20 14:16:55,310 INFO L290 TraceCheckUtils]: 19: Hoare triple {1081#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1081#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} is VALID [2022-02-20 14:16:55,311 INFO L290 TraceCheckUtils]: 18: Hoare triple {1097#(< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0)} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1081#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} is VALID [2022-02-20 14:16:55,311 INFO L290 TraceCheckUtils]: 17: Hoare triple {1097#(< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1097#(< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:16:55,312 INFO L290 TraceCheckUtils]: 16: Hoare triple {1097#(< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0)} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1097#(< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:16:55,312 INFO L290 TraceCheckUtils]: 15: Hoare triple {1097#(< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1097#(< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:16:55,313 INFO L290 TraceCheckUtils]: 14: Hoare triple {1097#(< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1097#(< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:16:55,313 INFO L290 TraceCheckUtils]: 13: Hoare triple {1113#(< (+ 3 |ULTIMATE.start_main_~i~0#1|) ~N~0)} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1097#(< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:16:55,314 INFO L290 TraceCheckUtils]: 12: Hoare triple {1113#(< (+ 3 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1113#(< (+ 3 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:16:55,323 INFO L290 TraceCheckUtils]: 11: Hoare triple {1113#(< (+ 3 |ULTIMATE.start_main_~i~0#1|) ~N~0)} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1113#(< (+ 3 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:16:55,324 INFO L290 TraceCheckUtils]: 10: Hoare triple {1113#(< (+ 3 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1113#(< (+ 3 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:16:55,324 INFO L290 TraceCheckUtils]: 9: Hoare triple {1113#(< (+ 3 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1113#(< (+ 3 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:16:55,325 INFO L290 TraceCheckUtils]: 8: Hoare triple {1129#(< (+ |ULTIMATE.start_main_~i~0#1| 4) ~N~0)} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1113#(< (+ 3 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:16:55,325 INFO L290 TraceCheckUtils]: 7: Hoare triple {1129#(< (+ |ULTIMATE.start_main_~i~0#1| 4) ~N~0)} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1129#(< (+ |ULTIMATE.start_main_~i~0#1| 4) ~N~0)} is VALID [2022-02-20 14:16:55,326 INFO L290 TraceCheckUtils]: 6: Hoare triple {1129#(< (+ |ULTIMATE.start_main_~i~0#1| 4) ~N~0)} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1129#(< (+ |ULTIMATE.start_main_~i~0#1| 4) ~N~0)} is VALID [2022-02-20 14:16:55,326 INFO L290 TraceCheckUtils]: 5: Hoare triple {1129#(< (+ |ULTIMATE.start_main_~i~0#1| 4) ~N~0)} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1129#(< (+ |ULTIMATE.start_main_~i~0#1| 4) ~N~0)} is VALID [2022-02-20 14:16:55,327 INFO L290 TraceCheckUtils]: 4: Hoare triple {1129#(< (+ |ULTIMATE.start_main_~i~0#1| 4) ~N~0)} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1129#(< (+ |ULTIMATE.start_main_~i~0#1| 4) ~N~0)} is VALID [2022-02-20 14:16:55,327 INFO L290 TraceCheckUtils]: 3: Hoare triple {1145#(< 4 ~N~0)} assume { :end_inline_assume_abort_if_not } true;main_~i~0#1 := 0; {1129#(< (+ |ULTIMATE.start_main_~i~0#1| 4) ~N~0)} is VALID [2022-02-20 14:16:55,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {1145#(< 4 ~N~0)} assume !(0 == assume_abort_if_not_~cond#1); {1145#(< 4 ~N~0)} is VALID [2022-02-20 14:16:55,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {1145#(< 4 ~N~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post5#1, main_#t~mem9#1, main_#t~post10#1, main_#t~post8#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~lim~0#1, main_~R~0#1;havoc main_~i~0#1;main_~j~0#1 := 0;main_~k~0#1 := 0;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~lim~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~R~0#1 := 1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if 0 < main_~lim~0#1 && main_~lim~0#1 % 4294967296 < (if ~N~0 % 4294967296 < 0 && 0 != ~N~0 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296) - 1 else 1 + ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296)) else ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296)) % 4294967296 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1145#(< 4 ~N~0)} is VALID [2022-02-20 14:16:55,329 INFO L290 TraceCheckUtils]: 0: Hoare triple {958#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(30, 2);call #Ultimate.allocInit(12, 3);~N~0 := 1000000; {1145#(< 4 ~N~0)} is VALID [2022-02-20 14:16:55,329 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:16:55,329 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:16:55,329 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132639572] [2022-02-20 14:16:55,329 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:16:55,329 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264026799] [2022-02-20 14:16:55,329 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264026799] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:16:55,329 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:16:55,329 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2022-02-20 14:16:55,330 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503518213] [2022-02-20 14:16:55,330 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:16:55,330 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 13 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-02-20 14:16:55,330 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:16:55,331 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 4.0) internal successors, (56), 13 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:16:55,395 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:16:55,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 14:16:55,396 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:16:55,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 14:16:55,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2022-02-20 14:16:55,396 INFO L87 Difference]: Start difference. First operand 40 states and 51 transitions. Second operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 13 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:16:57,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:16:57,157 INFO L93 Difference]: Finished difference Result 211 states and 259 transitions. [2022-02-20 14:16:57,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 14:16:57,158 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 13 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-02-20 14:16:57,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:16:57,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 13 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:16:57,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 184 transitions. [2022-02-20 14:16:57,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 13 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:16:57,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 184 transitions. [2022-02-20 14:16:57,164 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 184 transitions. [2022-02-20 14:16:57,406 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:16:57,411 INFO L225 Difference]: With dead ends: 211 [2022-02-20 14:16:57,411 INFO L226 Difference]: Without dead ends: 196 [2022-02-20 14:16:57,411 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=151, Invalid=191, Unknown=0, NotChecked=0, Total=342 [2022-02-20 14:16:57,412 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 273 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 14:16:57,412 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [273 Valid, 99 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 14:16:57,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-02-20 14:16:57,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 70. [2022-02-20 14:16:57,459 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:16:57,460 INFO L82 GeneralOperation]: Start isEquivalent. First operand 196 states. Second operand has 70 states, 69 states have (on average 1.3478260869565217) internal successors, (93), 69 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:16:57,460 INFO L74 IsIncluded]: Start isIncluded. First operand 196 states. Second operand has 70 states, 69 states have (on average 1.3478260869565217) internal successors, (93), 69 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:16:57,460 INFO L87 Difference]: Start difference. First operand 196 states. Second operand has 70 states, 69 states have (on average 1.3478260869565217) internal successors, (93), 69 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:16:57,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:16:57,468 INFO L93 Difference]: Finished difference Result 196 states and 236 transitions. [2022-02-20 14:16:57,468 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 236 transitions. [2022-02-20 14:16:57,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:16:57,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:16:57,474 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 69 states have (on average 1.3478260869565217) internal successors, (93), 69 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 196 states. [2022-02-20 14:16:57,475 INFO L87 Difference]: Start difference. First operand has 70 states, 69 states have (on average 1.3478260869565217) internal successors, (93), 69 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 196 states. [2022-02-20 14:16:57,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:16:57,532 INFO L93 Difference]: Finished difference Result 196 states and 236 transitions. [2022-02-20 14:16:57,532 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 236 transitions. [2022-02-20 14:16:57,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:16:57,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:16:57,533 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:16:57,533 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:16:57,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.3478260869565217) internal successors, (93), 69 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:16:57,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 93 transitions. [2022-02-20 14:16:57,536 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 93 transitions. Word has length 31 [2022-02-20 14:16:57,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:16:57,536 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 93 transitions. [2022-02-20 14:16:57,537 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 13 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:16:57,537 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 93 transitions. [2022-02-20 14:16:57,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-02-20 14:16:57,538 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:16:57,538 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:16:57,576 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:16:57,752 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:16:57,753 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:16:57,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:16:57,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1117364680, now seen corresponding path program 2 times [2022-02-20 14:16:57,754 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:16:57,754 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950031204] [2022-02-20 14:16:57,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:16:57,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:16:57,816 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:16:57,816 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [568595063] [2022-02-20 14:16:57,816 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:16:57,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:16:57,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:16:57,820 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:16:57,846 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:16:57,903 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-20 14:16:57,903 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:16:57,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-20 14:16:57,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:16:57,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:17:02,202 INFO L290 TraceCheckUtils]: 0: Hoare triple {1884#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(30, 2);call #Ultimate.allocInit(12, 3);~N~0 := 1000000; {1884#true} is VALID [2022-02-20 14:17:02,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {1884#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post5#1, main_#t~mem9#1, main_#t~post10#1, main_#t~post8#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~lim~0#1, main_~R~0#1;havoc main_~i~0#1;main_~j~0#1 := 0;main_~k~0#1 := 0;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~lim~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~R~0#1 := 1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if 0 < main_~lim~0#1 && main_~lim~0#1 % 4294967296 < (if ~N~0 % 4294967296 < 0 && 0 != ~N~0 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296) - 1 else 1 + ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296)) else ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296)) % 4294967296 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1892#(and (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:17:02,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {1892#(and (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !(0 == assume_abort_if_not_~cond#1); {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:17:02,206 INFO L290 TraceCheckUtils]: 3: Hoare triple {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} assume { :end_inline_assume_abort_if_not } true;main_~i~0#1 := 0; {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:17:02,207 INFO L290 TraceCheckUtils]: 4: Hoare triple {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:17:02,207 INFO L290 TraceCheckUtils]: 5: Hoare triple {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:17:02,208 INFO L290 TraceCheckUtils]: 6: Hoare triple {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:17:02,208 INFO L290 TraceCheckUtils]: 7: Hoare triple {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:17:02,209 INFO L290 TraceCheckUtils]: 8: Hoare triple {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:17:02,209 INFO L290 TraceCheckUtils]: 9: Hoare triple {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:17:02,210 INFO L290 TraceCheckUtils]: 10: Hoare triple {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:17:02,210 INFO L290 TraceCheckUtils]: 11: Hoare triple {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:17:02,210 INFO L290 TraceCheckUtils]: 12: Hoare triple {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:17:02,211 INFO L290 TraceCheckUtils]: 13: Hoare triple {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:17:02,211 INFO L290 TraceCheckUtils]: 14: Hoare triple {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:17:02,212 INFO L290 TraceCheckUtils]: 15: Hoare triple {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:17:02,212 INFO L290 TraceCheckUtils]: 16: Hoare triple {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:17:02,213 INFO L290 TraceCheckUtils]: 17: Hoare triple {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:17:02,213 INFO L290 TraceCheckUtils]: 18: Hoare triple {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:17:02,214 INFO L290 TraceCheckUtils]: 19: Hoare triple {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:17:02,214 INFO L290 TraceCheckUtils]: 20: Hoare triple {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:17:02,215 INFO L290 TraceCheckUtils]: 21: Hoare triple {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:17:02,215 INFO L290 TraceCheckUtils]: 22: Hoare triple {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:17:02,216 INFO L290 TraceCheckUtils]: 23: Hoare triple {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:17:02,216 INFO L290 TraceCheckUtils]: 24: Hoare triple {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:17:02,217 INFO L290 TraceCheckUtils]: 25: Hoare triple {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:17:02,217 INFO L290 TraceCheckUtils]: 26: Hoare triple {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:17:02,218 INFO L290 TraceCheckUtils]: 27: Hoare triple {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:17:02,218 INFO L290 TraceCheckUtils]: 28: Hoare triple {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:17:02,218 INFO L290 TraceCheckUtils]: 29: Hoare triple {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:17:02,219 INFO L290 TraceCheckUtils]: 30: Hoare triple {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:17:02,220 INFO L290 TraceCheckUtils]: 31: Hoare triple {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:17:02,220 INFO L290 TraceCheckUtils]: 32: Hoare triple {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:17:02,221 INFO L290 TraceCheckUtils]: 33: Hoare triple {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:17:02,221 INFO L290 TraceCheckUtils]: 34: Hoare triple {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:17:02,222 INFO L290 TraceCheckUtils]: 35: Hoare triple {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:17:02,223 INFO L290 TraceCheckUtils]: 36: Hoare triple {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:17:02,223 INFO L290 TraceCheckUtils]: 37: Hoare triple {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:17:02,224 INFO L290 TraceCheckUtils]: 38: Hoare triple {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:17:02,225 INFO L290 TraceCheckUtils]: 39: Hoare triple {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:17:02,225 INFO L290 TraceCheckUtils]: 40: Hoare triple {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:17:02,226 INFO L290 TraceCheckUtils]: 41: Hoare triple {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:17:02,227 INFO L290 TraceCheckUtils]: 42: Hoare triple {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:17:02,227 INFO L290 TraceCheckUtils]: 43: Hoare triple {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:17:02,228 INFO L290 TraceCheckUtils]: 44: Hoare triple {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:17:02,229 INFO L290 TraceCheckUtils]: 45: Hoare triple {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:17:02,229 INFO L290 TraceCheckUtils]: 46: Hoare triple {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:17:02,230 INFO L290 TraceCheckUtils]: 47: Hoare triple {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:17:02,231 INFO L290 TraceCheckUtils]: 48: Hoare triple {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:17:02,231 INFO L290 TraceCheckUtils]: 49: Hoare triple {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:17:02,232 INFO L290 TraceCheckUtils]: 50: Hoare triple {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:17:02,233 INFO L290 TraceCheckUtils]: 51: Hoare triple {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:17:02,233 INFO L290 TraceCheckUtils]: 52: Hoare triple {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:17:02,234 INFO L290 TraceCheckUtils]: 53: Hoare triple {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:17:02,234 INFO L290 TraceCheckUtils]: 54: Hoare triple {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !(main_~i~0#1 < ~N~0); {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:17:02,235 INFO L290 TraceCheckUtils]: 55: Hoare triple {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} main_~i~0#1 := 0; {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:17:02,236 INFO L290 TraceCheckUtils]: 56: Hoare triple {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem9#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 14:17:02,236 INFO L290 TraceCheckUtils]: 57: Hoare triple {1896#(and (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| 0))} assume 0 == main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2062#(and (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1))} is VALID [2022-02-20 14:17:02,239 INFO L290 TraceCheckUtils]: 58: Hoare triple {2062#(and (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (< (div (+ (mod (div (mod ~N~0 4294967296) (mod |ULTIMATE.start_main_~R~0#1| 4294967296)) 4294967296) (- 2)) (- 4294967296)) 1) (= |ULTIMATE.start_main_~R~0#1| 1))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 % 4294967296 < (if ~N~0 % 4294967296 < 0 && 0 != ~N~0 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296) - 1 else 1 + ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296)) else ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296)) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2066#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:17:02,240 INFO L290 TraceCheckUtils]: 59: Hoare triple {2066#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {1885#false} is VALID [2022-02-20 14:17:02,240 INFO L290 TraceCheckUtils]: 60: Hoare triple {1885#false} assume !false; {1885#false} is VALID [2022-02-20 14:17:02,240 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-20 14:17:02,240 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:17:02,241 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:17:02,241 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950031204] [2022-02-20 14:17:02,241 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:17:02,241 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568595063] [2022-02-20 14:17:02,241 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568595063] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:17:02,241 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:17:02,241 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 14:17:02,241 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752010903] [2022-02-20 14:17:02,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:17:02,242 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2022-02-20 14:17:02,242 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:17:02,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:17:02,275 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:17:02,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 14:17:02,276 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:17:02,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 14:17:02,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 14:17:02,276 INFO L87 Difference]: Start difference. First operand 70 states and 93 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:17:03,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:17:03,337 INFO L93 Difference]: Finished difference Result 83 states and 108 transitions. [2022-02-20 14:17:03,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 14:17:03,338 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2022-02-20 14:17:03,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:17:03,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:17:03,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2022-02-20 14:17:03,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:17:03,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2022-02-20 14:17:03,340 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 44 transitions. [2022-02-20 14:17:03,410 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:17:03,412 INFO L225 Difference]: With dead ends: 83 [2022-02-20 14:17:03,412 INFO L226 Difference]: Without dead ends: 81 [2022-02-20 14:17:03,412 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-02-20 14:17:03,413 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 40 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 14:17:03,413 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 54 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 14:17:03,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-02-20 14:17:03,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2022-02-20 14:17:03,465 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:17:03,465 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 76 states, 75 states have (on average 1.3333333333333333) internal successors, (100), 75 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:17:03,465 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 76 states, 75 states have (on average 1.3333333333333333) internal successors, (100), 75 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:17:03,465 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 76 states, 75 states have (on average 1.3333333333333333) internal successors, (100), 75 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:17:03,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:17:03,467 INFO L93 Difference]: Finished difference Result 81 states and 106 transitions. [2022-02-20 14:17:03,467 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 106 transitions. [2022-02-20 14:17:03,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:17:03,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:17:03,468 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 75 states have (on average 1.3333333333333333) internal successors, (100), 75 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 81 states. [2022-02-20 14:17:03,468 INFO L87 Difference]: Start difference. First operand has 76 states, 75 states have (on average 1.3333333333333333) internal successors, (100), 75 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 81 states. [2022-02-20 14:17:03,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:17:03,470 INFO L93 Difference]: Finished difference Result 81 states and 106 transitions. [2022-02-20 14:17:03,470 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 106 transitions. [2022-02-20 14:17:03,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:17:03,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:17:03,470 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:17:03,470 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:17:03,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.3333333333333333) internal successors, (100), 75 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:17:03,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 100 transitions. [2022-02-20 14:17:03,472 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 100 transitions. Word has length 61 [2022-02-20 14:17:03,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:17:03,472 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 100 transitions. [2022-02-20 14:17:03,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:17:03,472 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 100 transitions. [2022-02-20 14:17:03,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 14:17:03,479 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:17:03,479 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:17:03,498 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:17:03,687 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:17:03,688 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:17:03,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:17:03,688 INFO L85 PathProgramCache]: Analyzing trace with hash 824832363, now seen corresponding path program 1 times [2022-02-20 14:17:03,688 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:17:03,688 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133063211] [2022-02-20 14:17:03,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:17:03,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:17:03,717 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:17:03,717 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [304199553] [2022-02-20 14:17:03,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:17:03,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:17:03,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:17:03,719 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:17:03,722 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:17:03,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:17:03,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 14:17:03,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:17:03,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:17:05,652 INFO L290 TraceCheckUtils]: 0: Hoare triple {2428#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(30, 2);call #Ultimate.allocInit(12, 3);~N~0 := 1000000; {2433#(<= 1000000 ~N~0)} is VALID [2022-02-20 14:17:05,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {2433#(<= 1000000 ~N~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post5#1, main_#t~mem9#1, main_#t~post10#1, main_#t~post8#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~lim~0#1, main_~R~0#1;havoc main_~i~0#1;main_~j~0#1 := 0;main_~k~0#1 := 0;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~lim~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~R~0#1 := 1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if 0 < main_~lim~0#1 && main_~lim~0#1 % 4294967296 < (if ~N~0 % 4294967296 < 0 && 0 != ~N~0 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296) - 1 else 1 + ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296)) else ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296)) % 4294967296 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2433#(<= 1000000 ~N~0)} is VALID [2022-02-20 14:17:05,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {2433#(<= 1000000 ~N~0)} assume !(0 == assume_abort_if_not_~cond#1); {2433#(<= 1000000 ~N~0)} is VALID [2022-02-20 14:17:05,654 INFO L290 TraceCheckUtils]: 3: Hoare triple {2433#(<= 1000000 ~N~0)} assume { :end_inline_assume_abort_if_not } true;main_~i~0#1 := 0; {2443#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:05,654 INFO L290 TraceCheckUtils]: 4: Hoare triple {2443#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000000 ~N~0))} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2443#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:05,655 INFO L290 TraceCheckUtils]: 5: Hoare triple {2443#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000000 ~N~0))} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2443#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:05,656 INFO L290 TraceCheckUtils]: 6: Hoare triple {2443#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000000 ~N~0))} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2443#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:05,656 INFO L290 TraceCheckUtils]: 7: Hoare triple {2443#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000000 ~N~0))} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2443#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:05,657 INFO L290 TraceCheckUtils]: 8: Hoare triple {2443#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000000 ~N~0))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2459#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:17:05,658 INFO L290 TraceCheckUtils]: 9: Hoare triple {2459#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2459#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:17:05,658 INFO L290 TraceCheckUtils]: 10: Hoare triple {2459#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2459#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:17:05,659 INFO L290 TraceCheckUtils]: 11: Hoare triple {2459#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2459#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:17:05,659 INFO L290 TraceCheckUtils]: 12: Hoare triple {2459#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2459#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:17:05,660 INFO L290 TraceCheckUtils]: 13: Hoare triple {2459#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2475#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:05,661 INFO L290 TraceCheckUtils]: 14: Hoare triple {2475#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1000000 ~N~0))} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2475#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:05,661 INFO L290 TraceCheckUtils]: 15: Hoare triple {2475#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1000000 ~N~0))} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2475#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:05,662 INFO L290 TraceCheckUtils]: 16: Hoare triple {2475#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1000000 ~N~0))} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2475#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:05,662 INFO L290 TraceCheckUtils]: 17: Hoare triple {2475#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1000000 ~N~0))} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2475#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:05,663 INFO L290 TraceCheckUtils]: 18: Hoare triple {2475#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1000000 ~N~0))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2491#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:05,663 INFO L290 TraceCheckUtils]: 19: Hoare triple {2491#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 1000000 ~N~0))} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2491#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:05,664 INFO L290 TraceCheckUtils]: 20: Hoare triple {2491#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 1000000 ~N~0))} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2491#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:05,665 INFO L290 TraceCheckUtils]: 21: Hoare triple {2491#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 1000000 ~N~0))} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2491#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:05,665 INFO L290 TraceCheckUtils]: 22: Hoare triple {2491#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 1000000 ~N~0))} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2491#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:05,666 INFO L290 TraceCheckUtils]: 23: Hoare triple {2491#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 1000000 ~N~0))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2507#(and (<= |ULTIMATE.start_main_~i~0#1| 4) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:05,667 INFO L290 TraceCheckUtils]: 24: Hoare triple {2507#(and (<= |ULTIMATE.start_main_~i~0#1| 4) (<= 1000000 ~N~0))} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2507#(and (<= |ULTIMATE.start_main_~i~0#1| 4) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:05,667 INFO L290 TraceCheckUtils]: 25: Hoare triple {2507#(and (<= |ULTIMATE.start_main_~i~0#1| 4) (<= 1000000 ~N~0))} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2507#(and (<= |ULTIMATE.start_main_~i~0#1| 4) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:05,668 INFO L290 TraceCheckUtils]: 26: Hoare triple {2507#(and (<= |ULTIMATE.start_main_~i~0#1| 4) (<= 1000000 ~N~0))} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2507#(and (<= |ULTIMATE.start_main_~i~0#1| 4) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:05,668 INFO L290 TraceCheckUtils]: 27: Hoare triple {2507#(and (<= |ULTIMATE.start_main_~i~0#1| 4) (<= 1000000 ~N~0))} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2507#(and (<= |ULTIMATE.start_main_~i~0#1| 4) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:05,669 INFO L290 TraceCheckUtils]: 28: Hoare triple {2507#(and (<= |ULTIMATE.start_main_~i~0#1| 4) (<= 1000000 ~N~0))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2523#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 5))} is VALID [2022-02-20 14:17:05,669 INFO L290 TraceCheckUtils]: 29: Hoare triple {2523#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 5))} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2523#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 5))} is VALID [2022-02-20 14:17:05,670 INFO L290 TraceCheckUtils]: 30: Hoare triple {2523#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 5))} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2523#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 5))} is VALID [2022-02-20 14:17:05,671 INFO L290 TraceCheckUtils]: 31: Hoare triple {2523#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 5))} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2523#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 5))} is VALID [2022-02-20 14:17:05,671 INFO L290 TraceCheckUtils]: 32: Hoare triple {2523#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 5))} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2523#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 5))} is VALID [2022-02-20 14:17:05,677 INFO L290 TraceCheckUtils]: 33: Hoare triple {2523#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 5))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2539#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 6))} is VALID [2022-02-20 14:17:05,678 INFO L290 TraceCheckUtils]: 34: Hoare triple {2539#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 6))} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2539#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 6))} is VALID [2022-02-20 14:17:05,679 INFO L290 TraceCheckUtils]: 35: Hoare triple {2539#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 6))} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2539#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 6))} is VALID [2022-02-20 14:17:05,679 INFO L290 TraceCheckUtils]: 36: Hoare triple {2539#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 6))} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2539#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 6))} is VALID [2022-02-20 14:17:05,680 INFO L290 TraceCheckUtils]: 37: Hoare triple {2539#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 6))} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2539#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 6))} is VALID [2022-02-20 14:17:05,680 INFO L290 TraceCheckUtils]: 38: Hoare triple {2539#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 6))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2555#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 7))} is VALID [2022-02-20 14:17:05,681 INFO L290 TraceCheckUtils]: 39: Hoare triple {2555#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 7))} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2555#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 7))} is VALID [2022-02-20 14:17:05,682 INFO L290 TraceCheckUtils]: 40: Hoare triple {2555#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 7))} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2555#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 7))} is VALID [2022-02-20 14:17:05,682 INFO L290 TraceCheckUtils]: 41: Hoare triple {2555#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 7))} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2555#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 7))} is VALID [2022-02-20 14:17:05,683 INFO L290 TraceCheckUtils]: 42: Hoare triple {2555#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 7))} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2555#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 7))} is VALID [2022-02-20 14:17:05,688 INFO L290 TraceCheckUtils]: 43: Hoare triple {2555#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 7))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2571#(and (<= |ULTIMATE.start_main_~i~0#1| 8) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:05,688 INFO L290 TraceCheckUtils]: 44: Hoare triple {2571#(and (<= |ULTIMATE.start_main_~i~0#1| 8) (<= 1000000 ~N~0))} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2571#(and (<= |ULTIMATE.start_main_~i~0#1| 8) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:05,689 INFO L290 TraceCheckUtils]: 45: Hoare triple {2571#(and (<= |ULTIMATE.start_main_~i~0#1| 8) (<= 1000000 ~N~0))} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2571#(and (<= |ULTIMATE.start_main_~i~0#1| 8) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:05,690 INFO L290 TraceCheckUtils]: 46: Hoare triple {2571#(and (<= |ULTIMATE.start_main_~i~0#1| 8) (<= 1000000 ~N~0))} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2571#(and (<= |ULTIMATE.start_main_~i~0#1| 8) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:05,693 INFO L290 TraceCheckUtils]: 47: Hoare triple {2571#(and (<= |ULTIMATE.start_main_~i~0#1| 8) (<= 1000000 ~N~0))} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2571#(and (<= |ULTIMATE.start_main_~i~0#1| 8) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:05,694 INFO L290 TraceCheckUtils]: 48: Hoare triple {2571#(and (<= |ULTIMATE.start_main_~i~0#1| 8) (<= 1000000 ~N~0))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2587#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 9))} is VALID [2022-02-20 14:17:05,695 INFO L290 TraceCheckUtils]: 49: Hoare triple {2587#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 9))} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2587#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 9))} is VALID [2022-02-20 14:17:05,695 INFO L290 TraceCheckUtils]: 50: Hoare triple {2587#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 9))} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2587#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 9))} is VALID [2022-02-20 14:17:05,696 INFO L290 TraceCheckUtils]: 51: Hoare triple {2587#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 9))} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2587#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 9))} is VALID [2022-02-20 14:17:05,696 INFO L290 TraceCheckUtils]: 52: Hoare triple {2587#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 9))} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2587#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 9))} is VALID [2022-02-20 14:17:05,697 INFO L290 TraceCheckUtils]: 53: Hoare triple {2587#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 9))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2603#(and (<= |ULTIMATE.start_main_~i~0#1| 10) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:05,698 INFO L290 TraceCheckUtils]: 54: Hoare triple {2603#(and (<= |ULTIMATE.start_main_~i~0#1| 10) (<= 1000000 ~N~0))} assume !(main_~i~0#1 < ~N~0); {2429#false} is VALID [2022-02-20 14:17:05,698 INFO L290 TraceCheckUtils]: 55: Hoare triple {2429#false} main_~i~0#1 := 0; {2429#false} is VALID [2022-02-20 14:17:05,698 INFO L290 TraceCheckUtils]: 56: Hoare triple {2429#false} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem9#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2429#false} is VALID [2022-02-20 14:17:05,698 INFO L290 TraceCheckUtils]: 57: Hoare triple {2429#false} assume 0 == main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2429#false} is VALID [2022-02-20 14:17:05,698 INFO L290 TraceCheckUtils]: 58: Hoare triple {2429#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 % 4294967296 < (if ~N~0 % 4294967296 < 0 && 0 != ~N~0 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296) - 1 else 1 + ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296)) else ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296)) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2429#false} is VALID [2022-02-20 14:17:05,698 INFO L290 TraceCheckUtils]: 59: Hoare triple {2429#false} assume !(0 == __VERIFIER_assert_~cond#1); {2429#false} is VALID [2022-02-20 14:17:05,698 INFO L290 TraceCheckUtils]: 60: Hoare triple {2429#false} assume { :end_inline___VERIFIER_assert } true; {2429#false} is VALID [2022-02-20 14:17:05,699 INFO L290 TraceCheckUtils]: 61: Hoare triple {2429#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2429#false} is VALID [2022-02-20 14:17:05,699 INFO L290 TraceCheckUtils]: 62: Hoare triple {2429#false} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem9#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2429#false} is VALID [2022-02-20 14:17:05,699 INFO L290 TraceCheckUtils]: 63: Hoare triple {2429#false} assume 0 == main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2429#false} is VALID [2022-02-20 14:17:05,699 INFO L290 TraceCheckUtils]: 64: Hoare triple {2429#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 % 4294967296 < (if ~N~0 % 4294967296 < 0 && 0 != ~N~0 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296) - 1 else 1 + ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296)) else ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296)) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2429#false} is VALID [2022-02-20 14:17:05,699 INFO L290 TraceCheckUtils]: 65: Hoare triple {2429#false} assume 0 == __VERIFIER_assert_~cond#1; {2429#false} is VALID [2022-02-20 14:17:05,699 INFO L290 TraceCheckUtils]: 66: Hoare triple {2429#false} assume !false; {2429#false} is VALID [2022-02-20 14:17:05,700 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:17:05,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:17:06,796 INFO L290 TraceCheckUtils]: 66: Hoare triple {2429#false} assume !false; {2429#false} is VALID [2022-02-20 14:17:06,796 INFO L290 TraceCheckUtils]: 65: Hoare triple {2429#false} assume 0 == __VERIFIER_assert_~cond#1; {2429#false} is VALID [2022-02-20 14:17:06,796 INFO L290 TraceCheckUtils]: 64: Hoare triple {2429#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 % 4294967296 < (if ~N~0 % 4294967296 < 0 && 0 != ~N~0 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296) - 1 else 1 + ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296)) else ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296)) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2429#false} is VALID [2022-02-20 14:17:06,796 INFO L290 TraceCheckUtils]: 63: Hoare triple {2429#false} assume 0 == main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2429#false} is VALID [2022-02-20 14:17:06,796 INFO L290 TraceCheckUtils]: 62: Hoare triple {2429#false} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem9#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2429#false} is VALID [2022-02-20 14:17:06,797 INFO L290 TraceCheckUtils]: 61: Hoare triple {2429#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2429#false} is VALID [2022-02-20 14:17:06,797 INFO L290 TraceCheckUtils]: 60: Hoare triple {2429#false} assume { :end_inline___VERIFIER_assert } true; {2429#false} is VALID [2022-02-20 14:17:06,797 INFO L290 TraceCheckUtils]: 59: Hoare triple {2429#false} assume !(0 == __VERIFIER_assert_~cond#1); {2429#false} is VALID [2022-02-20 14:17:06,797 INFO L290 TraceCheckUtils]: 58: Hoare triple {2429#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 % 4294967296 < (if ~N~0 % 4294967296 < 0 && 0 != ~N~0 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296) - 1 else 1 + ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296)) else ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296)) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2429#false} is VALID [2022-02-20 14:17:06,797 INFO L290 TraceCheckUtils]: 57: Hoare triple {2429#false} assume 0 == main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2429#false} is VALID [2022-02-20 14:17:06,797 INFO L290 TraceCheckUtils]: 56: Hoare triple {2429#false} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem9#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2429#false} is VALID [2022-02-20 14:17:06,798 INFO L290 TraceCheckUtils]: 55: Hoare triple {2429#false} main_~i~0#1 := 0; {2429#false} is VALID [2022-02-20 14:17:06,798 INFO L290 TraceCheckUtils]: 54: Hoare triple {2679#(< |ULTIMATE.start_main_~i~0#1| ~N~0)} assume !(main_~i~0#1 < ~N~0); {2429#false} is VALID [2022-02-20 14:17:06,799 INFO L290 TraceCheckUtils]: 53: Hoare triple {2683#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2679#(< |ULTIMATE.start_main_~i~0#1| ~N~0)} is VALID [2022-02-20 14:17:06,799 INFO L290 TraceCheckUtils]: 52: Hoare triple {2683#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2683#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} is VALID [2022-02-20 14:17:06,800 INFO L290 TraceCheckUtils]: 51: Hoare triple {2683#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2683#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} is VALID [2022-02-20 14:17:06,800 INFO L290 TraceCheckUtils]: 50: Hoare triple {2683#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2683#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} is VALID [2022-02-20 14:17:06,800 INFO L290 TraceCheckUtils]: 49: Hoare triple {2683#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2683#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} is VALID [2022-02-20 14:17:06,801 INFO L290 TraceCheckUtils]: 48: Hoare triple {2699#(< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0)} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2683#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} is VALID [2022-02-20 14:17:06,801 INFO L290 TraceCheckUtils]: 47: Hoare triple {2699#(< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2699#(< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:06,801 INFO L290 TraceCheckUtils]: 46: Hoare triple {2699#(< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0)} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2699#(< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:06,802 INFO L290 TraceCheckUtils]: 45: Hoare triple {2699#(< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2699#(< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:06,802 INFO L290 TraceCheckUtils]: 44: Hoare triple {2699#(< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2699#(< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:06,803 INFO L290 TraceCheckUtils]: 43: Hoare triple {2715#(< (+ 3 |ULTIMATE.start_main_~i~0#1|) ~N~0)} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2699#(< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:06,803 INFO L290 TraceCheckUtils]: 42: Hoare triple {2715#(< (+ 3 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2715#(< (+ 3 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:06,803 INFO L290 TraceCheckUtils]: 41: Hoare triple {2715#(< (+ 3 |ULTIMATE.start_main_~i~0#1|) ~N~0)} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2715#(< (+ 3 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:06,803 INFO L290 TraceCheckUtils]: 40: Hoare triple {2715#(< (+ 3 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2715#(< (+ 3 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:06,804 INFO L290 TraceCheckUtils]: 39: Hoare triple {2715#(< (+ 3 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2715#(< (+ 3 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:06,804 INFO L290 TraceCheckUtils]: 38: Hoare triple {2731#(< (+ |ULTIMATE.start_main_~i~0#1| 4) ~N~0)} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2715#(< (+ 3 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:06,805 INFO L290 TraceCheckUtils]: 37: Hoare triple {2731#(< (+ |ULTIMATE.start_main_~i~0#1| 4) ~N~0)} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2731#(< (+ |ULTIMATE.start_main_~i~0#1| 4) ~N~0)} is VALID [2022-02-20 14:17:06,805 INFO L290 TraceCheckUtils]: 36: Hoare triple {2731#(< (+ |ULTIMATE.start_main_~i~0#1| 4) ~N~0)} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2731#(< (+ |ULTIMATE.start_main_~i~0#1| 4) ~N~0)} is VALID [2022-02-20 14:17:06,806 INFO L290 TraceCheckUtils]: 35: Hoare triple {2731#(< (+ |ULTIMATE.start_main_~i~0#1| 4) ~N~0)} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2731#(< (+ |ULTIMATE.start_main_~i~0#1| 4) ~N~0)} is VALID [2022-02-20 14:17:06,806 INFO L290 TraceCheckUtils]: 34: Hoare triple {2731#(< (+ |ULTIMATE.start_main_~i~0#1| 4) ~N~0)} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2731#(< (+ |ULTIMATE.start_main_~i~0#1| 4) ~N~0)} is VALID [2022-02-20 14:17:06,807 INFO L290 TraceCheckUtils]: 33: Hoare triple {2747#(< (+ 5 |ULTIMATE.start_main_~i~0#1|) ~N~0)} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2731#(< (+ |ULTIMATE.start_main_~i~0#1| 4) ~N~0)} is VALID [2022-02-20 14:17:06,807 INFO L290 TraceCheckUtils]: 32: Hoare triple {2747#(< (+ 5 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2747#(< (+ 5 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:06,808 INFO L290 TraceCheckUtils]: 31: Hoare triple {2747#(< (+ 5 |ULTIMATE.start_main_~i~0#1|) ~N~0)} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2747#(< (+ 5 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:06,808 INFO L290 TraceCheckUtils]: 30: Hoare triple {2747#(< (+ 5 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2747#(< (+ 5 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:06,808 INFO L290 TraceCheckUtils]: 29: Hoare triple {2747#(< (+ 5 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2747#(< (+ 5 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:06,809 INFO L290 TraceCheckUtils]: 28: Hoare triple {2763#(< (+ 6 |ULTIMATE.start_main_~i~0#1|) ~N~0)} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2747#(< (+ 5 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:06,809 INFO L290 TraceCheckUtils]: 27: Hoare triple {2763#(< (+ 6 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2763#(< (+ 6 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:06,809 INFO L290 TraceCheckUtils]: 26: Hoare triple {2763#(< (+ 6 |ULTIMATE.start_main_~i~0#1|) ~N~0)} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2763#(< (+ 6 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:06,810 INFO L290 TraceCheckUtils]: 25: Hoare triple {2763#(< (+ 6 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2763#(< (+ 6 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:06,810 INFO L290 TraceCheckUtils]: 24: Hoare triple {2763#(< (+ 6 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2763#(< (+ 6 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:06,811 INFO L290 TraceCheckUtils]: 23: Hoare triple {2779#(< (+ 7 |ULTIMATE.start_main_~i~0#1|) ~N~0)} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2763#(< (+ 6 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:06,811 INFO L290 TraceCheckUtils]: 22: Hoare triple {2779#(< (+ 7 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2779#(< (+ 7 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:06,812 INFO L290 TraceCheckUtils]: 21: Hoare triple {2779#(< (+ 7 |ULTIMATE.start_main_~i~0#1|) ~N~0)} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2779#(< (+ 7 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:06,812 INFO L290 TraceCheckUtils]: 20: Hoare triple {2779#(< (+ 7 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2779#(< (+ 7 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:06,812 INFO L290 TraceCheckUtils]: 19: Hoare triple {2779#(< (+ 7 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2779#(< (+ 7 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:06,813 INFO L290 TraceCheckUtils]: 18: Hoare triple {2795#(< (+ |ULTIMATE.start_main_~i~0#1| 8) ~N~0)} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2779#(< (+ 7 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:06,813 INFO L290 TraceCheckUtils]: 17: Hoare triple {2795#(< (+ |ULTIMATE.start_main_~i~0#1| 8) ~N~0)} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2795#(< (+ |ULTIMATE.start_main_~i~0#1| 8) ~N~0)} is VALID [2022-02-20 14:17:06,813 INFO L290 TraceCheckUtils]: 16: Hoare triple {2795#(< (+ |ULTIMATE.start_main_~i~0#1| 8) ~N~0)} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2795#(< (+ |ULTIMATE.start_main_~i~0#1| 8) ~N~0)} is VALID [2022-02-20 14:17:06,814 INFO L290 TraceCheckUtils]: 15: Hoare triple {2795#(< (+ |ULTIMATE.start_main_~i~0#1| 8) ~N~0)} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2795#(< (+ |ULTIMATE.start_main_~i~0#1| 8) ~N~0)} is VALID [2022-02-20 14:17:06,814 INFO L290 TraceCheckUtils]: 14: Hoare triple {2795#(< (+ |ULTIMATE.start_main_~i~0#1| 8) ~N~0)} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2795#(< (+ |ULTIMATE.start_main_~i~0#1| 8) ~N~0)} is VALID [2022-02-20 14:17:06,815 INFO L290 TraceCheckUtils]: 13: Hoare triple {2811#(< (+ 9 |ULTIMATE.start_main_~i~0#1|) ~N~0)} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2795#(< (+ |ULTIMATE.start_main_~i~0#1| 8) ~N~0)} is VALID [2022-02-20 14:17:06,815 INFO L290 TraceCheckUtils]: 12: Hoare triple {2811#(< (+ 9 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2811#(< (+ 9 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:06,816 INFO L290 TraceCheckUtils]: 11: Hoare triple {2811#(< (+ 9 |ULTIMATE.start_main_~i~0#1|) ~N~0)} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2811#(< (+ 9 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:06,816 INFO L290 TraceCheckUtils]: 10: Hoare triple {2811#(< (+ 9 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2811#(< (+ 9 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:06,816 INFO L290 TraceCheckUtils]: 9: Hoare triple {2811#(< (+ 9 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2811#(< (+ 9 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:06,817 INFO L290 TraceCheckUtils]: 8: Hoare triple {2827#(< (+ |ULTIMATE.start_main_~i~0#1| 10) ~N~0)} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2811#(< (+ 9 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:06,817 INFO L290 TraceCheckUtils]: 7: Hoare triple {2827#(< (+ |ULTIMATE.start_main_~i~0#1| 10) ~N~0)} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2827#(< (+ |ULTIMATE.start_main_~i~0#1| 10) ~N~0)} is VALID [2022-02-20 14:17:06,817 INFO L290 TraceCheckUtils]: 6: Hoare triple {2827#(< (+ |ULTIMATE.start_main_~i~0#1| 10) ~N~0)} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2827#(< (+ |ULTIMATE.start_main_~i~0#1| 10) ~N~0)} is VALID [2022-02-20 14:17:06,818 INFO L290 TraceCheckUtils]: 5: Hoare triple {2827#(< (+ |ULTIMATE.start_main_~i~0#1| 10) ~N~0)} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2827#(< (+ |ULTIMATE.start_main_~i~0#1| 10) ~N~0)} is VALID [2022-02-20 14:17:06,818 INFO L290 TraceCheckUtils]: 4: Hoare triple {2827#(< (+ |ULTIMATE.start_main_~i~0#1| 10) ~N~0)} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2827#(< (+ |ULTIMATE.start_main_~i~0#1| 10) ~N~0)} is VALID [2022-02-20 14:17:06,818 INFO L290 TraceCheckUtils]: 3: Hoare triple {2843#(< 10 ~N~0)} assume { :end_inline_assume_abort_if_not } true;main_~i~0#1 := 0; {2827#(< (+ |ULTIMATE.start_main_~i~0#1| 10) ~N~0)} is VALID [2022-02-20 14:17:06,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {2843#(< 10 ~N~0)} assume !(0 == assume_abort_if_not_~cond#1); {2843#(< 10 ~N~0)} is VALID [2022-02-20 14:17:06,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {2843#(< 10 ~N~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post5#1, main_#t~mem9#1, main_#t~post10#1, main_#t~post8#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~lim~0#1, main_~R~0#1;havoc main_~i~0#1;main_~j~0#1 := 0;main_~k~0#1 := 0;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~lim~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~R~0#1 := 1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if 0 < main_~lim~0#1 && main_~lim~0#1 % 4294967296 < (if ~N~0 % 4294967296 < 0 && 0 != ~N~0 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296) - 1 else 1 + ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296)) else ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296)) % 4294967296 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2843#(< 10 ~N~0)} is VALID [2022-02-20 14:17:06,820 INFO L290 TraceCheckUtils]: 0: Hoare triple {2428#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(30, 2);call #Ultimate.allocInit(12, 3);~N~0 := 1000000; {2843#(< 10 ~N~0)} is VALID [2022-02-20 14:17:06,820 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:17:06,821 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:17:06,821 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133063211] [2022-02-20 14:17:06,821 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:17:06,821 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304199553] [2022-02-20 14:17:06,821 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304199553] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:17:06,821 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:17:06,821 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2022-02-20 14:17:06,822 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971525545] [2022-02-20 14:17:06,822 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:17:06,822 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.576923076923077) internal successors, (119), 25 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2022-02-20 14:17:06,823 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:17:06,823 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 4.576923076923077) internal successors, (119), 25 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:17:06,944 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:17:06,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-02-20 14:17:06,944 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:17:06,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-02-20 14:17:06,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=347, Unknown=0, NotChecked=0, Total=650 [2022-02-20 14:17:06,945 INFO L87 Difference]: Start difference. First operand 76 states and 100 transitions. Second operand has 26 states, 26 states have (on average 4.576923076923077) internal successors, (119), 25 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:17:11,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:17:11,352 INFO L93 Difference]: Finished difference Result 568 states and 691 transitions. [2022-02-20 14:17:11,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-02-20 14:17:11,352 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.576923076923077) internal successors, (119), 25 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2022-02-20 14:17:11,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:17:11,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 4.576923076923077) internal successors, (119), 25 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:17:11,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 380 transitions. [2022-02-20 14:17:11,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 4.576923076923077) internal successors, (119), 25 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:17:11,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 380 transitions. [2022-02-20 14:17:11,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 380 transitions. [2022-02-20 14:17:11,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 380 edges. 380 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:17:11,785 INFO L225 Difference]: With dead ends: 568 [2022-02-20 14:17:11,785 INFO L226 Difference]: Without dead ends: 547 [2022-02-20 14:17:11,786 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=589, Invalid=743, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 14:17:11,787 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 1224 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1224 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 14:17:11,787 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1224 Valid, 205 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 14:17:11,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2022-02-20 14:17:11,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 136. [2022-02-20 14:17:11,886 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:17:11,886 INFO L82 GeneralOperation]: Start isEquivalent. First operand 547 states. Second operand has 136 states, 135 states have (on average 1.362962962962963) internal successors, (184), 135 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:17:11,887 INFO L74 IsIncluded]: Start isIncluded. First operand 547 states. Second operand has 136 states, 135 states have (on average 1.362962962962963) internal successors, (184), 135 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:17:11,887 INFO L87 Difference]: Start difference. First operand 547 states. Second operand has 136 states, 135 states have (on average 1.362962962962963) internal successors, (184), 135 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:17:11,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:17:11,905 INFO L93 Difference]: Finished difference Result 547 states and 655 transitions. [2022-02-20 14:17:11,905 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 655 transitions. [2022-02-20 14:17:11,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:17:11,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:17:11,907 INFO L74 IsIncluded]: Start isIncluded. First operand has 136 states, 135 states have (on average 1.362962962962963) internal successors, (184), 135 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 547 states. [2022-02-20 14:17:11,907 INFO L87 Difference]: Start difference. First operand has 136 states, 135 states have (on average 1.362962962962963) internal successors, (184), 135 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 547 states. [2022-02-20 14:17:11,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:17:11,926 INFO L93 Difference]: Finished difference Result 547 states and 655 transitions. [2022-02-20 14:17:11,926 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 655 transitions. [2022-02-20 14:17:11,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:17:11,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:17:11,927 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:17:11,927 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:17:11,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.362962962962963) internal successors, (184), 135 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:17:11,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 184 transitions. [2022-02-20 14:17:11,931 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 184 transitions. Word has length 67 [2022-02-20 14:17:11,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:17:11,932 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 184 transitions. [2022-02-20 14:17:11,932 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.576923076923077) internal successors, (119), 25 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:17:11,932 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 184 transitions. [2022-02-20 14:17:11,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-02-20 14:17:11,933 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:17:11,933 INFO L514 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:17:11,961 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:17:12,157 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:17:12,158 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:17:12,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:17:12,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1889532203, now seen corresponding path program 2 times [2022-02-20 14:17:12,159 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:17:12,159 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227694254] [2022-02-20 14:17:12,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:17:12,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:17:12,218 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:17:12,219 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1927441601] [2022-02-20 14:17:12,219 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:17:12,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:17:12,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:17:12,224 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:17:12,234 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:17:12,380 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:17:12,381 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:17:12,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 25 conjunts are in the unsatisfiable core [2022-02-20 14:17:12,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:17:12,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:17:16,053 INFO L290 TraceCheckUtils]: 0: Hoare triple {4790#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(30, 2);call #Ultimate.allocInit(12, 3);~N~0 := 1000000; {4795#(<= 1000000 ~N~0)} is VALID [2022-02-20 14:17:16,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {4795#(<= 1000000 ~N~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post5#1, main_#t~mem9#1, main_#t~post10#1, main_#t~post8#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~lim~0#1, main_~R~0#1;havoc main_~i~0#1;main_~j~0#1 := 0;main_~k~0#1 := 0;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~lim~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~R~0#1 := 1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if 0 < main_~lim~0#1 && main_~lim~0#1 % 4294967296 < (if ~N~0 % 4294967296 < 0 && 0 != ~N~0 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296) - 1 else 1 + ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296)) else ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296)) % 4294967296 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {4795#(<= 1000000 ~N~0)} is VALID [2022-02-20 14:17:16,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {4795#(<= 1000000 ~N~0)} assume !(0 == assume_abort_if_not_~cond#1); {4795#(<= 1000000 ~N~0)} is VALID [2022-02-20 14:17:16,054 INFO L290 TraceCheckUtils]: 3: Hoare triple {4795#(<= 1000000 ~N~0)} assume { :end_inline_assume_abort_if_not } true;main_~i~0#1 := 0; {4805#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,054 INFO L290 TraceCheckUtils]: 4: Hoare triple {4805#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000000 ~N~0))} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4805#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,055 INFO L290 TraceCheckUtils]: 5: Hoare triple {4805#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000000 ~N~0))} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4805#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,055 INFO L290 TraceCheckUtils]: 6: Hoare triple {4805#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000000 ~N~0))} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4805#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,056 INFO L290 TraceCheckUtils]: 7: Hoare triple {4805#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000000 ~N~0))} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {4805#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,057 INFO L290 TraceCheckUtils]: 8: Hoare triple {4805#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 1000000 ~N~0))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {4821#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:17:16,057 INFO L290 TraceCheckUtils]: 9: Hoare triple {4821#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4821#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:17:16,059 INFO L290 TraceCheckUtils]: 10: Hoare triple {4821#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4821#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:17:16,060 INFO L290 TraceCheckUtils]: 11: Hoare triple {4821#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4821#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:17:16,060 INFO L290 TraceCheckUtils]: 12: Hoare triple {4821#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {4821#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:17:16,061 INFO L290 TraceCheckUtils]: 13: Hoare triple {4821#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {4837#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,061 INFO L290 TraceCheckUtils]: 14: Hoare triple {4837#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1000000 ~N~0))} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4837#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,062 INFO L290 TraceCheckUtils]: 15: Hoare triple {4837#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1000000 ~N~0))} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4837#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,062 INFO L290 TraceCheckUtils]: 16: Hoare triple {4837#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1000000 ~N~0))} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4837#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,063 INFO L290 TraceCheckUtils]: 17: Hoare triple {4837#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1000000 ~N~0))} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {4837#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,063 INFO L290 TraceCheckUtils]: 18: Hoare triple {4837#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (<= 1000000 ~N~0))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {4853#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,064 INFO L290 TraceCheckUtils]: 19: Hoare triple {4853#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 1000000 ~N~0))} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4853#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,064 INFO L290 TraceCheckUtils]: 20: Hoare triple {4853#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 1000000 ~N~0))} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4853#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,065 INFO L290 TraceCheckUtils]: 21: Hoare triple {4853#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 1000000 ~N~0))} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4853#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,065 INFO L290 TraceCheckUtils]: 22: Hoare triple {4853#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 1000000 ~N~0))} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {4853#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,066 INFO L290 TraceCheckUtils]: 23: Hoare triple {4853#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 1000000 ~N~0))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {4869#(and (<= |ULTIMATE.start_main_~i~0#1| 4) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,066 INFO L290 TraceCheckUtils]: 24: Hoare triple {4869#(and (<= |ULTIMATE.start_main_~i~0#1| 4) (<= 1000000 ~N~0))} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4869#(and (<= |ULTIMATE.start_main_~i~0#1| 4) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,067 INFO L290 TraceCheckUtils]: 25: Hoare triple {4869#(and (<= |ULTIMATE.start_main_~i~0#1| 4) (<= 1000000 ~N~0))} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4869#(and (<= |ULTIMATE.start_main_~i~0#1| 4) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,068 INFO L290 TraceCheckUtils]: 26: Hoare triple {4869#(and (<= |ULTIMATE.start_main_~i~0#1| 4) (<= 1000000 ~N~0))} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4869#(and (<= |ULTIMATE.start_main_~i~0#1| 4) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,069 INFO L290 TraceCheckUtils]: 27: Hoare triple {4869#(and (<= |ULTIMATE.start_main_~i~0#1| 4) (<= 1000000 ~N~0))} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {4869#(and (<= |ULTIMATE.start_main_~i~0#1| 4) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,070 INFO L290 TraceCheckUtils]: 28: Hoare triple {4869#(and (<= |ULTIMATE.start_main_~i~0#1| 4) (<= 1000000 ~N~0))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {4885#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 5))} is VALID [2022-02-20 14:17:16,070 INFO L290 TraceCheckUtils]: 29: Hoare triple {4885#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 5))} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4885#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 5))} is VALID [2022-02-20 14:17:16,075 INFO L290 TraceCheckUtils]: 30: Hoare triple {4885#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 5))} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4885#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 5))} is VALID [2022-02-20 14:17:16,076 INFO L290 TraceCheckUtils]: 31: Hoare triple {4885#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 5))} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4885#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 5))} is VALID [2022-02-20 14:17:16,076 INFO L290 TraceCheckUtils]: 32: Hoare triple {4885#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 5))} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {4885#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 5))} is VALID [2022-02-20 14:17:16,077 INFO L290 TraceCheckUtils]: 33: Hoare triple {4885#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 5))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {4901#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 6))} is VALID [2022-02-20 14:17:16,078 INFO L290 TraceCheckUtils]: 34: Hoare triple {4901#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 6))} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4901#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 6))} is VALID [2022-02-20 14:17:16,078 INFO L290 TraceCheckUtils]: 35: Hoare triple {4901#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 6))} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4901#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 6))} is VALID [2022-02-20 14:17:16,080 INFO L290 TraceCheckUtils]: 36: Hoare triple {4901#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 6))} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4901#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 6))} is VALID [2022-02-20 14:17:16,081 INFO L290 TraceCheckUtils]: 37: Hoare triple {4901#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 6))} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {4901#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 6))} is VALID [2022-02-20 14:17:16,082 INFO L290 TraceCheckUtils]: 38: Hoare triple {4901#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 6))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {4917#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 7))} is VALID [2022-02-20 14:17:16,082 INFO L290 TraceCheckUtils]: 39: Hoare triple {4917#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 7))} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4917#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 7))} is VALID [2022-02-20 14:17:16,083 INFO L290 TraceCheckUtils]: 40: Hoare triple {4917#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 7))} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4917#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 7))} is VALID [2022-02-20 14:17:16,083 INFO L290 TraceCheckUtils]: 41: Hoare triple {4917#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 7))} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4917#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 7))} is VALID [2022-02-20 14:17:16,083 INFO L290 TraceCheckUtils]: 42: Hoare triple {4917#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 7))} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {4917#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 7))} is VALID [2022-02-20 14:17:16,084 INFO L290 TraceCheckUtils]: 43: Hoare triple {4917#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 7))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {4933#(and (<= |ULTIMATE.start_main_~i~0#1| 8) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,085 INFO L290 TraceCheckUtils]: 44: Hoare triple {4933#(and (<= |ULTIMATE.start_main_~i~0#1| 8) (<= 1000000 ~N~0))} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4933#(and (<= |ULTIMATE.start_main_~i~0#1| 8) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,085 INFO L290 TraceCheckUtils]: 45: Hoare triple {4933#(and (<= |ULTIMATE.start_main_~i~0#1| 8) (<= 1000000 ~N~0))} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4933#(and (<= |ULTIMATE.start_main_~i~0#1| 8) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,085 INFO L290 TraceCheckUtils]: 46: Hoare triple {4933#(and (<= |ULTIMATE.start_main_~i~0#1| 8) (<= 1000000 ~N~0))} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4933#(and (<= |ULTIMATE.start_main_~i~0#1| 8) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,086 INFO L290 TraceCheckUtils]: 47: Hoare triple {4933#(and (<= |ULTIMATE.start_main_~i~0#1| 8) (<= 1000000 ~N~0))} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {4933#(and (<= |ULTIMATE.start_main_~i~0#1| 8) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,087 INFO L290 TraceCheckUtils]: 48: Hoare triple {4933#(and (<= |ULTIMATE.start_main_~i~0#1| 8) (<= 1000000 ~N~0))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {4949#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 9))} is VALID [2022-02-20 14:17:16,087 INFO L290 TraceCheckUtils]: 49: Hoare triple {4949#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 9))} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4949#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 9))} is VALID [2022-02-20 14:17:16,088 INFO L290 TraceCheckUtils]: 50: Hoare triple {4949#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 9))} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4949#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 9))} is VALID [2022-02-20 14:17:16,088 INFO L290 TraceCheckUtils]: 51: Hoare triple {4949#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 9))} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4949#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 9))} is VALID [2022-02-20 14:17:16,088 INFO L290 TraceCheckUtils]: 52: Hoare triple {4949#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 9))} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {4949#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 9))} is VALID [2022-02-20 14:17:16,089 INFO L290 TraceCheckUtils]: 53: Hoare triple {4949#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 9))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {4965#(and (<= |ULTIMATE.start_main_~i~0#1| 10) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,089 INFO L290 TraceCheckUtils]: 54: Hoare triple {4965#(and (<= |ULTIMATE.start_main_~i~0#1| 10) (<= 1000000 ~N~0))} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4965#(and (<= |ULTIMATE.start_main_~i~0#1| 10) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,090 INFO L290 TraceCheckUtils]: 55: Hoare triple {4965#(and (<= |ULTIMATE.start_main_~i~0#1| 10) (<= 1000000 ~N~0))} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4965#(and (<= |ULTIMATE.start_main_~i~0#1| 10) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,090 INFO L290 TraceCheckUtils]: 56: Hoare triple {4965#(and (<= |ULTIMATE.start_main_~i~0#1| 10) (<= 1000000 ~N~0))} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4965#(and (<= |ULTIMATE.start_main_~i~0#1| 10) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,091 INFO L290 TraceCheckUtils]: 57: Hoare triple {4965#(and (<= |ULTIMATE.start_main_~i~0#1| 10) (<= 1000000 ~N~0))} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {4965#(and (<= |ULTIMATE.start_main_~i~0#1| 10) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,091 INFO L290 TraceCheckUtils]: 58: Hoare triple {4965#(and (<= |ULTIMATE.start_main_~i~0#1| 10) (<= 1000000 ~N~0))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {4981#(and (<= |ULTIMATE.start_main_~i~0#1| 11) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,092 INFO L290 TraceCheckUtils]: 59: Hoare triple {4981#(and (<= |ULTIMATE.start_main_~i~0#1| 11) (<= 1000000 ~N~0))} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4981#(and (<= |ULTIMATE.start_main_~i~0#1| 11) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,092 INFO L290 TraceCheckUtils]: 60: Hoare triple {4981#(and (<= |ULTIMATE.start_main_~i~0#1| 11) (<= 1000000 ~N~0))} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4981#(and (<= |ULTIMATE.start_main_~i~0#1| 11) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,093 INFO L290 TraceCheckUtils]: 61: Hoare triple {4981#(and (<= |ULTIMATE.start_main_~i~0#1| 11) (<= 1000000 ~N~0))} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4981#(and (<= |ULTIMATE.start_main_~i~0#1| 11) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,093 INFO L290 TraceCheckUtils]: 62: Hoare triple {4981#(and (<= |ULTIMATE.start_main_~i~0#1| 11) (<= 1000000 ~N~0))} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {4981#(and (<= |ULTIMATE.start_main_~i~0#1| 11) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,094 INFO L290 TraceCheckUtils]: 63: Hoare triple {4981#(and (<= |ULTIMATE.start_main_~i~0#1| 11) (<= 1000000 ~N~0))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {4997#(and (<= |ULTIMATE.start_main_~i~0#1| 12) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,094 INFO L290 TraceCheckUtils]: 64: Hoare triple {4997#(and (<= |ULTIMATE.start_main_~i~0#1| 12) (<= 1000000 ~N~0))} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4997#(and (<= |ULTIMATE.start_main_~i~0#1| 12) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,095 INFO L290 TraceCheckUtils]: 65: Hoare triple {4997#(and (<= |ULTIMATE.start_main_~i~0#1| 12) (<= 1000000 ~N~0))} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4997#(and (<= |ULTIMATE.start_main_~i~0#1| 12) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,095 INFO L290 TraceCheckUtils]: 66: Hoare triple {4997#(and (<= |ULTIMATE.start_main_~i~0#1| 12) (<= 1000000 ~N~0))} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4997#(and (<= |ULTIMATE.start_main_~i~0#1| 12) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,095 INFO L290 TraceCheckUtils]: 67: Hoare triple {4997#(and (<= |ULTIMATE.start_main_~i~0#1| 12) (<= 1000000 ~N~0))} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {4997#(and (<= |ULTIMATE.start_main_~i~0#1| 12) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,099 INFO L290 TraceCheckUtils]: 68: Hoare triple {4997#(and (<= |ULTIMATE.start_main_~i~0#1| 12) (<= 1000000 ~N~0))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {5013#(and (<= |ULTIMATE.start_main_~i~0#1| 13) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,099 INFO L290 TraceCheckUtils]: 69: Hoare triple {5013#(and (<= |ULTIMATE.start_main_~i~0#1| 13) (<= 1000000 ~N~0))} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5013#(and (<= |ULTIMATE.start_main_~i~0#1| 13) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,100 INFO L290 TraceCheckUtils]: 70: Hoare triple {5013#(and (<= |ULTIMATE.start_main_~i~0#1| 13) (<= 1000000 ~N~0))} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5013#(and (<= |ULTIMATE.start_main_~i~0#1| 13) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,100 INFO L290 TraceCheckUtils]: 71: Hoare triple {5013#(and (<= |ULTIMATE.start_main_~i~0#1| 13) (<= 1000000 ~N~0))} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5013#(and (<= |ULTIMATE.start_main_~i~0#1| 13) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,101 INFO L290 TraceCheckUtils]: 72: Hoare triple {5013#(and (<= |ULTIMATE.start_main_~i~0#1| 13) (<= 1000000 ~N~0))} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {5013#(and (<= |ULTIMATE.start_main_~i~0#1| 13) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,101 INFO L290 TraceCheckUtils]: 73: Hoare triple {5013#(and (<= |ULTIMATE.start_main_~i~0#1| 13) (<= 1000000 ~N~0))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {5029#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 14))} is VALID [2022-02-20 14:17:16,102 INFO L290 TraceCheckUtils]: 74: Hoare triple {5029#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 14))} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5029#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 14))} is VALID [2022-02-20 14:17:16,102 INFO L290 TraceCheckUtils]: 75: Hoare triple {5029#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 14))} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5029#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 14))} is VALID [2022-02-20 14:17:16,103 INFO L290 TraceCheckUtils]: 76: Hoare triple {5029#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 14))} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5029#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 14))} is VALID [2022-02-20 14:17:16,103 INFO L290 TraceCheckUtils]: 77: Hoare triple {5029#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 14))} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {5029#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 14))} is VALID [2022-02-20 14:17:16,104 INFO L290 TraceCheckUtils]: 78: Hoare triple {5029#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 14))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {5045#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 15))} is VALID [2022-02-20 14:17:16,105 INFO L290 TraceCheckUtils]: 79: Hoare triple {5045#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 15))} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5045#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 15))} is VALID [2022-02-20 14:17:16,105 INFO L290 TraceCheckUtils]: 80: Hoare triple {5045#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 15))} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5045#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 15))} is VALID [2022-02-20 14:17:16,105 INFO L290 TraceCheckUtils]: 81: Hoare triple {5045#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 15))} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5045#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 15))} is VALID [2022-02-20 14:17:16,106 INFO L290 TraceCheckUtils]: 82: Hoare triple {5045#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 15))} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {5045#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 15))} is VALID [2022-02-20 14:17:16,107 INFO L290 TraceCheckUtils]: 83: Hoare triple {5045#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 15))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {5061#(and (<= |ULTIMATE.start_main_~i~0#1| 16) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,107 INFO L290 TraceCheckUtils]: 84: Hoare triple {5061#(and (<= |ULTIMATE.start_main_~i~0#1| 16) (<= 1000000 ~N~0))} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5061#(and (<= |ULTIMATE.start_main_~i~0#1| 16) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,107 INFO L290 TraceCheckUtils]: 85: Hoare triple {5061#(and (<= |ULTIMATE.start_main_~i~0#1| 16) (<= 1000000 ~N~0))} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5061#(and (<= |ULTIMATE.start_main_~i~0#1| 16) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,108 INFO L290 TraceCheckUtils]: 86: Hoare triple {5061#(and (<= |ULTIMATE.start_main_~i~0#1| 16) (<= 1000000 ~N~0))} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5061#(and (<= |ULTIMATE.start_main_~i~0#1| 16) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,108 INFO L290 TraceCheckUtils]: 87: Hoare triple {5061#(and (<= |ULTIMATE.start_main_~i~0#1| 16) (<= 1000000 ~N~0))} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {5061#(and (<= |ULTIMATE.start_main_~i~0#1| 16) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,109 INFO L290 TraceCheckUtils]: 88: Hoare triple {5061#(and (<= |ULTIMATE.start_main_~i~0#1| 16) (<= 1000000 ~N~0))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {5077#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 17))} is VALID [2022-02-20 14:17:16,109 INFO L290 TraceCheckUtils]: 89: Hoare triple {5077#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 17))} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5077#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 17))} is VALID [2022-02-20 14:17:16,110 INFO L290 TraceCheckUtils]: 90: Hoare triple {5077#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 17))} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5077#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 17))} is VALID [2022-02-20 14:17:16,111 INFO L290 TraceCheckUtils]: 91: Hoare triple {5077#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 17))} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5077#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 17))} is VALID [2022-02-20 14:17:16,111 INFO L290 TraceCheckUtils]: 92: Hoare triple {5077#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 17))} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {5077#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 17))} is VALID [2022-02-20 14:17:16,112 INFO L290 TraceCheckUtils]: 93: Hoare triple {5077#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 17))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {5093#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 18))} is VALID [2022-02-20 14:17:16,112 INFO L290 TraceCheckUtils]: 94: Hoare triple {5093#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 18))} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5093#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 18))} is VALID [2022-02-20 14:17:16,113 INFO L290 TraceCheckUtils]: 95: Hoare triple {5093#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 18))} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5093#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 18))} is VALID [2022-02-20 14:17:16,114 INFO L290 TraceCheckUtils]: 96: Hoare triple {5093#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 18))} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5093#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 18))} is VALID [2022-02-20 14:17:16,115 INFO L290 TraceCheckUtils]: 97: Hoare triple {5093#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 18))} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {5093#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 18))} is VALID [2022-02-20 14:17:16,115 INFO L290 TraceCheckUtils]: 98: Hoare triple {5093#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 18))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {5109#(and (<= |ULTIMATE.start_main_~i~0#1| 19) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,116 INFO L290 TraceCheckUtils]: 99: Hoare triple {5109#(and (<= |ULTIMATE.start_main_~i~0#1| 19) (<= 1000000 ~N~0))} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5109#(and (<= |ULTIMATE.start_main_~i~0#1| 19) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,116 INFO L290 TraceCheckUtils]: 100: Hoare triple {5109#(and (<= |ULTIMATE.start_main_~i~0#1| 19) (<= 1000000 ~N~0))} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5109#(and (<= |ULTIMATE.start_main_~i~0#1| 19) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,117 INFO L290 TraceCheckUtils]: 101: Hoare triple {5109#(and (<= |ULTIMATE.start_main_~i~0#1| 19) (<= 1000000 ~N~0))} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5109#(and (<= |ULTIMATE.start_main_~i~0#1| 19) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,117 INFO L290 TraceCheckUtils]: 102: Hoare triple {5109#(and (<= |ULTIMATE.start_main_~i~0#1| 19) (<= 1000000 ~N~0))} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {5109#(and (<= |ULTIMATE.start_main_~i~0#1| 19) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,118 INFO L290 TraceCheckUtils]: 103: Hoare triple {5109#(and (<= |ULTIMATE.start_main_~i~0#1| 19) (<= 1000000 ~N~0))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {5125#(and (<= |ULTIMATE.start_main_~i~0#1| 20) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,118 INFO L290 TraceCheckUtils]: 104: Hoare triple {5125#(and (<= |ULTIMATE.start_main_~i~0#1| 20) (<= 1000000 ~N~0))} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5125#(and (<= |ULTIMATE.start_main_~i~0#1| 20) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,119 INFO L290 TraceCheckUtils]: 105: Hoare triple {5125#(and (<= |ULTIMATE.start_main_~i~0#1| 20) (<= 1000000 ~N~0))} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5125#(and (<= |ULTIMATE.start_main_~i~0#1| 20) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,119 INFO L290 TraceCheckUtils]: 106: Hoare triple {5125#(and (<= |ULTIMATE.start_main_~i~0#1| 20) (<= 1000000 ~N~0))} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5125#(and (<= |ULTIMATE.start_main_~i~0#1| 20) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,119 INFO L290 TraceCheckUtils]: 107: Hoare triple {5125#(and (<= |ULTIMATE.start_main_~i~0#1| 20) (<= 1000000 ~N~0))} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {5125#(and (<= |ULTIMATE.start_main_~i~0#1| 20) (<= 1000000 ~N~0))} is VALID [2022-02-20 14:17:16,120 INFO L290 TraceCheckUtils]: 108: Hoare triple {5125#(and (<= |ULTIMATE.start_main_~i~0#1| 20) (<= 1000000 ~N~0))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {5141#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 21))} is VALID [2022-02-20 14:17:16,121 INFO L290 TraceCheckUtils]: 109: Hoare triple {5141#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 21))} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5141#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 21))} is VALID [2022-02-20 14:17:16,121 INFO L290 TraceCheckUtils]: 110: Hoare triple {5141#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 21))} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5141#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 21))} is VALID [2022-02-20 14:17:16,121 INFO L290 TraceCheckUtils]: 111: Hoare triple {5141#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 21))} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5141#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 21))} is VALID [2022-02-20 14:17:16,122 INFO L290 TraceCheckUtils]: 112: Hoare triple {5141#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 21))} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {5141#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 21))} is VALID [2022-02-20 14:17:16,123 INFO L290 TraceCheckUtils]: 113: Hoare triple {5141#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 21))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {5157#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 22))} is VALID [2022-02-20 14:17:16,123 INFO L290 TraceCheckUtils]: 114: Hoare triple {5157#(and (<= 1000000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 22))} assume !(main_~i~0#1 < ~N~0); {4791#false} is VALID [2022-02-20 14:17:16,123 INFO L290 TraceCheckUtils]: 115: Hoare triple {4791#false} main_~i~0#1 := 0; {4791#false} is VALID [2022-02-20 14:17:16,123 INFO L290 TraceCheckUtils]: 116: Hoare triple {4791#false} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem9#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4791#false} is VALID [2022-02-20 14:17:16,123 INFO L290 TraceCheckUtils]: 117: Hoare triple {4791#false} assume 0 == main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {4791#false} is VALID [2022-02-20 14:17:16,124 INFO L290 TraceCheckUtils]: 118: Hoare triple {4791#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 % 4294967296 < (if ~N~0 % 4294967296 < 0 && 0 != ~N~0 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296) - 1 else 1 + ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296)) else ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296)) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {4791#false} is VALID [2022-02-20 14:17:16,124 INFO L290 TraceCheckUtils]: 119: Hoare triple {4791#false} assume !(0 == __VERIFIER_assert_~cond#1); {4791#false} is VALID [2022-02-20 14:17:16,124 INFO L290 TraceCheckUtils]: 120: Hoare triple {4791#false} assume { :end_inline___VERIFIER_assert } true; {4791#false} is VALID [2022-02-20 14:17:16,124 INFO L290 TraceCheckUtils]: 121: Hoare triple {4791#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {4791#false} is VALID [2022-02-20 14:17:16,124 INFO L290 TraceCheckUtils]: 122: Hoare triple {4791#false} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem9#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4791#false} is VALID [2022-02-20 14:17:16,124 INFO L290 TraceCheckUtils]: 123: Hoare triple {4791#false} assume 0 == main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {4791#false} is VALID [2022-02-20 14:17:16,124 INFO L290 TraceCheckUtils]: 124: Hoare triple {4791#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 % 4294967296 < (if ~N~0 % 4294967296 < 0 && 0 != ~N~0 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296) - 1 else 1 + ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296)) else ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296)) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {4791#false} is VALID [2022-02-20 14:17:16,124 INFO L290 TraceCheckUtils]: 125: Hoare triple {4791#false} assume 0 == __VERIFIER_assert_~cond#1; {4791#false} is VALID [2022-02-20 14:17:16,124 INFO L290 TraceCheckUtils]: 126: Hoare triple {4791#false} assume !false; {4791#false} is VALID [2022-02-20 14:17:16,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1181 backedges. 0 proven. 1177 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:17:16,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:17:19,325 INFO L290 TraceCheckUtils]: 126: Hoare triple {4791#false} assume !false; {4791#false} is VALID [2022-02-20 14:17:19,326 INFO L290 TraceCheckUtils]: 125: Hoare triple {4791#false} assume 0 == __VERIFIER_assert_~cond#1; {4791#false} is VALID [2022-02-20 14:17:19,326 INFO L290 TraceCheckUtils]: 124: Hoare triple {4791#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 % 4294967296 < (if ~N~0 % 4294967296 < 0 && 0 != ~N~0 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296) - 1 else 1 + ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296)) else ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296)) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {4791#false} is VALID [2022-02-20 14:17:19,326 INFO L290 TraceCheckUtils]: 123: Hoare triple {4791#false} assume 0 == main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {4791#false} is VALID [2022-02-20 14:17:19,326 INFO L290 TraceCheckUtils]: 122: Hoare triple {4791#false} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem9#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4791#false} is VALID [2022-02-20 14:17:19,326 INFO L290 TraceCheckUtils]: 121: Hoare triple {4791#false} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {4791#false} is VALID [2022-02-20 14:17:19,326 INFO L290 TraceCheckUtils]: 120: Hoare triple {4791#false} assume { :end_inline___VERIFIER_assert } true; {4791#false} is VALID [2022-02-20 14:17:19,326 INFO L290 TraceCheckUtils]: 119: Hoare triple {4791#false} assume !(0 == __VERIFIER_assert_~cond#1); {4791#false} is VALID [2022-02-20 14:17:19,326 INFO L290 TraceCheckUtils]: 118: Hoare triple {4791#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 % 4294967296 < (if ~N~0 % 4294967296 < 0 && 0 != ~N~0 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296) - 1 else 1 + ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296)) else ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296)) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {4791#false} is VALID [2022-02-20 14:17:19,326 INFO L290 TraceCheckUtils]: 117: Hoare triple {4791#false} assume 0 == main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {4791#false} is VALID [2022-02-20 14:17:19,326 INFO L290 TraceCheckUtils]: 116: Hoare triple {4791#false} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem9#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4791#false} is VALID [2022-02-20 14:17:19,326 INFO L290 TraceCheckUtils]: 115: Hoare triple {4791#false} main_~i~0#1 := 0; {4791#false} is VALID [2022-02-20 14:17:19,327 INFO L290 TraceCheckUtils]: 114: Hoare triple {5233#(< |ULTIMATE.start_main_~i~0#1| ~N~0)} assume !(main_~i~0#1 < ~N~0); {4791#false} is VALID [2022-02-20 14:17:19,328 INFO L290 TraceCheckUtils]: 113: Hoare triple {5237#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {5233#(< |ULTIMATE.start_main_~i~0#1| ~N~0)} is VALID [2022-02-20 14:17:19,328 INFO L290 TraceCheckUtils]: 112: Hoare triple {5237#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {5237#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} is VALID [2022-02-20 14:17:19,329 INFO L290 TraceCheckUtils]: 111: Hoare triple {5237#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5237#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} is VALID [2022-02-20 14:17:19,329 INFO L290 TraceCheckUtils]: 110: Hoare triple {5237#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5237#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} is VALID [2022-02-20 14:17:19,329 INFO L290 TraceCheckUtils]: 109: Hoare triple {5237#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5237#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} is VALID [2022-02-20 14:17:19,330 INFO L290 TraceCheckUtils]: 108: Hoare triple {5253#(< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0)} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {5237#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} is VALID [2022-02-20 14:17:19,330 INFO L290 TraceCheckUtils]: 107: Hoare triple {5253#(< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {5253#(< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:19,331 INFO L290 TraceCheckUtils]: 106: Hoare triple {5253#(< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0)} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5253#(< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:19,331 INFO L290 TraceCheckUtils]: 105: Hoare triple {5253#(< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5253#(< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:19,332 INFO L290 TraceCheckUtils]: 104: Hoare triple {5253#(< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5253#(< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:19,333 INFO L290 TraceCheckUtils]: 103: Hoare triple {5269#(< (+ 3 |ULTIMATE.start_main_~i~0#1|) ~N~0)} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {5253#(< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:19,333 INFO L290 TraceCheckUtils]: 102: Hoare triple {5269#(< (+ 3 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {5269#(< (+ 3 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:19,334 INFO L290 TraceCheckUtils]: 101: Hoare triple {5269#(< (+ 3 |ULTIMATE.start_main_~i~0#1|) ~N~0)} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5269#(< (+ 3 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:19,334 INFO L290 TraceCheckUtils]: 100: Hoare triple {5269#(< (+ 3 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5269#(< (+ 3 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:19,335 INFO L290 TraceCheckUtils]: 99: Hoare triple {5269#(< (+ 3 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5269#(< (+ 3 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:19,336 INFO L290 TraceCheckUtils]: 98: Hoare triple {5285#(< (+ |ULTIMATE.start_main_~i~0#1| 4) ~N~0)} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {5269#(< (+ 3 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:19,336 INFO L290 TraceCheckUtils]: 97: Hoare triple {5285#(< (+ |ULTIMATE.start_main_~i~0#1| 4) ~N~0)} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {5285#(< (+ |ULTIMATE.start_main_~i~0#1| 4) ~N~0)} is VALID [2022-02-20 14:17:19,336 INFO L290 TraceCheckUtils]: 96: Hoare triple {5285#(< (+ |ULTIMATE.start_main_~i~0#1| 4) ~N~0)} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5285#(< (+ |ULTIMATE.start_main_~i~0#1| 4) ~N~0)} is VALID [2022-02-20 14:17:19,337 INFO L290 TraceCheckUtils]: 95: Hoare triple {5285#(< (+ |ULTIMATE.start_main_~i~0#1| 4) ~N~0)} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5285#(< (+ |ULTIMATE.start_main_~i~0#1| 4) ~N~0)} is VALID [2022-02-20 14:17:19,337 INFO L290 TraceCheckUtils]: 94: Hoare triple {5285#(< (+ |ULTIMATE.start_main_~i~0#1| 4) ~N~0)} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5285#(< (+ |ULTIMATE.start_main_~i~0#1| 4) ~N~0)} is VALID [2022-02-20 14:17:19,338 INFO L290 TraceCheckUtils]: 93: Hoare triple {5301#(< (+ 5 |ULTIMATE.start_main_~i~0#1|) ~N~0)} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {5285#(< (+ |ULTIMATE.start_main_~i~0#1| 4) ~N~0)} is VALID [2022-02-20 14:17:19,339 INFO L290 TraceCheckUtils]: 92: Hoare triple {5301#(< (+ 5 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {5301#(< (+ 5 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:19,339 INFO L290 TraceCheckUtils]: 91: Hoare triple {5301#(< (+ 5 |ULTIMATE.start_main_~i~0#1|) ~N~0)} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5301#(< (+ 5 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:19,339 INFO L290 TraceCheckUtils]: 90: Hoare triple {5301#(< (+ 5 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5301#(< (+ 5 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:19,340 INFO L290 TraceCheckUtils]: 89: Hoare triple {5301#(< (+ 5 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5301#(< (+ 5 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:19,341 INFO L290 TraceCheckUtils]: 88: Hoare triple {5317#(< (+ 6 |ULTIMATE.start_main_~i~0#1|) ~N~0)} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {5301#(< (+ 5 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:19,341 INFO L290 TraceCheckUtils]: 87: Hoare triple {5317#(< (+ 6 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {5317#(< (+ 6 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:19,341 INFO L290 TraceCheckUtils]: 86: Hoare triple {5317#(< (+ 6 |ULTIMATE.start_main_~i~0#1|) ~N~0)} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5317#(< (+ 6 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:19,341 INFO L290 TraceCheckUtils]: 85: Hoare triple {5317#(< (+ 6 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5317#(< (+ 6 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:19,342 INFO L290 TraceCheckUtils]: 84: Hoare triple {5317#(< (+ 6 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5317#(< (+ 6 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:19,343 INFO L290 TraceCheckUtils]: 83: Hoare triple {5333#(< (+ 7 |ULTIMATE.start_main_~i~0#1|) ~N~0)} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {5317#(< (+ 6 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:19,343 INFO L290 TraceCheckUtils]: 82: Hoare triple {5333#(< (+ 7 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {5333#(< (+ 7 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:19,343 INFO L290 TraceCheckUtils]: 81: Hoare triple {5333#(< (+ 7 |ULTIMATE.start_main_~i~0#1|) ~N~0)} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5333#(< (+ 7 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:19,343 INFO L290 TraceCheckUtils]: 80: Hoare triple {5333#(< (+ 7 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5333#(< (+ 7 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:19,344 INFO L290 TraceCheckUtils]: 79: Hoare triple {5333#(< (+ 7 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5333#(< (+ 7 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:19,345 INFO L290 TraceCheckUtils]: 78: Hoare triple {5349#(< (+ |ULTIMATE.start_main_~i~0#1| 8) ~N~0)} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {5333#(< (+ 7 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:19,345 INFO L290 TraceCheckUtils]: 77: Hoare triple {5349#(< (+ |ULTIMATE.start_main_~i~0#1| 8) ~N~0)} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {5349#(< (+ |ULTIMATE.start_main_~i~0#1| 8) ~N~0)} is VALID [2022-02-20 14:17:19,345 INFO L290 TraceCheckUtils]: 76: Hoare triple {5349#(< (+ |ULTIMATE.start_main_~i~0#1| 8) ~N~0)} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5349#(< (+ |ULTIMATE.start_main_~i~0#1| 8) ~N~0)} is VALID [2022-02-20 14:17:19,346 INFO L290 TraceCheckUtils]: 75: Hoare triple {5349#(< (+ |ULTIMATE.start_main_~i~0#1| 8) ~N~0)} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5349#(< (+ |ULTIMATE.start_main_~i~0#1| 8) ~N~0)} is VALID [2022-02-20 14:17:19,346 INFO L290 TraceCheckUtils]: 74: Hoare triple {5349#(< (+ |ULTIMATE.start_main_~i~0#1| 8) ~N~0)} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5349#(< (+ |ULTIMATE.start_main_~i~0#1| 8) ~N~0)} is VALID [2022-02-20 14:17:19,347 INFO L290 TraceCheckUtils]: 73: Hoare triple {5365#(< (+ 9 |ULTIMATE.start_main_~i~0#1|) ~N~0)} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {5349#(< (+ |ULTIMATE.start_main_~i~0#1| 8) ~N~0)} is VALID [2022-02-20 14:17:19,347 INFO L290 TraceCheckUtils]: 72: Hoare triple {5365#(< (+ 9 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {5365#(< (+ 9 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:19,348 INFO L290 TraceCheckUtils]: 71: Hoare triple {5365#(< (+ 9 |ULTIMATE.start_main_~i~0#1|) ~N~0)} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5365#(< (+ 9 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:19,348 INFO L290 TraceCheckUtils]: 70: Hoare triple {5365#(< (+ 9 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5365#(< (+ 9 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:19,348 INFO L290 TraceCheckUtils]: 69: Hoare triple {5365#(< (+ 9 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5365#(< (+ 9 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:19,349 INFO L290 TraceCheckUtils]: 68: Hoare triple {5381#(< (+ |ULTIMATE.start_main_~i~0#1| 10) ~N~0)} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {5365#(< (+ 9 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:19,349 INFO L290 TraceCheckUtils]: 67: Hoare triple {5381#(< (+ |ULTIMATE.start_main_~i~0#1| 10) ~N~0)} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {5381#(< (+ |ULTIMATE.start_main_~i~0#1| 10) ~N~0)} is VALID [2022-02-20 14:17:19,349 INFO L290 TraceCheckUtils]: 66: Hoare triple {5381#(< (+ |ULTIMATE.start_main_~i~0#1| 10) ~N~0)} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5381#(< (+ |ULTIMATE.start_main_~i~0#1| 10) ~N~0)} is VALID [2022-02-20 14:17:19,350 INFO L290 TraceCheckUtils]: 65: Hoare triple {5381#(< (+ |ULTIMATE.start_main_~i~0#1| 10) ~N~0)} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5381#(< (+ |ULTIMATE.start_main_~i~0#1| 10) ~N~0)} is VALID [2022-02-20 14:17:19,350 INFO L290 TraceCheckUtils]: 64: Hoare triple {5381#(< (+ |ULTIMATE.start_main_~i~0#1| 10) ~N~0)} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5381#(< (+ |ULTIMATE.start_main_~i~0#1| 10) ~N~0)} is VALID [2022-02-20 14:17:19,351 INFO L290 TraceCheckUtils]: 63: Hoare triple {5397#(< (+ |ULTIMATE.start_main_~i~0#1| 11) ~N~0)} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {5381#(< (+ |ULTIMATE.start_main_~i~0#1| 10) ~N~0)} is VALID [2022-02-20 14:17:19,351 INFO L290 TraceCheckUtils]: 62: Hoare triple {5397#(< (+ |ULTIMATE.start_main_~i~0#1| 11) ~N~0)} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {5397#(< (+ |ULTIMATE.start_main_~i~0#1| 11) ~N~0)} is VALID [2022-02-20 14:17:19,351 INFO L290 TraceCheckUtils]: 61: Hoare triple {5397#(< (+ |ULTIMATE.start_main_~i~0#1| 11) ~N~0)} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5397#(< (+ |ULTIMATE.start_main_~i~0#1| 11) ~N~0)} is VALID [2022-02-20 14:17:19,352 INFO L290 TraceCheckUtils]: 60: Hoare triple {5397#(< (+ |ULTIMATE.start_main_~i~0#1| 11) ~N~0)} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5397#(< (+ |ULTIMATE.start_main_~i~0#1| 11) ~N~0)} is VALID [2022-02-20 14:17:19,352 INFO L290 TraceCheckUtils]: 59: Hoare triple {5397#(< (+ |ULTIMATE.start_main_~i~0#1| 11) ~N~0)} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5397#(< (+ |ULTIMATE.start_main_~i~0#1| 11) ~N~0)} is VALID [2022-02-20 14:17:19,353 INFO L290 TraceCheckUtils]: 58: Hoare triple {5413#(< (+ |ULTIMATE.start_main_~i~0#1| 12) ~N~0)} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {5397#(< (+ |ULTIMATE.start_main_~i~0#1| 11) ~N~0)} is VALID [2022-02-20 14:17:19,353 INFO L290 TraceCheckUtils]: 57: Hoare triple {5413#(< (+ |ULTIMATE.start_main_~i~0#1| 12) ~N~0)} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {5413#(< (+ |ULTIMATE.start_main_~i~0#1| 12) ~N~0)} is VALID [2022-02-20 14:17:19,353 INFO L290 TraceCheckUtils]: 56: Hoare triple {5413#(< (+ |ULTIMATE.start_main_~i~0#1| 12) ~N~0)} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5413#(< (+ |ULTIMATE.start_main_~i~0#1| 12) ~N~0)} is VALID [2022-02-20 14:17:19,354 INFO L290 TraceCheckUtils]: 55: Hoare triple {5413#(< (+ |ULTIMATE.start_main_~i~0#1| 12) ~N~0)} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5413#(< (+ |ULTIMATE.start_main_~i~0#1| 12) ~N~0)} is VALID [2022-02-20 14:17:19,354 INFO L290 TraceCheckUtils]: 54: Hoare triple {5413#(< (+ |ULTIMATE.start_main_~i~0#1| 12) ~N~0)} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5413#(< (+ |ULTIMATE.start_main_~i~0#1| 12) ~N~0)} is VALID [2022-02-20 14:17:19,355 INFO L290 TraceCheckUtils]: 53: Hoare triple {5429#(< (+ |ULTIMATE.start_main_~i~0#1| 13) ~N~0)} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {5413#(< (+ |ULTIMATE.start_main_~i~0#1| 12) ~N~0)} is VALID [2022-02-20 14:17:19,355 INFO L290 TraceCheckUtils]: 52: Hoare triple {5429#(< (+ |ULTIMATE.start_main_~i~0#1| 13) ~N~0)} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {5429#(< (+ |ULTIMATE.start_main_~i~0#1| 13) ~N~0)} is VALID [2022-02-20 14:17:19,356 INFO L290 TraceCheckUtils]: 51: Hoare triple {5429#(< (+ |ULTIMATE.start_main_~i~0#1| 13) ~N~0)} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5429#(< (+ |ULTIMATE.start_main_~i~0#1| 13) ~N~0)} is VALID [2022-02-20 14:17:19,356 INFO L290 TraceCheckUtils]: 50: Hoare triple {5429#(< (+ |ULTIMATE.start_main_~i~0#1| 13) ~N~0)} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5429#(< (+ |ULTIMATE.start_main_~i~0#1| 13) ~N~0)} is VALID [2022-02-20 14:17:19,356 INFO L290 TraceCheckUtils]: 49: Hoare triple {5429#(< (+ |ULTIMATE.start_main_~i~0#1| 13) ~N~0)} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5429#(< (+ |ULTIMATE.start_main_~i~0#1| 13) ~N~0)} is VALID [2022-02-20 14:17:19,357 INFO L290 TraceCheckUtils]: 48: Hoare triple {5445#(< (+ 14 |ULTIMATE.start_main_~i~0#1|) ~N~0)} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {5429#(< (+ |ULTIMATE.start_main_~i~0#1| 13) ~N~0)} is VALID [2022-02-20 14:17:19,357 INFO L290 TraceCheckUtils]: 47: Hoare triple {5445#(< (+ 14 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {5445#(< (+ 14 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:19,357 INFO L290 TraceCheckUtils]: 46: Hoare triple {5445#(< (+ 14 |ULTIMATE.start_main_~i~0#1|) ~N~0)} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5445#(< (+ 14 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:19,358 INFO L290 TraceCheckUtils]: 45: Hoare triple {5445#(< (+ 14 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5445#(< (+ 14 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:19,358 INFO L290 TraceCheckUtils]: 44: Hoare triple {5445#(< (+ 14 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5445#(< (+ 14 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:19,359 INFO L290 TraceCheckUtils]: 43: Hoare triple {5461#(< (+ |ULTIMATE.start_main_~i~0#1| 15) ~N~0)} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {5445#(< (+ 14 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:19,359 INFO L290 TraceCheckUtils]: 42: Hoare triple {5461#(< (+ |ULTIMATE.start_main_~i~0#1| 15) ~N~0)} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {5461#(< (+ |ULTIMATE.start_main_~i~0#1| 15) ~N~0)} is VALID [2022-02-20 14:17:19,360 INFO L290 TraceCheckUtils]: 41: Hoare triple {5461#(< (+ |ULTIMATE.start_main_~i~0#1| 15) ~N~0)} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5461#(< (+ |ULTIMATE.start_main_~i~0#1| 15) ~N~0)} is VALID [2022-02-20 14:17:19,360 INFO L290 TraceCheckUtils]: 40: Hoare triple {5461#(< (+ |ULTIMATE.start_main_~i~0#1| 15) ~N~0)} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5461#(< (+ |ULTIMATE.start_main_~i~0#1| 15) ~N~0)} is VALID [2022-02-20 14:17:19,360 INFO L290 TraceCheckUtils]: 39: Hoare triple {5461#(< (+ |ULTIMATE.start_main_~i~0#1| 15) ~N~0)} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5461#(< (+ |ULTIMATE.start_main_~i~0#1| 15) ~N~0)} is VALID [2022-02-20 14:17:19,361 INFO L290 TraceCheckUtils]: 38: Hoare triple {5477#(< (+ 16 |ULTIMATE.start_main_~i~0#1|) ~N~0)} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {5461#(< (+ |ULTIMATE.start_main_~i~0#1| 15) ~N~0)} is VALID [2022-02-20 14:17:19,362 INFO L290 TraceCheckUtils]: 37: Hoare triple {5477#(< (+ 16 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {5477#(< (+ 16 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:19,362 INFO L290 TraceCheckUtils]: 36: Hoare triple {5477#(< (+ 16 |ULTIMATE.start_main_~i~0#1|) ~N~0)} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5477#(< (+ 16 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:19,362 INFO L290 TraceCheckUtils]: 35: Hoare triple {5477#(< (+ 16 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5477#(< (+ 16 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:19,362 INFO L290 TraceCheckUtils]: 34: Hoare triple {5477#(< (+ 16 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5477#(< (+ 16 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:19,363 INFO L290 TraceCheckUtils]: 33: Hoare triple {5493#(< (+ |ULTIMATE.start_main_~i~0#1| 17) ~N~0)} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {5477#(< (+ 16 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:19,364 INFO L290 TraceCheckUtils]: 32: Hoare triple {5493#(< (+ |ULTIMATE.start_main_~i~0#1| 17) ~N~0)} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {5493#(< (+ |ULTIMATE.start_main_~i~0#1| 17) ~N~0)} is VALID [2022-02-20 14:17:19,364 INFO L290 TraceCheckUtils]: 31: Hoare triple {5493#(< (+ |ULTIMATE.start_main_~i~0#1| 17) ~N~0)} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5493#(< (+ |ULTIMATE.start_main_~i~0#1| 17) ~N~0)} is VALID [2022-02-20 14:17:19,364 INFO L290 TraceCheckUtils]: 30: Hoare triple {5493#(< (+ |ULTIMATE.start_main_~i~0#1| 17) ~N~0)} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5493#(< (+ |ULTIMATE.start_main_~i~0#1| 17) ~N~0)} is VALID [2022-02-20 14:17:19,377 INFO L290 TraceCheckUtils]: 29: Hoare triple {5493#(< (+ |ULTIMATE.start_main_~i~0#1| 17) ~N~0)} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5493#(< (+ |ULTIMATE.start_main_~i~0#1| 17) ~N~0)} is VALID [2022-02-20 14:17:19,379 INFO L290 TraceCheckUtils]: 28: Hoare triple {5509#(< (+ |ULTIMATE.start_main_~i~0#1| 18) ~N~0)} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {5493#(< (+ |ULTIMATE.start_main_~i~0#1| 17) ~N~0)} is VALID [2022-02-20 14:17:19,379 INFO L290 TraceCheckUtils]: 27: Hoare triple {5509#(< (+ |ULTIMATE.start_main_~i~0#1| 18) ~N~0)} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {5509#(< (+ |ULTIMATE.start_main_~i~0#1| 18) ~N~0)} is VALID [2022-02-20 14:17:19,380 INFO L290 TraceCheckUtils]: 26: Hoare triple {5509#(< (+ |ULTIMATE.start_main_~i~0#1| 18) ~N~0)} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5509#(< (+ |ULTIMATE.start_main_~i~0#1| 18) ~N~0)} is VALID [2022-02-20 14:17:19,380 INFO L290 TraceCheckUtils]: 25: Hoare triple {5509#(< (+ |ULTIMATE.start_main_~i~0#1| 18) ~N~0)} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5509#(< (+ |ULTIMATE.start_main_~i~0#1| 18) ~N~0)} is VALID [2022-02-20 14:17:19,380 INFO L290 TraceCheckUtils]: 24: Hoare triple {5509#(< (+ |ULTIMATE.start_main_~i~0#1| 18) ~N~0)} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5509#(< (+ |ULTIMATE.start_main_~i~0#1| 18) ~N~0)} is VALID [2022-02-20 14:17:19,381 INFO L290 TraceCheckUtils]: 23: Hoare triple {5525#(< (+ 19 |ULTIMATE.start_main_~i~0#1|) ~N~0)} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {5509#(< (+ |ULTIMATE.start_main_~i~0#1| 18) ~N~0)} is VALID [2022-02-20 14:17:19,382 INFO L290 TraceCheckUtils]: 22: Hoare triple {5525#(< (+ 19 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {5525#(< (+ 19 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:19,382 INFO L290 TraceCheckUtils]: 21: Hoare triple {5525#(< (+ 19 |ULTIMATE.start_main_~i~0#1|) ~N~0)} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5525#(< (+ 19 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:19,382 INFO L290 TraceCheckUtils]: 20: Hoare triple {5525#(< (+ 19 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5525#(< (+ 19 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:19,382 INFO L290 TraceCheckUtils]: 19: Hoare triple {5525#(< (+ 19 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5525#(< (+ 19 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:19,383 INFO L290 TraceCheckUtils]: 18: Hoare triple {5541#(< (+ |ULTIMATE.start_main_~i~0#1| 20) ~N~0)} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {5525#(< (+ 19 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:19,384 INFO L290 TraceCheckUtils]: 17: Hoare triple {5541#(< (+ |ULTIMATE.start_main_~i~0#1| 20) ~N~0)} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {5541#(< (+ |ULTIMATE.start_main_~i~0#1| 20) ~N~0)} is VALID [2022-02-20 14:17:19,384 INFO L290 TraceCheckUtils]: 16: Hoare triple {5541#(< (+ |ULTIMATE.start_main_~i~0#1| 20) ~N~0)} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5541#(< (+ |ULTIMATE.start_main_~i~0#1| 20) ~N~0)} is VALID [2022-02-20 14:17:19,384 INFO L290 TraceCheckUtils]: 15: Hoare triple {5541#(< (+ |ULTIMATE.start_main_~i~0#1| 20) ~N~0)} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5541#(< (+ |ULTIMATE.start_main_~i~0#1| 20) ~N~0)} is VALID [2022-02-20 14:17:19,385 INFO L290 TraceCheckUtils]: 14: Hoare triple {5541#(< (+ |ULTIMATE.start_main_~i~0#1| 20) ~N~0)} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5541#(< (+ |ULTIMATE.start_main_~i~0#1| 20) ~N~0)} is VALID [2022-02-20 14:17:19,386 INFO L290 TraceCheckUtils]: 13: Hoare triple {5557#(< (+ 21 |ULTIMATE.start_main_~i~0#1|) ~N~0)} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {5541#(< (+ |ULTIMATE.start_main_~i~0#1| 20) ~N~0)} is VALID [2022-02-20 14:17:19,386 INFO L290 TraceCheckUtils]: 12: Hoare triple {5557#(< (+ 21 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {5557#(< (+ 21 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:19,386 INFO L290 TraceCheckUtils]: 11: Hoare triple {5557#(< (+ 21 |ULTIMATE.start_main_~i~0#1|) ~N~0)} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5557#(< (+ 21 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:19,387 INFO L290 TraceCheckUtils]: 10: Hoare triple {5557#(< (+ 21 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5557#(< (+ 21 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:19,387 INFO L290 TraceCheckUtils]: 9: Hoare triple {5557#(< (+ 21 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5557#(< (+ 21 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:19,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {5573#(< (+ 22 |ULTIMATE.start_main_~i~0#1|) ~N~0)} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {5557#(< (+ 21 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:19,388 INFO L290 TraceCheckUtils]: 7: Hoare triple {5573#(< (+ 22 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {5573#(< (+ 22 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:19,388 INFO L290 TraceCheckUtils]: 6: Hoare triple {5573#(< (+ 22 |ULTIMATE.start_main_~i~0#1|) ~N~0)} call main_#t~mem6#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5573#(< (+ 22 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:19,389 INFO L290 TraceCheckUtils]: 5: Hoare triple {5573#(< (+ 22 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume main_~k~0#1 < main_~lim~0#1;call write~int((if (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 <= 2147483647 then (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 else (if main_~i~0#1 % 4294967296 < 0 && 0 != main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) + main_~R~0#1 % 4294967296 else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296) - main_~R~0#1 % 4294967296) else main_~i~0#1 % 4294967296 % (main_~R~0#1 % 4294967296)) % 4294967296 % 4294967296 - 4294967296), main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5573#(< (+ 22 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:19,389 INFO L290 TraceCheckUtils]: 4: Hoare triple {5573#(< (+ 22 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume !!(main_~i~0#1 < ~N~0);call write~int(1 + main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {5573#(< (+ 22 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:19,389 INFO L290 TraceCheckUtils]: 3: Hoare triple {5589#(< 22 ~N~0)} assume { :end_inline_assume_abort_if_not } true;main_~i~0#1 := 0; {5573#(< (+ 22 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:17:19,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {5589#(< 22 ~N~0)} assume !(0 == assume_abort_if_not_~cond#1); {5589#(< 22 ~N~0)} is VALID [2022-02-20 14:17:19,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {5589#(< 22 ~N~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post5#1, main_#t~mem9#1, main_#t~post10#1, main_#t~post8#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~lim~0#1, main_~R~0#1;havoc main_~i~0#1;main_~j~0#1 := 0;main_~k~0#1 := 0;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~lim~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~R~0#1 := 1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if 0 < main_~lim~0#1 && main_~lim~0#1 % 4294967296 < (if ~N~0 % 4294967296 < 0 && 0 != ~N~0 % 4294967296 % (main_~R~0#1 % 4294967296) then (if main_~R~0#1 % 4294967296 < 0 then ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296) - 1 else 1 + ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296)) else ~N~0 % 4294967296 / (main_~R~0#1 % 4294967296)) % 4294967296 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {5589#(< 22 ~N~0)} is VALID [2022-02-20 14:17:19,390 INFO L290 TraceCheckUtils]: 0: Hoare triple {4790#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(30, 2);call #Ultimate.allocInit(12, 3);~N~0 := 1000000; {5589#(< 22 ~N~0)} is VALID [2022-02-20 14:17:19,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1181 backedges. 0 proven. 1177 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:17:19,391 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:17:19,391 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227694254] [2022-02-20 14:17:19,391 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:17:19,391 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927441601] [2022-02-20 14:17:19,391 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927441601] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:17:19,391 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:17:19,392 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 49 [2022-02-20 14:17:19,392 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310390631] [2022-02-20 14:17:19,392 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:17:19,393 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 4.78) internal successors, (239), 49 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2022-02-20 14:17:19,393 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:17:19,393 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 50 states, 50 states have (on average 4.78) internal successors, (239), 49 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:17:19,698 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 239 edges. 239 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:17:19,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-02-20 14:17:19,698 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:17:19,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-02-20 14:17:19,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1179, Invalid=1271, Unknown=0, NotChecked=0, Total=2450 [2022-02-20 14:17:19,700 INFO L87 Difference]: Start difference. First operand 136 states and 184 transitions. Second operand has 50 states, 50 states have (on average 4.78) internal successors, (239), 49 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:17:33,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:17:33,177 INFO L93 Difference]: Finished difference Result 1168 states and 1423 transitions. [2022-02-20 14:17:33,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-02-20 14:17:33,178 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 4.78) internal successors, (239), 49 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2022-02-20 14:17:33,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:17:33,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 4.78) internal successors, (239), 49 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:17:33,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 776 transitions. [2022-02-20 14:17:33,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 4.78) internal successors, (239), 49 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:17:33,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 776 transitions. [2022-02-20 14:17:33,193 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states and 776 transitions. [2022-02-20 14:17:34,210 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 776 edges. 776 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:17:34,269 INFO L225 Difference]: With dead ends: 1168 [2022-02-20 14:17:34,269 INFO L226 Difference]: Without dead ends: 1147 [2022-02-20 14:17:34,271 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=2329, Invalid=2927, Unknown=0, NotChecked=0, Total=5256 [2022-02-20 14:17:34,272 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 2866 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 348 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2866 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 348 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-02-20 14:17:34,272 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2866 Valid, 423 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [348 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-02-20 14:17:34,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2022-02-20 14:17:34,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 256. [2022-02-20 14:17:34,457 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:17:34,457 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1147 states. Second operand has 256 states, 255 states have (on average 1.380392156862745) internal successors, (352), 255 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:17:34,458 INFO L74 IsIncluded]: Start isIncluded. First operand 1147 states. Second operand has 256 states, 255 states have (on average 1.380392156862745) internal successors, (352), 255 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:17:34,458 INFO L87 Difference]: Start difference. First operand 1147 states. Second operand has 256 states, 255 states have (on average 1.380392156862745) internal successors, (352), 255 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:17:34,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:17:34,515 INFO L93 Difference]: Finished difference Result 1147 states and 1375 transitions. [2022-02-20 14:17:34,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1375 transitions. [2022-02-20 14:17:34,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:17:34,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:17:34,518 INFO L74 IsIncluded]: Start isIncluded. First operand has 256 states, 255 states have (on average 1.380392156862745) internal successors, (352), 255 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1147 states. [2022-02-20 14:17:34,519 INFO L87 Difference]: Start difference. First operand has 256 states, 255 states have (on average 1.380392156862745) internal successors, (352), 255 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1147 states. [2022-02-20 14:17:34,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:17:34,576 INFO L93 Difference]: Finished difference Result 1147 states and 1375 transitions. [2022-02-20 14:17:34,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1375 transitions. [2022-02-20 14:17:34,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:17:34,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:17:34,578 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:17:34,578 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:17:34,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 255 states have (on average 1.380392156862745) internal successors, (352), 255 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:17:34,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 352 transitions. [2022-02-20 14:17:34,583 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 352 transitions. Word has length 127 [2022-02-20 14:17:34,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:17:34,584 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 352 transitions. [2022-02-20 14:17:34,584 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 4.78) internal successors, (239), 49 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:17:34,584 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 352 transitions. [2022-02-20 14:17:34,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2022-02-20 14:17:34,587 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:17:34,587 INFO L514 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 46, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:17:34,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-02-20 14:17:34,803 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:17:34,803 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:17:34,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:17:34,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1454397269, now seen corresponding path program 3 times [2022-02-20 14:17:34,804 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:17:34,804 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485850136] [2022-02-20 14:17:34,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:17:34,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms