./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-examples/standard_copy9_ground-2.i --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-examples/standard_copy9_ground-2.i -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 aab03c22d13215fab0d6755eff6eea090232335ae63c67c9d83313131cbb4c89 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:04:01,982 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:04:01,984 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:04:02,007 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:04:02,008 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:04:02,009 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:04:02,010 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:04:02,012 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:04:02,013 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:04:02,014 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:04:02,015 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:04:02,016 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:04:02,016 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:04:02,017 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:04:02,018 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:04:02,019 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:04:02,020 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:04:02,021 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:04:02,022 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:04:02,023 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:04:02,025 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:04:02,026 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:04:02,027 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:04:02,027 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:04:02,030 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:04:02,030 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:04:02,030 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:04:02,031 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:04:02,031 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:04:02,032 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:04:02,032 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:04:02,033 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:04:02,034 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:04:02,034 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:04:02,035 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:04:02,036 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:04:02,036 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:04:02,036 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:04:02,037 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:04:02,037 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:04:02,038 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:04:02,040 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:04:02,062 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:04:02,063 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:04:02,063 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:04:02,064 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:04:02,064 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:04:02,065 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:04:02,065 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:04:02,065 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:04:02,065 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:04:02,066 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:04:02,066 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:04:02,066 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:04:02,066 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:04:02,066 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:04:02,066 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:04:02,067 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:04:02,067 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:04:02,067 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:04:02,067 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:04:02,067 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:04:02,067 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:04:02,068 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:04:02,068 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:04:02,068 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:04:02,068 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:04:02,068 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:04:02,069 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:04:02,069 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:04:02,069 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:04:02,069 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:04:02,069 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:04:02,070 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:04:02,070 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:04:02,070 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 -> aab03c22d13215fab0d6755eff6eea090232335ae63c67c9d83313131cbb4c89 [2022-02-20 14:04:02,300 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:04:02,317 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:04:02,320 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:04:02,321 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:04:02,321 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:04:02,322 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/standard_copy9_ground-2.i [2022-02-20 14:04:02,389 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88aac0c09/25726238abfa4e69912ebcfdad3494a2/FLAGb02ff9285 [2022-02-20 14:04:02,749 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:04:02,750 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/standard_copy9_ground-2.i [2022-02-20 14:04:02,757 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88aac0c09/25726238abfa4e69912ebcfdad3494a2/FLAGb02ff9285 [2022-02-20 14:04:03,155 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88aac0c09/25726238abfa4e69912ebcfdad3494a2 [2022-02-20 14:04:03,158 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:04:03,159 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:04:03,160 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:04:03,160 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:04:03,166 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:04:03,167 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:04:03" (1/1) ... [2022-02-20 14:04:03,167 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31a350dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:04:03, skipping insertion in model container [2022-02-20 14:04:03,168 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:04:03" (1/1) ... [2022-02-20 14:04:03,174 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:04:03,189 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:04:03,323 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-examples/standard_copy9_ground-2.i[816,829] [2022-02-20 14:04:03,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:04:03,368 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:04:03,394 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-examples/standard_copy9_ground-2.i[816,829] [2022-02-20 14:04:03,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:04:03,440 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:04:03,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:04:03 WrapperNode [2022-02-20 14:04:03,441 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:04:03,442 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:04:03,442 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:04:03,442 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:04:03,448 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:04:03" (1/1) ... [2022-02-20 14:04:03,463 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:04:03" (1/1) ... [2022-02-20 14:04:03,505 INFO L137 Inliner]: procedures = 16, calls = 58, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 192 [2022-02-20 14:04:03,506 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:04:03,507 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:04:03,507 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:04:03,507 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:04:03,514 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:04:03" (1/1) ... [2022-02-20 14:04:03,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:04:03" (1/1) ... [2022-02-20 14:04:03,526 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:04:03" (1/1) ... [2022-02-20 14:04:03,527 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:04:03" (1/1) ... [2022-02-20 14:04:03,546 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:04:03" (1/1) ... [2022-02-20 14:04:03,551 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:04:03" (1/1) ... [2022-02-20 14:04:03,552 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:04:03" (1/1) ... [2022-02-20 14:04:03,554 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:04:03,555 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:04:03,555 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:04:03,555 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:04:03,556 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:04:03" (1/1) ... [2022-02-20 14:04:03,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:04:03,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:04:03,586 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:04:03,588 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:04:03,612 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:04:03,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:04:03,612 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:04:03,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:04:03,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:04:03,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:04:03,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:04:03,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:04:03,670 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:04:03,672 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:04:04,089 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:04:04,094 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:04:04,095 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2022-02-20 14:04:04,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:04:04 BoogieIcfgContainer [2022-02-20 14:04:04,096 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:04:04,098 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:04:04,098 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:04:04,101 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:04:04,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:04:03" (1/3) ... [2022-02-20 14:04:04,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@696d2acf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:04:04, skipping insertion in model container [2022-02-20 14:04:04,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:04:03" (2/3) ... [2022-02-20 14:04:04,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@696d2acf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:04:04, skipping insertion in model container [2022-02-20 14:04:04,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:04:04" (3/3) ... [2022-02-20 14:04:04,103 INFO L111 eAbstractionObserver]: Analyzing ICFG standard_copy9_ground-2.i [2022-02-20 14:04:04,107 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:04:04,108 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:04:04,150 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:04:04,158 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:04:04,158 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:04:04,183 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 40 states have (on average 1.6) internal successors, (64), 41 states have internal predecessors, (64), 0 states have call successors, (0), 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:04:04,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 14:04:04,187 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:04:04,188 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:04:04,189 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:04:04,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:04:04,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1887916137, now seen corresponding path program 1 times [2022-02-20 14:04:04,208 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:04:04,209 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435855392] [2022-02-20 14:04:04,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:04:04,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:04:04,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:04:04,538 INFO L290 TraceCheckUtils]: 0: Hoare triple {45#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(26, 2); {45#true} is VALID [2022-02-20 14:04:04,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem4#1, main_#t~post3#1, main_#t~mem6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~post11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~mem16#1, main_#t~post15#1, main_#t~mem18#1, main_#t~post17#1, main_#t~mem20#1, main_#t~post19#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~#a5~0#1.base, main_~#a5~0#1.offset, main_~#a6~0#1.base, main_~#a6~0#1.offset, main_~#a7~0#1.base, main_~#a7~0#1.offset, main_~#a8~0#1.base, main_~#a8~0#1.offset, main_~#a9~0#1.base, main_~#a9~0#1.offset, main_~#a0~0#1.base, main_~#a0~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a6~0#1.base, main_~#a6~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a7~0#1.base, main_~#a7~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a8~0#1.base, main_~#a8~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a9~0#1.base, main_~#a9~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a0~0#1.base, main_~#a0~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {47#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:04:04,540 INFO L290 TraceCheckUtils]: 2: Hoare triple {47#(= |ULTIMATE.start_main_~a~0#1| 0)} assume !(main_~a~0#1 < 100000); {46#false} is VALID [2022-02-20 14:04:04,541 INFO L290 TraceCheckUtils]: 3: Hoare triple {46#false} havoc main_~i~0#1;main_~i~0#1 := 0; {46#false} is VALID [2022-02-20 14:04:04,541 INFO L290 TraceCheckUtils]: 4: Hoare triple {46#false} assume !(main_~i~0#1 < 100000); {46#false} is VALID [2022-02-20 14:04:04,541 INFO L290 TraceCheckUtils]: 5: Hoare triple {46#false} main_~i~0#1 := 0; {46#false} is VALID [2022-02-20 14:04:04,541 INFO L290 TraceCheckUtils]: 6: Hoare triple {46#false} assume !(main_~i~0#1 < 100000); {46#false} is VALID [2022-02-20 14:04:04,542 INFO L290 TraceCheckUtils]: 7: Hoare triple {46#false} main_~i~0#1 := 0; {46#false} is VALID [2022-02-20 14:04:04,542 INFO L290 TraceCheckUtils]: 8: Hoare triple {46#false} assume !(main_~i~0#1 < 100000); {46#false} is VALID [2022-02-20 14:04:04,542 INFO L290 TraceCheckUtils]: 9: Hoare triple {46#false} main_~i~0#1 := 0; {46#false} is VALID [2022-02-20 14:04:04,542 INFO L290 TraceCheckUtils]: 10: Hoare triple {46#false} assume !(main_~i~0#1 < 100000); {46#false} is VALID [2022-02-20 14:04:04,542 INFO L290 TraceCheckUtils]: 11: Hoare triple {46#false} main_~i~0#1 := 0; {46#false} is VALID [2022-02-20 14:04:04,543 INFO L290 TraceCheckUtils]: 12: Hoare triple {46#false} assume !true; {46#false} is VALID [2022-02-20 14:04:04,543 INFO L290 TraceCheckUtils]: 13: Hoare triple {46#false} main_~i~0#1 := 0; {46#false} is VALID [2022-02-20 14:04:04,544 INFO L290 TraceCheckUtils]: 14: Hoare triple {46#false} assume !true; {46#false} is VALID [2022-02-20 14:04:04,544 INFO L290 TraceCheckUtils]: 15: Hoare triple {46#false} main_~i~0#1 := 0; {46#false} is VALID [2022-02-20 14:04:04,545 INFO L290 TraceCheckUtils]: 16: Hoare triple {46#false} assume !true; {46#false} is VALID [2022-02-20 14:04:04,545 INFO L290 TraceCheckUtils]: 17: Hoare triple {46#false} main_~i~0#1 := 0; {46#false} is VALID [2022-02-20 14:04:04,546 INFO L290 TraceCheckUtils]: 18: Hoare triple {46#false} assume !(main_~i~0#1 < 100000); {46#false} is VALID [2022-02-20 14:04:04,546 INFO L290 TraceCheckUtils]: 19: Hoare triple {46#false} main_~i~0#1 := 0; {46#false} is VALID [2022-02-20 14:04:04,546 INFO L290 TraceCheckUtils]: 20: Hoare triple {46#false} assume !(main_~i~0#1 < 100000); {46#false} is VALID [2022-02-20 14:04:04,547 INFO L290 TraceCheckUtils]: 21: Hoare triple {46#false} havoc main_~x~0#1;main_~x~0#1 := 0; {46#false} is VALID [2022-02-20 14:04:04,547 INFO L290 TraceCheckUtils]: 22: Hoare triple {46#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem22#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem23#1 := read~int(main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem22#1 == main_#t~mem23#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {46#false} is VALID [2022-02-20 14:04:04,548 INFO L290 TraceCheckUtils]: 23: Hoare triple {46#false} assume 0 == __VERIFIER_assert_~cond#1; {46#false} is VALID [2022-02-20 14:04:04,548 INFO L290 TraceCheckUtils]: 24: Hoare triple {46#false} assume !false; {46#false} is VALID [2022-02-20 14:04:04,549 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:04:04,550 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:04:04,550 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435855392] [2022-02-20 14:04:04,551 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435855392] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:04:04,551 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:04:04,551 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:04:04,552 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271703956] [2022-02-20 14:04:04,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:04:04,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-20 14:04:04,558 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:04:04,560 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:04,606 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:04:04,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:04:04,606 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:04:04,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:04:04,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:04:04,629 INFO L87 Difference]: Start difference. First operand has 42 states, 40 states have (on average 1.6) internal successors, (64), 41 states have internal predecessors, (64), 0 states have call successors, (0), 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 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:04,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:04,740 INFO L93 Difference]: Finished difference Result 82 states and 126 transitions. [2022-02-20 14:04:04,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:04:04,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-20 14:04:04,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:04:04,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:04,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2022-02-20 14:04:04,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:04,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2022-02-20 14:04:04,757 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 126 transitions. [2022-02-20 14:04:04,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:04:04,874 INFO L225 Difference]: With dead ends: 82 [2022-02-20 14:04:04,874 INFO L226 Difference]: Without dead ends: 40 [2022-02-20 14:04:04,877 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:04:04,881 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 1 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:04:04,881 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 98 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:04:04,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-02-20 14:04:04,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-02-20 14:04:04,907 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:04:04,909 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 39 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:04,910 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 39 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:04,912 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 39 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:04,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:04,915 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-02-20 14:04:04,916 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-02-20 14:04:04,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:04:04,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:04:04,917 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 40 states. [2022-02-20 14:04:04,920 INFO L87 Difference]: Start difference. First operand has 39 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 40 states. [2022-02-20 14:04:04,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:04,922 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-02-20 14:04:04,922 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-02-20 14:04:04,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:04:04,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:04:04,926 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:04:04,926 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:04:04,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:04,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2022-02-20 14:04:04,931 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 25 [2022-02-20 14:04:04,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:04:04,932 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2022-02-20 14:04:04,932 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:04,933 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2022-02-20 14:04:04,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 14:04:04,938 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:04:04,939 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:04:04,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:04:04,939 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:04:04,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:04:04,942 INFO L85 PathProgramCache]: Analyzing trace with hash -166940861, now seen corresponding path program 1 times [2022-02-20 14:04:04,942 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:04:04,943 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661009177] [2022-02-20 14:04:04,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:04:04,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:04:05,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:04:05,076 INFO L290 TraceCheckUtils]: 0: Hoare triple {287#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(26, 2); {287#true} is VALID [2022-02-20 14:04:05,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {287#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem4#1, main_#t~post3#1, main_#t~mem6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~post11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~mem16#1, main_#t~post15#1, main_#t~mem18#1, main_#t~post17#1, main_#t~mem20#1, main_#t~post19#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~#a5~0#1.base, main_~#a5~0#1.offset, main_~#a6~0#1.base, main_~#a6~0#1.offset, main_~#a7~0#1.base, main_~#a7~0#1.offset, main_~#a8~0#1.base, main_~#a8~0#1.offset, main_~#a9~0#1.base, main_~#a9~0#1.offset, main_~#a0~0#1.base, main_~#a0~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a6~0#1.base, main_~#a6~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a7~0#1.base, main_~#a7~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a8~0#1.base, main_~#a8~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a9~0#1.base, main_~#a9~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a0~0#1.base, main_~#a0~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {289#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:04:05,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {289#(= |ULTIMATE.start_main_~a~0#1| 0)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {289#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:04:05,078 INFO L290 TraceCheckUtils]: 3: Hoare triple {289#(= |ULTIMATE.start_main_~a~0#1| 0)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {290#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:04:05,082 INFO L290 TraceCheckUtils]: 4: Hoare triple {290#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !(main_~a~0#1 < 100000); {288#false} is VALID [2022-02-20 14:04:05,082 INFO L290 TraceCheckUtils]: 5: Hoare triple {288#false} havoc main_~i~0#1;main_~i~0#1 := 0; {288#false} is VALID [2022-02-20 14:04:05,082 INFO L290 TraceCheckUtils]: 6: Hoare triple {288#false} assume !(main_~i~0#1 < 100000); {288#false} is VALID [2022-02-20 14:04:05,083 INFO L290 TraceCheckUtils]: 7: Hoare triple {288#false} main_~i~0#1 := 0; {288#false} is VALID [2022-02-20 14:04:05,083 INFO L290 TraceCheckUtils]: 8: Hoare triple {288#false} assume !(main_~i~0#1 < 100000); {288#false} is VALID [2022-02-20 14:04:05,083 INFO L290 TraceCheckUtils]: 9: Hoare triple {288#false} main_~i~0#1 := 0; {288#false} is VALID [2022-02-20 14:04:05,084 INFO L290 TraceCheckUtils]: 10: Hoare triple {288#false} assume !(main_~i~0#1 < 100000); {288#false} is VALID [2022-02-20 14:04:05,084 INFO L290 TraceCheckUtils]: 11: Hoare triple {288#false} main_~i~0#1 := 0; {288#false} is VALID [2022-02-20 14:04:05,084 INFO L290 TraceCheckUtils]: 12: Hoare triple {288#false} assume !(main_~i~0#1 < 100000); {288#false} is VALID [2022-02-20 14:04:05,085 INFO L290 TraceCheckUtils]: 13: Hoare triple {288#false} main_~i~0#1 := 0; {288#false} is VALID [2022-02-20 14:04:05,085 INFO L290 TraceCheckUtils]: 14: Hoare triple {288#false} assume !(main_~i~0#1 < 100000); {288#false} is VALID [2022-02-20 14:04:05,085 INFO L290 TraceCheckUtils]: 15: Hoare triple {288#false} main_~i~0#1 := 0; {288#false} is VALID [2022-02-20 14:04:05,086 INFO L290 TraceCheckUtils]: 16: Hoare triple {288#false} assume !(main_~i~0#1 < 100000); {288#false} is VALID [2022-02-20 14:04:05,086 INFO L290 TraceCheckUtils]: 17: Hoare triple {288#false} main_~i~0#1 := 0; {288#false} is VALID [2022-02-20 14:04:05,086 INFO L290 TraceCheckUtils]: 18: Hoare triple {288#false} assume !(main_~i~0#1 < 100000); {288#false} is VALID [2022-02-20 14:04:05,086 INFO L290 TraceCheckUtils]: 19: Hoare triple {288#false} main_~i~0#1 := 0; {288#false} is VALID [2022-02-20 14:04:05,087 INFO L290 TraceCheckUtils]: 20: Hoare triple {288#false} assume !(main_~i~0#1 < 100000); {288#false} is VALID [2022-02-20 14:04:05,087 INFO L290 TraceCheckUtils]: 21: Hoare triple {288#false} main_~i~0#1 := 0; {288#false} is VALID [2022-02-20 14:04:05,087 INFO L290 TraceCheckUtils]: 22: Hoare triple {288#false} assume !(main_~i~0#1 < 100000); {288#false} is VALID [2022-02-20 14:04:05,087 INFO L290 TraceCheckUtils]: 23: Hoare triple {288#false} havoc main_~x~0#1;main_~x~0#1 := 0; {288#false} is VALID [2022-02-20 14:04:05,091 INFO L290 TraceCheckUtils]: 24: Hoare triple {288#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem22#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem23#1 := read~int(main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem22#1 == main_#t~mem23#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {288#false} is VALID [2022-02-20 14:04:05,092 INFO L290 TraceCheckUtils]: 25: Hoare triple {288#false} assume 0 == __VERIFIER_assert_~cond#1; {288#false} is VALID [2022-02-20 14:04:05,092 INFO L290 TraceCheckUtils]: 26: Hoare triple {288#false} assume !false; {288#false} is VALID [2022-02-20 14:04:05,092 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:04:05,093 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:04:05,093 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661009177] [2022-02-20 14:04:05,094 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661009177] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:04:05,094 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149279109] [2022-02-20 14:04:05,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:04:05,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:04:05,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:04:05,100 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:04:05,106 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:04:05,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:04:05,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 14:04:05,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:04:05,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:04:05,357 INFO L290 TraceCheckUtils]: 0: Hoare triple {287#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(26, 2); {287#true} is VALID [2022-02-20 14:04:05,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {287#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem4#1, main_#t~post3#1, main_#t~mem6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~post11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~mem16#1, main_#t~post15#1, main_#t~mem18#1, main_#t~post17#1, main_#t~mem20#1, main_#t~post19#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~#a5~0#1.base, main_~#a5~0#1.offset, main_~#a6~0#1.base, main_~#a6~0#1.offset, main_~#a7~0#1.base, main_~#a7~0#1.offset, main_~#a8~0#1.base, main_~#a8~0#1.offset, main_~#a9~0#1.base, main_~#a9~0#1.offset, main_~#a0~0#1.base, main_~#a0~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a6~0#1.base, main_~#a6~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a7~0#1.base, main_~#a7~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a8~0#1.base, main_~#a8~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a9~0#1.base, main_~#a9~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a0~0#1.base, main_~#a0~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {287#true} is VALID [2022-02-20 14:04:05,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {287#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {287#true} is VALID [2022-02-20 14:04:05,360 INFO L290 TraceCheckUtils]: 3: Hoare triple {287#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {287#true} is VALID [2022-02-20 14:04:05,360 INFO L290 TraceCheckUtils]: 4: Hoare triple {287#true} assume !(main_~a~0#1 < 100000); {287#true} is VALID [2022-02-20 14:04:05,361 INFO L290 TraceCheckUtils]: 5: Hoare triple {287#true} havoc main_~i~0#1;main_~i~0#1 := 0; {309#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:04:05,362 INFO L290 TraceCheckUtils]: 6: Hoare triple {309#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~i~0#1 < 100000); {288#false} is VALID [2022-02-20 14:04:05,363 INFO L290 TraceCheckUtils]: 7: Hoare triple {288#false} main_~i~0#1 := 0; {288#false} is VALID [2022-02-20 14:04:05,363 INFO L290 TraceCheckUtils]: 8: Hoare triple {288#false} assume !(main_~i~0#1 < 100000); {288#false} is VALID [2022-02-20 14:04:05,363 INFO L290 TraceCheckUtils]: 9: Hoare triple {288#false} main_~i~0#1 := 0; {288#false} is VALID [2022-02-20 14:04:05,363 INFO L290 TraceCheckUtils]: 10: Hoare triple {288#false} assume !(main_~i~0#1 < 100000); {288#false} is VALID [2022-02-20 14:04:05,365 INFO L290 TraceCheckUtils]: 11: Hoare triple {288#false} main_~i~0#1 := 0; {288#false} is VALID [2022-02-20 14:04:05,365 INFO L290 TraceCheckUtils]: 12: Hoare triple {288#false} assume !(main_~i~0#1 < 100000); {288#false} is VALID [2022-02-20 14:04:05,365 INFO L290 TraceCheckUtils]: 13: Hoare triple {288#false} main_~i~0#1 := 0; {288#false} is VALID [2022-02-20 14:04:05,366 INFO L290 TraceCheckUtils]: 14: Hoare triple {288#false} assume !(main_~i~0#1 < 100000); {288#false} is VALID [2022-02-20 14:04:05,366 INFO L290 TraceCheckUtils]: 15: Hoare triple {288#false} main_~i~0#1 := 0; {288#false} is VALID [2022-02-20 14:04:05,366 INFO L290 TraceCheckUtils]: 16: Hoare triple {288#false} assume !(main_~i~0#1 < 100000); {288#false} is VALID [2022-02-20 14:04:05,366 INFO L290 TraceCheckUtils]: 17: Hoare triple {288#false} main_~i~0#1 := 0; {288#false} is VALID [2022-02-20 14:04:05,366 INFO L290 TraceCheckUtils]: 18: Hoare triple {288#false} assume !(main_~i~0#1 < 100000); {288#false} is VALID [2022-02-20 14:04:05,367 INFO L290 TraceCheckUtils]: 19: Hoare triple {288#false} main_~i~0#1 := 0; {288#false} is VALID [2022-02-20 14:04:05,367 INFO L290 TraceCheckUtils]: 20: Hoare triple {288#false} assume !(main_~i~0#1 < 100000); {288#false} is VALID [2022-02-20 14:04:05,367 INFO L290 TraceCheckUtils]: 21: Hoare triple {288#false} main_~i~0#1 := 0; {288#false} is VALID [2022-02-20 14:04:05,368 INFO L290 TraceCheckUtils]: 22: Hoare triple {288#false} assume !(main_~i~0#1 < 100000); {288#false} is VALID [2022-02-20 14:04:05,368 INFO L290 TraceCheckUtils]: 23: Hoare triple {288#false} havoc main_~x~0#1;main_~x~0#1 := 0; {288#false} is VALID [2022-02-20 14:04:05,368 INFO L290 TraceCheckUtils]: 24: Hoare triple {288#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem22#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem23#1 := read~int(main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem22#1 == main_#t~mem23#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {288#false} is VALID [2022-02-20 14:04:05,369 INFO L290 TraceCheckUtils]: 25: Hoare triple {288#false} assume 0 == __VERIFIER_assert_~cond#1; {288#false} is VALID [2022-02-20 14:04:05,369 INFO L290 TraceCheckUtils]: 26: Hoare triple {288#false} assume !false; {288#false} is VALID [2022-02-20 14:04:05,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:04:05,369 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:04:05,370 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149279109] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:04:05,373 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 14:04:05,374 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-02-20 14:04:05,374 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955495310] [2022-02-20 14:04:05,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:04:05,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-02-20 14:04:05,376 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:04:05,376 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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:04:05,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:04:05,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:04:05,400 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:04:05,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:04:05,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:04:05,401 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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:04:05,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:05,552 INFO L93 Difference]: Finished difference Result 88 states and 115 transitions. [2022-02-20 14:04:05,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:04:05,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-02-20 14:04:05,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:04:05,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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:04:05,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2022-02-20 14:04:05,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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:04:05,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2022-02-20 14:04:05,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 114 transitions. [2022-02-20 14:04:05,679 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:04:05,685 INFO L225 Difference]: With dead ends: 88 [2022-02-20 14:04:05,685 INFO L226 Difference]: Without dead ends: 57 [2022-02-20 14:04:05,686 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:04:05,688 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 9 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:04:05,688 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 41 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:04:05,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-02-20 14:04:05,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2022-02-20 14:04:05,704 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:04:05,705 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 48 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 0 states have call successors, (0), 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:04:05,715 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 48 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 0 states have call successors, (0), 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:04:05,716 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 48 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 0 states have call successors, (0), 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:04:05,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:05,724 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-02-20 14:04:05,724 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-02-20 14:04:05,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:04:05,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:04:05,726 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 0 states have call successors, (0), 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 57 states. [2022-02-20 14:04:05,726 INFO L87 Difference]: Start difference. First operand has 48 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 0 states have call successors, (0), 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 57 states. [2022-02-20 14:04:05,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:05,730 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-02-20 14:04:05,731 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-02-20 14:04:05,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:04:05,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:04:05,735 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:04:05,735 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:04:05,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 0 states have call successors, (0), 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:04:05,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2022-02-20 14:04:05,737 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 27 [2022-02-20 14:04:05,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:04:05,737 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2022-02-20 14:04:05,737 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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:04:05,737 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2022-02-20 14:04:05,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-20 14:04:05,738 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:04:05,739 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:04:05,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 14:04:05,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:04:05,952 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:04:05,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:04:05,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1109508687, now seen corresponding path program 1 times [2022-02-20 14:04:05,953 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:04:05,953 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579300588] [2022-02-20 14:04:05,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:04:05,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:04:06,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:04:06,049 INFO L290 TraceCheckUtils]: 0: Hoare triple {673#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(26, 2); {673#true} is VALID [2022-02-20 14:04:06,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {673#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem4#1, main_#t~post3#1, main_#t~mem6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~post11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~mem16#1, main_#t~post15#1, main_#t~mem18#1, main_#t~post17#1, main_#t~mem20#1, main_#t~post19#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~#a5~0#1.base, main_~#a5~0#1.offset, main_~#a6~0#1.base, main_~#a6~0#1.offset, main_~#a7~0#1.base, main_~#a7~0#1.offset, main_~#a8~0#1.base, main_~#a8~0#1.offset, main_~#a9~0#1.base, main_~#a9~0#1.offset, main_~#a0~0#1.base, main_~#a0~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a6~0#1.base, main_~#a6~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a7~0#1.base, main_~#a7~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a8~0#1.base, main_~#a8~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a9~0#1.base, main_~#a9~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a0~0#1.base, main_~#a0~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {675#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:04:06,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {675#(= |ULTIMATE.start_main_~a~0#1| 0)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {675#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:04:06,051 INFO L290 TraceCheckUtils]: 3: Hoare triple {675#(= |ULTIMATE.start_main_~a~0#1| 0)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {676#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:04:06,052 INFO L290 TraceCheckUtils]: 4: Hoare triple {676#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !(main_~a~0#1 < 100000); {674#false} is VALID [2022-02-20 14:04:06,052 INFO L290 TraceCheckUtils]: 5: Hoare triple {674#false} havoc main_~i~0#1;main_~i~0#1 := 0; {674#false} is VALID [2022-02-20 14:04:06,052 INFO L290 TraceCheckUtils]: 6: Hoare triple {674#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {674#false} is VALID [2022-02-20 14:04:06,052 INFO L290 TraceCheckUtils]: 7: Hoare triple {674#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {674#false} is VALID [2022-02-20 14:04:06,053 INFO L290 TraceCheckUtils]: 8: Hoare triple {674#false} assume !(main_~i~0#1 < 100000); {674#false} is VALID [2022-02-20 14:04:06,053 INFO L290 TraceCheckUtils]: 9: Hoare triple {674#false} main_~i~0#1 := 0; {674#false} is VALID [2022-02-20 14:04:06,053 INFO L290 TraceCheckUtils]: 10: Hoare triple {674#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {674#false} is VALID [2022-02-20 14:04:06,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {674#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {674#false} is VALID [2022-02-20 14:04:06,054 INFO L290 TraceCheckUtils]: 12: Hoare triple {674#false} assume !(main_~i~0#1 < 100000); {674#false} is VALID [2022-02-20 14:04:06,054 INFO L290 TraceCheckUtils]: 13: Hoare triple {674#false} main_~i~0#1 := 0; {674#false} is VALID [2022-02-20 14:04:06,054 INFO L290 TraceCheckUtils]: 14: Hoare triple {674#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {674#false} is VALID [2022-02-20 14:04:06,054 INFO L290 TraceCheckUtils]: 15: Hoare triple {674#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {674#false} is VALID [2022-02-20 14:04:06,054 INFO L290 TraceCheckUtils]: 16: Hoare triple {674#false} assume !(main_~i~0#1 < 100000); {674#false} is VALID [2022-02-20 14:04:06,055 INFO L290 TraceCheckUtils]: 17: Hoare triple {674#false} main_~i~0#1 := 0; {674#false} is VALID [2022-02-20 14:04:06,055 INFO L290 TraceCheckUtils]: 18: Hoare triple {674#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {674#false} is VALID [2022-02-20 14:04:06,055 INFO L290 TraceCheckUtils]: 19: Hoare triple {674#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {674#false} is VALID [2022-02-20 14:04:06,055 INFO L290 TraceCheckUtils]: 20: Hoare triple {674#false} assume !(main_~i~0#1 < 100000); {674#false} is VALID [2022-02-20 14:04:06,055 INFO L290 TraceCheckUtils]: 21: Hoare triple {674#false} main_~i~0#1 := 0; {674#false} is VALID [2022-02-20 14:04:06,056 INFO L290 TraceCheckUtils]: 22: Hoare triple {674#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {674#false} is VALID [2022-02-20 14:04:06,056 INFO L290 TraceCheckUtils]: 23: Hoare triple {674#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {674#false} is VALID [2022-02-20 14:04:06,056 INFO L290 TraceCheckUtils]: 24: Hoare triple {674#false} assume !(main_~i~0#1 < 100000); {674#false} is VALID [2022-02-20 14:04:06,056 INFO L290 TraceCheckUtils]: 25: Hoare triple {674#false} main_~i~0#1 := 0; {674#false} is VALID [2022-02-20 14:04:06,057 INFO L290 TraceCheckUtils]: 26: Hoare triple {674#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {674#false} is VALID [2022-02-20 14:04:06,057 INFO L290 TraceCheckUtils]: 27: Hoare triple {674#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {674#false} is VALID [2022-02-20 14:04:06,057 INFO L290 TraceCheckUtils]: 28: Hoare triple {674#false} assume !(main_~i~0#1 < 100000); {674#false} is VALID [2022-02-20 14:04:06,057 INFO L290 TraceCheckUtils]: 29: Hoare triple {674#false} main_~i~0#1 := 0; {674#false} is VALID [2022-02-20 14:04:06,057 INFO L290 TraceCheckUtils]: 30: Hoare triple {674#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {674#false} is VALID [2022-02-20 14:04:06,058 INFO L290 TraceCheckUtils]: 31: Hoare triple {674#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {674#false} is VALID [2022-02-20 14:04:06,058 INFO L290 TraceCheckUtils]: 32: Hoare triple {674#false} assume !(main_~i~0#1 < 100000); {674#false} is VALID [2022-02-20 14:04:06,058 INFO L290 TraceCheckUtils]: 33: Hoare triple {674#false} main_~i~0#1 := 0; {674#false} is VALID [2022-02-20 14:04:06,058 INFO L290 TraceCheckUtils]: 34: Hoare triple {674#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem18#1, main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem18#1; {674#false} is VALID [2022-02-20 14:04:06,059 INFO L290 TraceCheckUtils]: 35: Hoare triple {674#false} main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {674#false} is VALID [2022-02-20 14:04:06,059 INFO L290 TraceCheckUtils]: 36: Hoare triple {674#false} assume !(main_~i~0#1 < 100000); {674#false} is VALID [2022-02-20 14:04:06,059 INFO L290 TraceCheckUtils]: 37: Hoare triple {674#false} main_~i~0#1 := 0; {674#false} is VALID [2022-02-20 14:04:06,059 INFO L290 TraceCheckUtils]: 38: Hoare triple {674#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem20#1 := read~int(main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem20#1, main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem20#1; {674#false} is VALID [2022-02-20 14:04:06,059 INFO L290 TraceCheckUtils]: 39: Hoare triple {674#false} main_#t~post19#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; {674#false} is VALID [2022-02-20 14:04:06,060 INFO L290 TraceCheckUtils]: 40: Hoare triple {674#false} assume !(main_~i~0#1 < 100000); {674#false} is VALID [2022-02-20 14:04:06,060 INFO L290 TraceCheckUtils]: 41: Hoare triple {674#false} havoc main_~x~0#1;main_~x~0#1 := 0; {674#false} is VALID [2022-02-20 14:04:06,060 INFO L290 TraceCheckUtils]: 42: Hoare triple {674#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem22#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem23#1 := read~int(main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem22#1 == main_#t~mem23#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {674#false} is VALID [2022-02-20 14:04:06,060 INFO L290 TraceCheckUtils]: 43: Hoare triple {674#false} assume 0 == __VERIFIER_assert_~cond#1; {674#false} is VALID [2022-02-20 14:04:06,061 INFO L290 TraceCheckUtils]: 44: Hoare triple {674#false} assume !false; {674#false} is VALID [2022-02-20 14:04:06,061 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-20 14:04:06,061 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:04:06,061 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579300588] [2022-02-20 14:04:06,061 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579300588] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:04:06,062 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147919601] [2022-02-20 14:04:06,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:04:06,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:04:06,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:04:06,063 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:04:06,067 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:04:06,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:04:06,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 14:04:06,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:04:06,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:04:06,329 INFO L290 TraceCheckUtils]: 0: Hoare triple {673#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(26, 2); {673#true} is VALID [2022-02-20 14:04:06,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {673#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem4#1, main_#t~post3#1, main_#t~mem6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~post11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~mem16#1, main_#t~post15#1, main_#t~mem18#1, main_#t~post17#1, main_#t~mem20#1, main_#t~post19#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~#a5~0#1.base, main_~#a5~0#1.offset, main_~#a6~0#1.base, main_~#a6~0#1.offset, main_~#a7~0#1.base, main_~#a7~0#1.offset, main_~#a8~0#1.base, main_~#a8~0#1.offset, main_~#a9~0#1.base, main_~#a9~0#1.offset, main_~#a0~0#1.base, main_~#a0~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a6~0#1.base, main_~#a6~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a7~0#1.base, main_~#a7~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a8~0#1.base, main_~#a8~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a9~0#1.base, main_~#a9~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a0~0#1.base, main_~#a0~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {683#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:04:06,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {683#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {683#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:04:06,347 INFO L290 TraceCheckUtils]: 3: Hoare triple {683#(<= |ULTIMATE.start_main_~a~0#1| 0)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {676#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:04:06,347 INFO L290 TraceCheckUtils]: 4: Hoare triple {676#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !(main_~a~0#1 < 100000); {674#false} is VALID [2022-02-20 14:04:06,347 INFO L290 TraceCheckUtils]: 5: Hoare triple {674#false} havoc main_~i~0#1;main_~i~0#1 := 0; {674#false} is VALID [2022-02-20 14:04:06,348 INFO L290 TraceCheckUtils]: 6: Hoare triple {674#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {674#false} is VALID [2022-02-20 14:04:06,348 INFO L290 TraceCheckUtils]: 7: Hoare triple {674#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {674#false} is VALID [2022-02-20 14:04:06,348 INFO L290 TraceCheckUtils]: 8: Hoare triple {674#false} assume !(main_~i~0#1 < 100000); {674#false} is VALID [2022-02-20 14:04:06,348 INFO L290 TraceCheckUtils]: 9: Hoare triple {674#false} main_~i~0#1 := 0; {674#false} is VALID [2022-02-20 14:04:06,348 INFO L290 TraceCheckUtils]: 10: Hoare triple {674#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {674#false} is VALID [2022-02-20 14:04:06,349 INFO L290 TraceCheckUtils]: 11: Hoare triple {674#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {674#false} is VALID [2022-02-20 14:04:06,349 INFO L290 TraceCheckUtils]: 12: Hoare triple {674#false} assume !(main_~i~0#1 < 100000); {674#false} is VALID [2022-02-20 14:04:06,349 INFO L290 TraceCheckUtils]: 13: Hoare triple {674#false} main_~i~0#1 := 0; {674#false} is VALID [2022-02-20 14:04:06,349 INFO L290 TraceCheckUtils]: 14: Hoare triple {674#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {674#false} is VALID [2022-02-20 14:04:06,350 INFO L290 TraceCheckUtils]: 15: Hoare triple {674#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {674#false} is VALID [2022-02-20 14:04:06,350 INFO L290 TraceCheckUtils]: 16: Hoare triple {674#false} assume !(main_~i~0#1 < 100000); {674#false} is VALID [2022-02-20 14:04:06,350 INFO L290 TraceCheckUtils]: 17: Hoare triple {674#false} main_~i~0#1 := 0; {674#false} is VALID [2022-02-20 14:04:06,351 INFO L290 TraceCheckUtils]: 18: Hoare triple {674#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {674#false} is VALID [2022-02-20 14:04:06,351 INFO L290 TraceCheckUtils]: 19: Hoare triple {674#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {674#false} is VALID [2022-02-20 14:04:06,351 INFO L290 TraceCheckUtils]: 20: Hoare triple {674#false} assume !(main_~i~0#1 < 100000); {674#false} is VALID [2022-02-20 14:04:06,351 INFO L290 TraceCheckUtils]: 21: Hoare triple {674#false} main_~i~0#1 := 0; {674#false} is VALID [2022-02-20 14:04:06,352 INFO L290 TraceCheckUtils]: 22: Hoare triple {674#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {674#false} is VALID [2022-02-20 14:04:06,352 INFO L290 TraceCheckUtils]: 23: Hoare triple {674#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {674#false} is VALID [2022-02-20 14:04:06,352 INFO L290 TraceCheckUtils]: 24: Hoare triple {674#false} assume !(main_~i~0#1 < 100000); {674#false} is VALID [2022-02-20 14:04:06,352 INFO L290 TraceCheckUtils]: 25: Hoare triple {674#false} main_~i~0#1 := 0; {674#false} is VALID [2022-02-20 14:04:06,352 INFO L290 TraceCheckUtils]: 26: Hoare triple {674#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {674#false} is VALID [2022-02-20 14:04:06,353 INFO L290 TraceCheckUtils]: 27: Hoare triple {674#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {674#false} is VALID [2022-02-20 14:04:06,353 INFO L290 TraceCheckUtils]: 28: Hoare triple {674#false} assume !(main_~i~0#1 < 100000); {674#false} is VALID [2022-02-20 14:04:06,353 INFO L290 TraceCheckUtils]: 29: Hoare triple {674#false} main_~i~0#1 := 0; {674#false} is VALID [2022-02-20 14:04:06,353 INFO L290 TraceCheckUtils]: 30: Hoare triple {674#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {674#false} is VALID [2022-02-20 14:04:06,353 INFO L290 TraceCheckUtils]: 31: Hoare triple {674#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {674#false} is VALID [2022-02-20 14:04:06,353 INFO L290 TraceCheckUtils]: 32: Hoare triple {674#false} assume !(main_~i~0#1 < 100000); {674#false} is VALID [2022-02-20 14:04:06,354 INFO L290 TraceCheckUtils]: 33: Hoare triple {674#false} main_~i~0#1 := 0; {674#false} is VALID [2022-02-20 14:04:06,354 INFO L290 TraceCheckUtils]: 34: Hoare triple {674#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem18#1, main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem18#1; {674#false} is VALID [2022-02-20 14:04:06,354 INFO L290 TraceCheckUtils]: 35: Hoare triple {674#false} main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {674#false} is VALID [2022-02-20 14:04:06,354 INFO L290 TraceCheckUtils]: 36: Hoare triple {674#false} assume !(main_~i~0#1 < 100000); {674#false} is VALID [2022-02-20 14:04:06,354 INFO L290 TraceCheckUtils]: 37: Hoare triple {674#false} main_~i~0#1 := 0; {674#false} is VALID [2022-02-20 14:04:06,355 INFO L290 TraceCheckUtils]: 38: Hoare triple {674#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem20#1 := read~int(main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem20#1, main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem20#1; {674#false} is VALID [2022-02-20 14:04:06,355 INFO L290 TraceCheckUtils]: 39: Hoare triple {674#false} main_#t~post19#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; {674#false} is VALID [2022-02-20 14:04:06,355 INFO L290 TraceCheckUtils]: 40: Hoare triple {674#false} assume !(main_~i~0#1 < 100000); {674#false} is VALID [2022-02-20 14:04:06,355 INFO L290 TraceCheckUtils]: 41: Hoare triple {674#false} havoc main_~x~0#1;main_~x~0#1 := 0; {674#false} is VALID [2022-02-20 14:04:06,355 INFO L290 TraceCheckUtils]: 42: Hoare triple {674#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem22#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem23#1 := read~int(main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem22#1 == main_#t~mem23#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {674#false} is VALID [2022-02-20 14:04:06,358 INFO L290 TraceCheckUtils]: 43: Hoare triple {674#false} assume 0 == __VERIFIER_assert_~cond#1; {674#false} is VALID [2022-02-20 14:04:06,358 INFO L290 TraceCheckUtils]: 44: Hoare triple {674#false} assume !false; {674#false} is VALID [2022-02-20 14:04:06,358 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-20 14:04:06,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:04:06,505 INFO L290 TraceCheckUtils]: 44: Hoare triple {674#false} assume !false; {674#false} is VALID [2022-02-20 14:04:06,506 INFO L290 TraceCheckUtils]: 43: Hoare triple {674#false} assume 0 == __VERIFIER_assert_~cond#1; {674#false} is VALID [2022-02-20 14:04:06,506 INFO L290 TraceCheckUtils]: 42: Hoare triple {674#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem22#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem23#1 := read~int(main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem22#1 == main_#t~mem23#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {674#false} is VALID [2022-02-20 14:04:06,506 INFO L290 TraceCheckUtils]: 41: Hoare triple {674#false} havoc main_~x~0#1;main_~x~0#1 := 0; {674#false} is VALID [2022-02-20 14:04:06,506 INFO L290 TraceCheckUtils]: 40: Hoare triple {674#false} assume !(main_~i~0#1 < 100000); {674#false} is VALID [2022-02-20 14:04:06,507 INFO L290 TraceCheckUtils]: 39: Hoare triple {674#false} main_#t~post19#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; {674#false} is VALID [2022-02-20 14:04:06,507 INFO L290 TraceCheckUtils]: 38: Hoare triple {674#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem20#1 := read~int(main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem20#1, main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem20#1; {674#false} is VALID [2022-02-20 14:04:06,507 INFO L290 TraceCheckUtils]: 37: Hoare triple {674#false} main_~i~0#1 := 0; {674#false} is VALID [2022-02-20 14:04:06,507 INFO L290 TraceCheckUtils]: 36: Hoare triple {674#false} assume !(main_~i~0#1 < 100000); {674#false} is VALID [2022-02-20 14:04:06,507 INFO L290 TraceCheckUtils]: 35: Hoare triple {674#false} main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {674#false} is VALID [2022-02-20 14:04:06,508 INFO L290 TraceCheckUtils]: 34: Hoare triple {674#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem18#1, main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem18#1; {674#false} is VALID [2022-02-20 14:04:06,508 INFO L290 TraceCheckUtils]: 33: Hoare triple {674#false} main_~i~0#1 := 0; {674#false} is VALID [2022-02-20 14:04:06,508 INFO L290 TraceCheckUtils]: 32: Hoare triple {674#false} assume !(main_~i~0#1 < 100000); {674#false} is VALID [2022-02-20 14:04:06,508 INFO L290 TraceCheckUtils]: 31: Hoare triple {674#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {674#false} is VALID [2022-02-20 14:04:06,508 INFO L290 TraceCheckUtils]: 30: Hoare triple {674#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {674#false} is VALID [2022-02-20 14:04:06,509 INFO L290 TraceCheckUtils]: 29: Hoare triple {674#false} main_~i~0#1 := 0; {674#false} is VALID [2022-02-20 14:04:06,509 INFO L290 TraceCheckUtils]: 28: Hoare triple {674#false} assume !(main_~i~0#1 < 100000); {674#false} is VALID [2022-02-20 14:04:06,509 INFO L290 TraceCheckUtils]: 27: Hoare triple {674#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {674#false} is VALID [2022-02-20 14:04:06,509 INFO L290 TraceCheckUtils]: 26: Hoare triple {674#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {674#false} is VALID [2022-02-20 14:04:06,509 INFO L290 TraceCheckUtils]: 25: Hoare triple {674#false} main_~i~0#1 := 0; {674#false} is VALID [2022-02-20 14:04:06,509 INFO L290 TraceCheckUtils]: 24: Hoare triple {674#false} assume !(main_~i~0#1 < 100000); {674#false} is VALID [2022-02-20 14:04:06,510 INFO L290 TraceCheckUtils]: 23: Hoare triple {674#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {674#false} is VALID [2022-02-20 14:04:06,510 INFO L290 TraceCheckUtils]: 22: Hoare triple {674#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {674#false} is VALID [2022-02-20 14:04:06,510 INFO L290 TraceCheckUtils]: 21: Hoare triple {674#false} main_~i~0#1 := 0; {674#false} is VALID [2022-02-20 14:04:06,510 INFO L290 TraceCheckUtils]: 20: Hoare triple {674#false} assume !(main_~i~0#1 < 100000); {674#false} is VALID [2022-02-20 14:04:06,510 INFO L290 TraceCheckUtils]: 19: Hoare triple {674#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {674#false} is VALID [2022-02-20 14:04:06,511 INFO L290 TraceCheckUtils]: 18: Hoare triple {674#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {674#false} is VALID [2022-02-20 14:04:06,511 INFO L290 TraceCheckUtils]: 17: Hoare triple {674#false} main_~i~0#1 := 0; {674#false} is VALID [2022-02-20 14:04:06,511 INFO L290 TraceCheckUtils]: 16: Hoare triple {674#false} assume !(main_~i~0#1 < 100000); {674#false} is VALID [2022-02-20 14:04:06,511 INFO L290 TraceCheckUtils]: 15: Hoare triple {674#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {674#false} is VALID [2022-02-20 14:04:06,511 INFO L290 TraceCheckUtils]: 14: Hoare triple {674#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {674#false} is VALID [2022-02-20 14:04:06,512 INFO L290 TraceCheckUtils]: 13: Hoare triple {674#false} main_~i~0#1 := 0; {674#false} is VALID [2022-02-20 14:04:06,512 INFO L290 TraceCheckUtils]: 12: Hoare triple {674#false} assume !(main_~i~0#1 < 100000); {674#false} is VALID [2022-02-20 14:04:06,512 INFO L290 TraceCheckUtils]: 11: Hoare triple {674#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {674#false} is VALID [2022-02-20 14:04:06,512 INFO L290 TraceCheckUtils]: 10: Hoare triple {674#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {674#false} is VALID [2022-02-20 14:04:06,512 INFO L290 TraceCheckUtils]: 9: Hoare triple {674#false} main_~i~0#1 := 0; {674#false} is VALID [2022-02-20 14:04:06,513 INFO L290 TraceCheckUtils]: 8: Hoare triple {674#false} assume !(main_~i~0#1 < 100000); {674#false} is VALID [2022-02-20 14:04:06,513 INFO L290 TraceCheckUtils]: 7: Hoare triple {674#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {674#false} is VALID [2022-02-20 14:04:06,513 INFO L290 TraceCheckUtils]: 6: Hoare triple {674#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {674#false} is VALID [2022-02-20 14:04:06,513 INFO L290 TraceCheckUtils]: 5: Hoare triple {674#false} havoc main_~i~0#1;main_~i~0#1 := 0; {674#false} is VALID [2022-02-20 14:04:06,514 INFO L290 TraceCheckUtils]: 4: Hoare triple {933#(< |ULTIMATE.start_main_~a~0#1| 100000)} assume !(main_~a~0#1 < 100000); {674#false} is VALID [2022-02-20 14:04:06,514 INFO L290 TraceCheckUtils]: 3: Hoare triple {937#(< |ULTIMATE.start_main_~a~0#1| 99999)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {933#(< |ULTIMATE.start_main_~a~0#1| 100000)} is VALID [2022-02-20 14:04:06,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {937#(< |ULTIMATE.start_main_~a~0#1| 99999)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {937#(< |ULTIMATE.start_main_~a~0#1| 99999)} is VALID [2022-02-20 14:04:06,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {673#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem4#1, main_#t~post3#1, main_#t~mem6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~post11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~mem16#1, main_#t~post15#1, main_#t~mem18#1, main_#t~post17#1, main_#t~mem20#1, main_#t~post19#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~#a5~0#1.base, main_~#a5~0#1.offset, main_~#a6~0#1.base, main_~#a6~0#1.offset, main_~#a7~0#1.base, main_~#a7~0#1.offset, main_~#a8~0#1.base, main_~#a8~0#1.offset, main_~#a9~0#1.base, main_~#a9~0#1.offset, main_~#a0~0#1.base, main_~#a0~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a6~0#1.base, main_~#a6~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a7~0#1.base, main_~#a7~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a8~0#1.base, main_~#a8~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a9~0#1.base, main_~#a9~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a0~0#1.base, main_~#a0~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {937#(< |ULTIMATE.start_main_~a~0#1| 99999)} is VALID [2022-02-20 14:04:06,516 INFO L290 TraceCheckUtils]: 0: Hoare triple {673#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(26, 2); {673#true} is VALID [2022-02-20 14:04:06,517 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-20 14:04:06,517 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147919601] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:04:06,517 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:04:06,517 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-02-20 14:04:06,517 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082828753] [2022-02-20 14:04:06,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:04:06,518 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 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 45 [2022-02-20 14:04:06,519 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:04:06,519 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 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:04:06,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:04:06,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 14:04:06,557 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:04:06,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 14:04:06,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:04:06,558 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 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:04:06,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:06,661 INFO L93 Difference]: Finished difference Result 97 states and 119 transitions. [2022-02-20 14:04:06,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 14:04:06,661 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 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 45 [2022-02-20 14:04:06,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:04:06,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 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:04:06,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2022-02-20 14:04:06,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 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:04:06,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2022-02-20 14:04:06,665 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 101 transitions. [2022-02-20 14:04:06,739 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:04:06,742 INFO L225 Difference]: With dead ends: 97 [2022-02-20 14:04:06,742 INFO L226 Difference]: Without dead ends: 54 [2022-02-20 14:04:06,743 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:04:06,745 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:04:06,746 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 90 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:04:06,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-02-20 14:04:06,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-02-20 14:04:06,760 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:04:06,760 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 53 states have internal predecessors, (64), 0 states have call successors, (0), 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:04:06,761 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 53 states have internal predecessors, (64), 0 states have call successors, (0), 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:04:06,761 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 53 states have internal predecessors, (64), 0 states have call successors, (0), 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:04:06,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:06,764 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2022-02-20 14:04:06,764 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2022-02-20 14:04:06,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:04:06,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:04:06,764 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 53 states have internal predecessors, (64), 0 states have call successors, (0), 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 54 states. [2022-02-20 14:04:06,765 INFO L87 Difference]: Start difference. First operand has 54 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 53 states have internal predecessors, (64), 0 states have call successors, (0), 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 54 states. [2022-02-20 14:04:06,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:06,766 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2022-02-20 14:04:06,767 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2022-02-20 14:04:06,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:04:06,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:04:06,767 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:04:06,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:04:06,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 53 states have internal predecessors, (64), 0 states have call successors, (0), 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:04:06,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2022-02-20 14:04:06,769 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 45 [2022-02-20 14:04:06,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:04:06,770 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2022-02-20 14:04:06,770 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 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:04:06,770 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2022-02-20 14:04:06,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 14:04:06,771 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:04:06,771 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:04:06,794 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:04:06,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-02-20 14:04:06,992 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:04:06,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:04:06,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1235875349, now seen corresponding path program 2 times [2022-02-20 14:04:06,992 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:04:06,992 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700523791] [2022-02-20 14:04:06,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:04:06,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:04:07,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:04:07,073 INFO L290 TraceCheckUtils]: 0: Hoare triple {1272#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(26, 2); {1272#true} is VALID [2022-02-20 14:04:07,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {1272#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem4#1, main_#t~post3#1, main_#t~mem6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~post11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~mem16#1, main_#t~post15#1, main_#t~mem18#1, main_#t~post17#1, main_#t~mem20#1, main_#t~post19#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~#a5~0#1.base, main_~#a5~0#1.offset, main_~#a6~0#1.base, main_~#a6~0#1.offset, main_~#a7~0#1.base, main_~#a7~0#1.offset, main_~#a8~0#1.base, main_~#a8~0#1.offset, main_~#a9~0#1.base, main_~#a9~0#1.offset, main_~#a0~0#1.base, main_~#a0~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a6~0#1.base, main_~#a6~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a7~0#1.base, main_~#a7~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a8~0#1.base, main_~#a8~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a9~0#1.base, main_~#a9~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a0~0#1.base, main_~#a0~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {1272#true} is VALID [2022-02-20 14:04:07,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {1272#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {1272#true} is VALID [2022-02-20 14:04:07,074 INFO L290 TraceCheckUtils]: 3: Hoare triple {1272#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1272#true} is VALID [2022-02-20 14:04:07,074 INFO L290 TraceCheckUtils]: 4: Hoare triple {1272#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {1272#true} is VALID [2022-02-20 14:04:07,074 INFO L290 TraceCheckUtils]: 5: Hoare triple {1272#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1272#true} is VALID [2022-02-20 14:04:07,075 INFO L290 TraceCheckUtils]: 6: Hoare triple {1272#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {1272#true} is VALID [2022-02-20 14:04:07,075 INFO L290 TraceCheckUtils]: 7: Hoare triple {1272#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1272#true} is VALID [2022-02-20 14:04:07,075 INFO L290 TraceCheckUtils]: 8: Hoare triple {1272#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {1272#true} is VALID [2022-02-20 14:04:07,075 INFO L290 TraceCheckUtils]: 9: Hoare triple {1272#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1272#true} is VALID [2022-02-20 14:04:07,075 INFO L290 TraceCheckUtils]: 10: Hoare triple {1272#true} assume !(main_~a~0#1 < 100000); {1272#true} is VALID [2022-02-20 14:04:07,076 INFO L290 TraceCheckUtils]: 11: Hoare triple {1272#true} havoc main_~i~0#1;main_~i~0#1 := 0; {1274#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:04:07,076 INFO L290 TraceCheckUtils]: 12: Hoare triple {1274#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {1274#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:04:07,077 INFO L290 TraceCheckUtils]: 13: Hoare triple {1274#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1275#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:04:07,077 INFO L290 TraceCheckUtils]: 14: Hoare triple {1275#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 100000); {1273#false} is VALID [2022-02-20 14:04:07,077 INFO L290 TraceCheckUtils]: 15: Hoare triple {1273#false} main_~i~0#1 := 0; {1273#false} is VALID [2022-02-20 14:04:07,078 INFO L290 TraceCheckUtils]: 16: Hoare triple {1273#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {1273#false} is VALID [2022-02-20 14:04:07,078 INFO L290 TraceCheckUtils]: 17: Hoare triple {1273#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1273#false} is VALID [2022-02-20 14:04:07,078 INFO L290 TraceCheckUtils]: 18: Hoare triple {1273#false} assume !(main_~i~0#1 < 100000); {1273#false} is VALID [2022-02-20 14:04:07,078 INFO L290 TraceCheckUtils]: 19: Hoare triple {1273#false} main_~i~0#1 := 0; {1273#false} is VALID [2022-02-20 14:04:07,078 INFO L290 TraceCheckUtils]: 20: Hoare triple {1273#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {1273#false} is VALID [2022-02-20 14:04:07,078 INFO L290 TraceCheckUtils]: 21: Hoare triple {1273#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1273#false} is VALID [2022-02-20 14:04:07,079 INFO L290 TraceCheckUtils]: 22: Hoare triple {1273#false} assume !(main_~i~0#1 < 100000); {1273#false} is VALID [2022-02-20 14:04:07,079 INFO L290 TraceCheckUtils]: 23: Hoare triple {1273#false} main_~i~0#1 := 0; {1273#false} is VALID [2022-02-20 14:04:07,079 INFO L290 TraceCheckUtils]: 24: Hoare triple {1273#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {1273#false} is VALID [2022-02-20 14:04:07,079 INFO L290 TraceCheckUtils]: 25: Hoare triple {1273#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1273#false} is VALID [2022-02-20 14:04:07,079 INFO L290 TraceCheckUtils]: 26: Hoare triple {1273#false} assume !(main_~i~0#1 < 100000); {1273#false} is VALID [2022-02-20 14:04:07,080 INFO L290 TraceCheckUtils]: 27: Hoare triple {1273#false} main_~i~0#1 := 0; {1273#false} is VALID [2022-02-20 14:04:07,080 INFO L290 TraceCheckUtils]: 28: Hoare triple {1273#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {1273#false} is VALID [2022-02-20 14:04:07,080 INFO L290 TraceCheckUtils]: 29: Hoare triple {1273#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {1273#false} is VALID [2022-02-20 14:04:07,080 INFO L290 TraceCheckUtils]: 30: Hoare triple {1273#false} assume !(main_~i~0#1 < 100000); {1273#false} is VALID [2022-02-20 14:04:07,081 INFO L290 TraceCheckUtils]: 31: Hoare triple {1273#false} main_~i~0#1 := 0; {1273#false} is VALID [2022-02-20 14:04:07,081 INFO L290 TraceCheckUtils]: 32: Hoare triple {1273#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {1273#false} is VALID [2022-02-20 14:04:07,081 INFO L290 TraceCheckUtils]: 33: Hoare triple {1273#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {1273#false} is VALID [2022-02-20 14:04:07,082 INFO L290 TraceCheckUtils]: 34: Hoare triple {1273#false} assume !(main_~i~0#1 < 100000); {1273#false} is VALID [2022-02-20 14:04:07,082 INFO L290 TraceCheckUtils]: 35: Hoare triple {1273#false} main_~i~0#1 := 0; {1273#false} is VALID [2022-02-20 14:04:07,082 INFO L290 TraceCheckUtils]: 36: Hoare triple {1273#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {1273#false} is VALID [2022-02-20 14:04:07,083 INFO L290 TraceCheckUtils]: 37: Hoare triple {1273#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {1273#false} is VALID [2022-02-20 14:04:07,084 INFO L290 TraceCheckUtils]: 38: Hoare triple {1273#false} assume !(main_~i~0#1 < 100000); {1273#false} is VALID [2022-02-20 14:04:07,084 INFO L290 TraceCheckUtils]: 39: Hoare triple {1273#false} main_~i~0#1 := 0; {1273#false} is VALID [2022-02-20 14:04:07,084 INFO L290 TraceCheckUtils]: 40: Hoare triple {1273#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem18#1, main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem18#1; {1273#false} is VALID [2022-02-20 14:04:07,084 INFO L290 TraceCheckUtils]: 41: Hoare triple {1273#false} main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {1273#false} is VALID [2022-02-20 14:04:07,084 INFO L290 TraceCheckUtils]: 42: Hoare triple {1273#false} assume !(main_~i~0#1 < 100000); {1273#false} is VALID [2022-02-20 14:04:07,085 INFO L290 TraceCheckUtils]: 43: Hoare triple {1273#false} main_~i~0#1 := 0; {1273#false} is VALID [2022-02-20 14:04:07,085 INFO L290 TraceCheckUtils]: 44: Hoare triple {1273#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem20#1 := read~int(main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem20#1, main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem20#1; {1273#false} is VALID [2022-02-20 14:04:07,085 INFO L290 TraceCheckUtils]: 45: Hoare triple {1273#false} main_#t~post19#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; {1273#false} is VALID [2022-02-20 14:04:07,086 INFO L290 TraceCheckUtils]: 46: Hoare triple {1273#false} assume !(main_~i~0#1 < 100000); {1273#false} is VALID [2022-02-20 14:04:07,086 INFO L290 TraceCheckUtils]: 47: Hoare triple {1273#false} havoc main_~x~0#1;main_~x~0#1 := 0; {1273#false} is VALID [2022-02-20 14:04:07,086 INFO L290 TraceCheckUtils]: 48: Hoare triple {1273#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem22#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem23#1 := read~int(main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem22#1 == main_#t~mem23#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1273#false} is VALID [2022-02-20 14:04:07,086 INFO L290 TraceCheckUtils]: 49: Hoare triple {1273#false} assume 0 == __VERIFIER_assert_~cond#1; {1273#false} is VALID [2022-02-20 14:04:07,086 INFO L290 TraceCheckUtils]: 50: Hoare triple {1273#false} assume !false; {1273#false} is VALID [2022-02-20 14:04:07,087 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-20 14:04:07,087 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:04:07,087 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700523791] [2022-02-20 14:04:07,092 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700523791] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:04:07,093 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329734261] [2022-02-20 14:04:07,093 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:04:07,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:04:07,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:04:07,095 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:04:07,107 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:04:07,246 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:04:07,246 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:04:07,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:04:07,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:04:07,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:04:07,419 INFO L290 TraceCheckUtils]: 0: Hoare triple {1272#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(26, 2); {1272#true} is VALID [2022-02-20 14:04:07,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {1272#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem4#1, main_#t~post3#1, main_#t~mem6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~post11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~mem16#1, main_#t~post15#1, main_#t~mem18#1, main_#t~post17#1, main_#t~mem20#1, main_#t~post19#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~#a5~0#1.base, main_~#a5~0#1.offset, main_~#a6~0#1.base, main_~#a6~0#1.offset, main_~#a7~0#1.base, main_~#a7~0#1.offset, main_~#a8~0#1.base, main_~#a8~0#1.offset, main_~#a9~0#1.base, main_~#a9~0#1.offset, main_~#a0~0#1.base, main_~#a0~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a6~0#1.base, main_~#a6~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a7~0#1.base, main_~#a7~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a8~0#1.base, main_~#a8~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a9~0#1.base, main_~#a9~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a0~0#1.base, main_~#a0~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {1282#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:04:07,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {1282#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {1282#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:04:07,422 INFO L290 TraceCheckUtils]: 3: Hoare triple {1282#(<= |ULTIMATE.start_main_~a~0#1| 0)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1289#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:04:07,422 INFO L290 TraceCheckUtils]: 4: Hoare triple {1289#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {1289#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:04:07,423 INFO L290 TraceCheckUtils]: 5: Hoare triple {1289#(<= |ULTIMATE.start_main_~a~0#1| 1)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1296#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:04:07,423 INFO L290 TraceCheckUtils]: 6: Hoare triple {1296#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {1296#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:04:07,432 INFO L290 TraceCheckUtils]: 7: Hoare triple {1296#(<= |ULTIMATE.start_main_~a~0#1| 2)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1303#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:04:07,433 INFO L290 TraceCheckUtils]: 8: Hoare triple {1303#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {1303#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:04:07,433 INFO L290 TraceCheckUtils]: 9: Hoare triple {1303#(<= |ULTIMATE.start_main_~a~0#1| 3)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1310#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:04:07,434 INFO L290 TraceCheckUtils]: 10: Hoare triple {1310#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume !(main_~a~0#1 < 100000); {1273#false} is VALID [2022-02-20 14:04:07,434 INFO L290 TraceCheckUtils]: 11: Hoare triple {1273#false} havoc main_~i~0#1;main_~i~0#1 := 0; {1273#false} is VALID [2022-02-20 14:04:07,434 INFO L290 TraceCheckUtils]: 12: Hoare triple {1273#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {1273#false} is VALID [2022-02-20 14:04:07,434 INFO L290 TraceCheckUtils]: 13: Hoare triple {1273#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1273#false} is VALID [2022-02-20 14:04:07,434 INFO L290 TraceCheckUtils]: 14: Hoare triple {1273#false} assume !(main_~i~0#1 < 100000); {1273#false} is VALID [2022-02-20 14:04:07,435 INFO L290 TraceCheckUtils]: 15: Hoare triple {1273#false} main_~i~0#1 := 0; {1273#false} is VALID [2022-02-20 14:04:07,435 INFO L290 TraceCheckUtils]: 16: Hoare triple {1273#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {1273#false} is VALID [2022-02-20 14:04:07,435 INFO L290 TraceCheckUtils]: 17: Hoare triple {1273#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1273#false} is VALID [2022-02-20 14:04:07,435 INFO L290 TraceCheckUtils]: 18: Hoare triple {1273#false} assume !(main_~i~0#1 < 100000); {1273#false} is VALID [2022-02-20 14:04:07,435 INFO L290 TraceCheckUtils]: 19: Hoare triple {1273#false} main_~i~0#1 := 0; {1273#false} is VALID [2022-02-20 14:04:07,436 INFO L290 TraceCheckUtils]: 20: Hoare triple {1273#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {1273#false} is VALID [2022-02-20 14:04:07,436 INFO L290 TraceCheckUtils]: 21: Hoare triple {1273#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1273#false} is VALID [2022-02-20 14:04:07,436 INFO L290 TraceCheckUtils]: 22: Hoare triple {1273#false} assume !(main_~i~0#1 < 100000); {1273#false} is VALID [2022-02-20 14:04:07,436 INFO L290 TraceCheckUtils]: 23: Hoare triple {1273#false} main_~i~0#1 := 0; {1273#false} is VALID [2022-02-20 14:04:07,436 INFO L290 TraceCheckUtils]: 24: Hoare triple {1273#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {1273#false} is VALID [2022-02-20 14:04:07,436 INFO L290 TraceCheckUtils]: 25: Hoare triple {1273#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1273#false} is VALID [2022-02-20 14:04:07,436 INFO L290 TraceCheckUtils]: 26: Hoare triple {1273#false} assume !(main_~i~0#1 < 100000); {1273#false} is VALID [2022-02-20 14:04:07,436 INFO L290 TraceCheckUtils]: 27: Hoare triple {1273#false} main_~i~0#1 := 0; {1273#false} is VALID [2022-02-20 14:04:07,437 INFO L290 TraceCheckUtils]: 28: Hoare triple {1273#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {1273#false} is VALID [2022-02-20 14:04:07,437 INFO L290 TraceCheckUtils]: 29: Hoare triple {1273#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {1273#false} is VALID [2022-02-20 14:04:07,437 INFO L290 TraceCheckUtils]: 30: Hoare triple {1273#false} assume !(main_~i~0#1 < 100000); {1273#false} is VALID [2022-02-20 14:04:07,437 INFO L290 TraceCheckUtils]: 31: Hoare triple {1273#false} main_~i~0#1 := 0; {1273#false} is VALID [2022-02-20 14:04:07,437 INFO L290 TraceCheckUtils]: 32: Hoare triple {1273#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {1273#false} is VALID [2022-02-20 14:04:07,437 INFO L290 TraceCheckUtils]: 33: Hoare triple {1273#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {1273#false} is VALID [2022-02-20 14:04:07,437 INFO L290 TraceCheckUtils]: 34: Hoare triple {1273#false} assume !(main_~i~0#1 < 100000); {1273#false} is VALID [2022-02-20 14:04:07,437 INFO L290 TraceCheckUtils]: 35: Hoare triple {1273#false} main_~i~0#1 := 0; {1273#false} is VALID [2022-02-20 14:04:07,437 INFO L290 TraceCheckUtils]: 36: Hoare triple {1273#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {1273#false} is VALID [2022-02-20 14:04:07,438 INFO L290 TraceCheckUtils]: 37: Hoare triple {1273#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {1273#false} is VALID [2022-02-20 14:04:07,438 INFO L290 TraceCheckUtils]: 38: Hoare triple {1273#false} assume !(main_~i~0#1 < 100000); {1273#false} is VALID [2022-02-20 14:04:07,438 INFO L290 TraceCheckUtils]: 39: Hoare triple {1273#false} main_~i~0#1 := 0; {1273#false} is VALID [2022-02-20 14:04:07,438 INFO L290 TraceCheckUtils]: 40: Hoare triple {1273#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem18#1, main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem18#1; {1273#false} is VALID [2022-02-20 14:04:07,438 INFO L290 TraceCheckUtils]: 41: Hoare triple {1273#false} main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {1273#false} is VALID [2022-02-20 14:04:07,438 INFO L290 TraceCheckUtils]: 42: Hoare triple {1273#false} assume !(main_~i~0#1 < 100000); {1273#false} is VALID [2022-02-20 14:04:07,439 INFO L290 TraceCheckUtils]: 43: Hoare triple {1273#false} main_~i~0#1 := 0; {1273#false} is VALID [2022-02-20 14:04:07,439 INFO L290 TraceCheckUtils]: 44: Hoare triple {1273#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem20#1 := read~int(main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem20#1, main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem20#1; {1273#false} is VALID [2022-02-20 14:04:07,439 INFO L290 TraceCheckUtils]: 45: Hoare triple {1273#false} main_#t~post19#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; {1273#false} is VALID [2022-02-20 14:04:07,439 INFO L290 TraceCheckUtils]: 46: Hoare triple {1273#false} assume !(main_~i~0#1 < 100000); {1273#false} is VALID [2022-02-20 14:04:07,439 INFO L290 TraceCheckUtils]: 47: Hoare triple {1273#false} havoc main_~x~0#1;main_~x~0#1 := 0; {1273#false} is VALID [2022-02-20 14:04:07,439 INFO L290 TraceCheckUtils]: 48: Hoare triple {1273#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem22#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem23#1 := read~int(main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem22#1 == main_#t~mem23#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1273#false} is VALID [2022-02-20 14:04:07,439 INFO L290 TraceCheckUtils]: 49: Hoare triple {1273#false} assume 0 == __VERIFIER_assert_~cond#1; {1273#false} is VALID [2022-02-20 14:04:07,439 INFO L290 TraceCheckUtils]: 50: Hoare triple {1273#false} assume !false; {1273#false} is VALID [2022-02-20 14:04:07,440 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-20 14:04:07,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:04:07,646 INFO L290 TraceCheckUtils]: 50: Hoare triple {1273#false} assume !false; {1273#false} is VALID [2022-02-20 14:04:07,646 INFO L290 TraceCheckUtils]: 49: Hoare triple {1273#false} assume 0 == __VERIFIER_assert_~cond#1; {1273#false} is VALID [2022-02-20 14:04:07,646 INFO L290 TraceCheckUtils]: 48: Hoare triple {1273#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem22#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem23#1 := read~int(main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem22#1 == main_#t~mem23#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1273#false} is VALID [2022-02-20 14:04:07,646 INFO L290 TraceCheckUtils]: 47: Hoare triple {1273#false} havoc main_~x~0#1;main_~x~0#1 := 0; {1273#false} is VALID [2022-02-20 14:04:07,646 INFO L290 TraceCheckUtils]: 46: Hoare triple {1273#false} assume !(main_~i~0#1 < 100000); {1273#false} is VALID [2022-02-20 14:04:07,647 INFO L290 TraceCheckUtils]: 45: Hoare triple {1273#false} main_#t~post19#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; {1273#false} is VALID [2022-02-20 14:04:07,647 INFO L290 TraceCheckUtils]: 44: Hoare triple {1273#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem20#1 := read~int(main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem20#1, main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem20#1; {1273#false} is VALID [2022-02-20 14:04:07,647 INFO L290 TraceCheckUtils]: 43: Hoare triple {1273#false} main_~i~0#1 := 0; {1273#false} is VALID [2022-02-20 14:04:07,647 INFO L290 TraceCheckUtils]: 42: Hoare triple {1273#false} assume !(main_~i~0#1 < 100000); {1273#false} is VALID [2022-02-20 14:04:07,647 INFO L290 TraceCheckUtils]: 41: Hoare triple {1273#false} main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {1273#false} is VALID [2022-02-20 14:04:07,648 INFO L290 TraceCheckUtils]: 40: Hoare triple {1273#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem18#1, main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem18#1; {1273#false} is VALID [2022-02-20 14:04:07,648 INFO L290 TraceCheckUtils]: 39: Hoare triple {1273#false} main_~i~0#1 := 0; {1273#false} is VALID [2022-02-20 14:04:07,648 INFO L290 TraceCheckUtils]: 38: Hoare triple {1273#false} assume !(main_~i~0#1 < 100000); {1273#false} is VALID [2022-02-20 14:04:07,648 INFO L290 TraceCheckUtils]: 37: Hoare triple {1273#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {1273#false} is VALID [2022-02-20 14:04:07,648 INFO L290 TraceCheckUtils]: 36: Hoare triple {1273#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {1273#false} is VALID [2022-02-20 14:04:07,648 INFO L290 TraceCheckUtils]: 35: Hoare triple {1273#false} main_~i~0#1 := 0; {1273#false} is VALID [2022-02-20 14:04:07,649 INFO L290 TraceCheckUtils]: 34: Hoare triple {1273#false} assume !(main_~i~0#1 < 100000); {1273#false} is VALID [2022-02-20 14:04:07,649 INFO L290 TraceCheckUtils]: 33: Hoare triple {1273#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {1273#false} is VALID [2022-02-20 14:04:07,649 INFO L290 TraceCheckUtils]: 32: Hoare triple {1273#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {1273#false} is VALID [2022-02-20 14:04:07,649 INFO L290 TraceCheckUtils]: 31: Hoare triple {1273#false} main_~i~0#1 := 0; {1273#false} is VALID [2022-02-20 14:04:07,649 INFO L290 TraceCheckUtils]: 30: Hoare triple {1273#false} assume !(main_~i~0#1 < 100000); {1273#false} is VALID [2022-02-20 14:04:07,650 INFO L290 TraceCheckUtils]: 29: Hoare triple {1273#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {1273#false} is VALID [2022-02-20 14:04:07,650 INFO L290 TraceCheckUtils]: 28: Hoare triple {1273#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {1273#false} is VALID [2022-02-20 14:04:07,650 INFO L290 TraceCheckUtils]: 27: Hoare triple {1273#false} main_~i~0#1 := 0; {1273#false} is VALID [2022-02-20 14:04:07,650 INFO L290 TraceCheckUtils]: 26: Hoare triple {1273#false} assume !(main_~i~0#1 < 100000); {1273#false} is VALID [2022-02-20 14:04:07,650 INFO L290 TraceCheckUtils]: 25: Hoare triple {1273#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1273#false} is VALID [2022-02-20 14:04:07,651 INFO L290 TraceCheckUtils]: 24: Hoare triple {1273#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {1273#false} is VALID [2022-02-20 14:04:07,651 INFO L290 TraceCheckUtils]: 23: Hoare triple {1273#false} main_~i~0#1 := 0; {1273#false} is VALID [2022-02-20 14:04:07,651 INFO L290 TraceCheckUtils]: 22: Hoare triple {1273#false} assume !(main_~i~0#1 < 100000); {1273#false} is VALID [2022-02-20 14:04:07,651 INFO L290 TraceCheckUtils]: 21: Hoare triple {1273#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1273#false} is VALID [2022-02-20 14:04:07,651 INFO L290 TraceCheckUtils]: 20: Hoare triple {1273#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {1273#false} is VALID [2022-02-20 14:04:07,652 INFO L290 TraceCheckUtils]: 19: Hoare triple {1273#false} main_~i~0#1 := 0; {1273#false} is VALID [2022-02-20 14:04:07,652 INFO L290 TraceCheckUtils]: 18: Hoare triple {1273#false} assume !(main_~i~0#1 < 100000); {1273#false} is VALID [2022-02-20 14:04:07,652 INFO L290 TraceCheckUtils]: 17: Hoare triple {1273#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1273#false} is VALID [2022-02-20 14:04:07,652 INFO L290 TraceCheckUtils]: 16: Hoare triple {1273#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {1273#false} is VALID [2022-02-20 14:04:07,652 INFO L290 TraceCheckUtils]: 15: Hoare triple {1273#false} main_~i~0#1 := 0; {1273#false} is VALID [2022-02-20 14:04:07,652 INFO L290 TraceCheckUtils]: 14: Hoare triple {1273#false} assume !(main_~i~0#1 < 100000); {1273#false} is VALID [2022-02-20 14:04:07,653 INFO L290 TraceCheckUtils]: 13: Hoare triple {1273#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1273#false} is VALID [2022-02-20 14:04:07,653 INFO L290 TraceCheckUtils]: 12: Hoare triple {1273#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {1273#false} is VALID [2022-02-20 14:04:07,653 INFO L290 TraceCheckUtils]: 11: Hoare triple {1273#false} havoc main_~i~0#1;main_~i~0#1 := 0; {1273#false} is VALID [2022-02-20 14:04:07,653 INFO L290 TraceCheckUtils]: 10: Hoare triple {1554#(< |ULTIMATE.start_main_~a~0#1| 100000)} assume !(main_~a~0#1 < 100000); {1273#false} is VALID [2022-02-20 14:04:07,654 INFO L290 TraceCheckUtils]: 9: Hoare triple {1558#(< |ULTIMATE.start_main_~a~0#1| 99999)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1554#(< |ULTIMATE.start_main_~a~0#1| 100000)} is VALID [2022-02-20 14:04:07,654 INFO L290 TraceCheckUtils]: 8: Hoare triple {1558#(< |ULTIMATE.start_main_~a~0#1| 99999)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {1558#(< |ULTIMATE.start_main_~a~0#1| 99999)} is VALID [2022-02-20 14:04:07,655 INFO L290 TraceCheckUtils]: 7: Hoare triple {1565#(< |ULTIMATE.start_main_~a~0#1| 99998)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1558#(< |ULTIMATE.start_main_~a~0#1| 99999)} is VALID [2022-02-20 14:04:07,655 INFO L290 TraceCheckUtils]: 6: Hoare triple {1565#(< |ULTIMATE.start_main_~a~0#1| 99998)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {1565#(< |ULTIMATE.start_main_~a~0#1| 99998)} is VALID [2022-02-20 14:04:07,656 INFO L290 TraceCheckUtils]: 5: Hoare triple {1572#(< |ULTIMATE.start_main_~a~0#1| 99997)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1565#(< |ULTIMATE.start_main_~a~0#1| 99998)} is VALID [2022-02-20 14:04:07,656 INFO L290 TraceCheckUtils]: 4: Hoare triple {1572#(< |ULTIMATE.start_main_~a~0#1| 99997)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {1572#(< |ULTIMATE.start_main_~a~0#1| 99997)} is VALID [2022-02-20 14:04:07,657 INFO L290 TraceCheckUtils]: 3: Hoare triple {1579#(< |ULTIMATE.start_main_~a~0#1| 99996)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1572#(< |ULTIMATE.start_main_~a~0#1| 99997)} is VALID [2022-02-20 14:04:07,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {1579#(< |ULTIMATE.start_main_~a~0#1| 99996)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {1579#(< |ULTIMATE.start_main_~a~0#1| 99996)} is VALID [2022-02-20 14:04:07,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {1272#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem4#1, main_#t~post3#1, main_#t~mem6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~post11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~mem16#1, main_#t~post15#1, main_#t~mem18#1, main_#t~post17#1, main_#t~mem20#1, main_#t~post19#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~#a5~0#1.base, main_~#a5~0#1.offset, main_~#a6~0#1.base, main_~#a6~0#1.offset, main_~#a7~0#1.base, main_~#a7~0#1.offset, main_~#a8~0#1.base, main_~#a8~0#1.offset, main_~#a9~0#1.base, main_~#a9~0#1.offset, main_~#a0~0#1.base, main_~#a0~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a6~0#1.base, main_~#a6~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a7~0#1.base, main_~#a7~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a8~0#1.base, main_~#a8~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a9~0#1.base, main_~#a9~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a0~0#1.base, main_~#a0~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {1579#(< |ULTIMATE.start_main_~a~0#1| 99996)} is VALID [2022-02-20 14:04:07,659 INFO L290 TraceCheckUtils]: 0: Hoare triple {1272#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(26, 2); {1272#true} is VALID [2022-02-20 14:04:07,659 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-20 14:04:07,659 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329734261] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:04:07,659 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:04:07,659 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2022-02-20 14:04:07,660 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593310343] [2022-02-20 14:04:07,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:04:07,663 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 0 states have call successors, (0), 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 51 [2022-02-20 14:04:07,666 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:04:07,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 0 states have call successors, (0), 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:04:07,719 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:04:07,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 14:04:07,720 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:04:07,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 14:04:07,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-02-20 14:04:07,721 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 0 states have call successors, (0), 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:04:08,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:08,126 INFO L93 Difference]: Finished difference Result 136 states and 170 transitions. [2022-02-20 14:04:08,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 14:04:08,126 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 0 states have call successors, (0), 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 51 [2022-02-20 14:04:08,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:04:08,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 0 states have call successors, (0), 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:04:08,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 161 transitions. [2022-02-20 14:04:08,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 0 states have call successors, (0), 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:04:08,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 161 transitions. [2022-02-20 14:04:08,131 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 161 transitions. [2022-02-20 14:04:08,254 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:04:08,256 INFO L225 Difference]: With dead ends: 136 [2022-02-20 14:04:08,256 INFO L226 Difference]: Without dead ends: 93 [2022-02-20 14:04:08,257 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-02-20 14:04:08,258 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 36 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 14:04:08,258 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 167 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 14:04:08,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-02-20 14:04:08,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 84. [2022-02-20 14:04:08,279 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:04:08,279 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 84 states, 83 states have (on average 1.1325301204819278) internal successors, (94), 83 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:08,279 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 84 states, 83 states have (on average 1.1325301204819278) internal successors, (94), 83 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:08,280 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 84 states, 83 states have (on average 1.1325301204819278) internal successors, (94), 83 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:08,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:08,282 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2022-02-20 14:04:08,282 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2022-02-20 14:04:08,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:04:08,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:04:08,283 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 83 states have (on average 1.1325301204819278) internal successors, (94), 83 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 93 states. [2022-02-20 14:04:08,283 INFO L87 Difference]: Start difference. First operand has 84 states, 83 states have (on average 1.1325301204819278) internal successors, (94), 83 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 93 states. [2022-02-20 14:04:08,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:08,286 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2022-02-20 14:04:08,286 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2022-02-20 14:04:08,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:04:08,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:04:08,286 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:04:08,287 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:04:08,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.1325301204819278) internal successors, (94), 83 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:08,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2022-02-20 14:04:08,289 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 51 [2022-02-20 14:04:08,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:04:08,290 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2022-02-20 14:04:08,290 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 0 states have call successors, (0), 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:04:08,290 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2022-02-20 14:04:08,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-02-20 14:04:08,291 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:04:08,291 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:04:08,314 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:04:08,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:04:08,507 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:04:08,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:04:08,508 INFO L85 PathProgramCache]: Analyzing trace with hash 2120427341, now seen corresponding path program 3 times [2022-02-20 14:04:08,508 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:04:08,508 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825633088] [2022-02-20 14:04:08,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:04:08,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:04:08,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:04:08,720 INFO L290 TraceCheckUtils]: 0: Hoare triple {2091#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(26, 2); {2091#true} is VALID [2022-02-20 14:04:08,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {2091#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem4#1, main_#t~post3#1, main_#t~mem6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~post11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~mem16#1, main_#t~post15#1, main_#t~mem18#1, main_#t~post17#1, main_#t~mem20#1, main_#t~post19#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~#a5~0#1.base, main_~#a5~0#1.offset, main_~#a6~0#1.base, main_~#a6~0#1.offset, main_~#a7~0#1.base, main_~#a7~0#1.offset, main_~#a8~0#1.base, main_~#a8~0#1.offset, main_~#a9~0#1.base, main_~#a9~0#1.offset, main_~#a0~0#1.base, main_~#a0~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a6~0#1.base, main_~#a6~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a7~0#1.base, main_~#a7~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a8~0#1.base, main_~#a8~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a9~0#1.base, main_~#a9~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a0~0#1.base, main_~#a0~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {2093#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:04:08,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {2093#(= |ULTIMATE.start_main_~a~0#1| 0)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {2093#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:04:08,722 INFO L290 TraceCheckUtils]: 3: Hoare triple {2093#(= |ULTIMATE.start_main_~a~0#1| 0)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2094#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:04:08,723 INFO L290 TraceCheckUtils]: 4: Hoare triple {2094#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {2094#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:04:08,723 INFO L290 TraceCheckUtils]: 5: Hoare triple {2094#(<= |ULTIMATE.start_main_~a~0#1| 1)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2095#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:04:08,724 INFO L290 TraceCheckUtils]: 6: Hoare triple {2095#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {2095#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:04:08,724 INFO L290 TraceCheckUtils]: 7: Hoare triple {2095#(<= |ULTIMATE.start_main_~a~0#1| 2)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2096#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:04:08,727 INFO L290 TraceCheckUtils]: 8: Hoare triple {2096#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {2096#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:04:08,729 INFO L290 TraceCheckUtils]: 9: Hoare triple {2096#(<= |ULTIMATE.start_main_~a~0#1| 3)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2097#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:04:08,729 INFO L290 TraceCheckUtils]: 10: Hoare triple {2097#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {2097#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:04:08,730 INFO L290 TraceCheckUtils]: 11: Hoare triple {2097#(<= |ULTIMATE.start_main_~a~0#1| 4)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2098#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-20 14:04:08,730 INFO L290 TraceCheckUtils]: 12: Hoare triple {2098#(<= |ULTIMATE.start_main_~a~0#1| 5)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {2098#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-20 14:04:08,731 INFO L290 TraceCheckUtils]: 13: Hoare triple {2098#(<= |ULTIMATE.start_main_~a~0#1| 5)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2099#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-20 14:04:08,731 INFO L290 TraceCheckUtils]: 14: Hoare triple {2099#(<= |ULTIMATE.start_main_~a~0#1| 6)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {2099#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-20 14:04:08,732 INFO L290 TraceCheckUtils]: 15: Hoare triple {2099#(<= |ULTIMATE.start_main_~a~0#1| 6)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2100#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-20 14:04:08,732 INFO L290 TraceCheckUtils]: 16: Hoare triple {2100#(<= |ULTIMATE.start_main_~a~0#1| 7)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {2100#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-20 14:04:08,733 INFO L290 TraceCheckUtils]: 17: Hoare triple {2100#(<= |ULTIMATE.start_main_~a~0#1| 7)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2101#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-20 14:04:08,733 INFO L290 TraceCheckUtils]: 18: Hoare triple {2101#(<= |ULTIMATE.start_main_~a~0#1| 8)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {2101#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-20 14:04:08,734 INFO L290 TraceCheckUtils]: 19: Hoare triple {2101#(<= |ULTIMATE.start_main_~a~0#1| 8)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2102#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-20 14:04:08,734 INFO L290 TraceCheckUtils]: 20: Hoare triple {2102#(<= |ULTIMATE.start_main_~a~0#1| 9)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {2102#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-20 14:04:08,734 INFO L290 TraceCheckUtils]: 21: Hoare triple {2102#(<= |ULTIMATE.start_main_~a~0#1| 9)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2103#(<= |ULTIMATE.start_main_~a~0#1| 10)} is VALID [2022-02-20 14:04:08,735 INFO L290 TraceCheckUtils]: 22: Hoare triple {2103#(<= |ULTIMATE.start_main_~a~0#1| 10)} assume !(main_~a~0#1 < 100000); {2092#false} is VALID [2022-02-20 14:04:08,735 INFO L290 TraceCheckUtils]: 23: Hoare triple {2092#false} havoc main_~i~0#1;main_~i~0#1 := 0; {2092#false} is VALID [2022-02-20 14:04:08,735 INFO L290 TraceCheckUtils]: 24: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {2092#false} is VALID [2022-02-20 14:04:08,736 INFO L290 TraceCheckUtils]: 25: Hoare triple {2092#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2092#false} is VALID [2022-02-20 14:04:08,736 INFO L290 TraceCheckUtils]: 26: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {2092#false} is VALID [2022-02-20 14:04:08,736 INFO L290 TraceCheckUtils]: 27: Hoare triple {2092#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2092#false} is VALID [2022-02-20 14:04:08,736 INFO L290 TraceCheckUtils]: 28: Hoare triple {2092#false} assume !(main_~i~0#1 < 100000); {2092#false} is VALID [2022-02-20 14:04:08,736 INFO L290 TraceCheckUtils]: 29: Hoare triple {2092#false} main_~i~0#1 := 0; {2092#false} is VALID [2022-02-20 14:04:08,736 INFO L290 TraceCheckUtils]: 30: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {2092#false} is VALID [2022-02-20 14:04:08,737 INFO L290 TraceCheckUtils]: 31: Hoare triple {2092#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2092#false} is VALID [2022-02-20 14:04:08,737 INFO L290 TraceCheckUtils]: 32: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {2092#false} is VALID [2022-02-20 14:04:08,737 INFO L290 TraceCheckUtils]: 33: Hoare triple {2092#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2092#false} is VALID [2022-02-20 14:04:08,737 INFO L290 TraceCheckUtils]: 34: Hoare triple {2092#false} assume !(main_~i~0#1 < 100000); {2092#false} is VALID [2022-02-20 14:04:08,737 INFO L290 TraceCheckUtils]: 35: Hoare triple {2092#false} main_~i~0#1 := 0; {2092#false} is VALID [2022-02-20 14:04:08,737 INFO L290 TraceCheckUtils]: 36: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {2092#false} is VALID [2022-02-20 14:04:08,738 INFO L290 TraceCheckUtils]: 37: Hoare triple {2092#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2092#false} is VALID [2022-02-20 14:04:08,738 INFO L290 TraceCheckUtils]: 38: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {2092#false} is VALID [2022-02-20 14:04:08,738 INFO L290 TraceCheckUtils]: 39: Hoare triple {2092#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2092#false} is VALID [2022-02-20 14:04:08,738 INFO L290 TraceCheckUtils]: 40: Hoare triple {2092#false} assume !(main_~i~0#1 < 100000); {2092#false} is VALID [2022-02-20 14:04:08,738 INFO L290 TraceCheckUtils]: 41: Hoare triple {2092#false} main_~i~0#1 := 0; {2092#false} is VALID [2022-02-20 14:04:08,738 INFO L290 TraceCheckUtils]: 42: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {2092#false} is VALID [2022-02-20 14:04:08,739 INFO L290 TraceCheckUtils]: 43: Hoare triple {2092#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2092#false} is VALID [2022-02-20 14:04:08,739 INFO L290 TraceCheckUtils]: 44: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {2092#false} is VALID [2022-02-20 14:04:08,739 INFO L290 TraceCheckUtils]: 45: Hoare triple {2092#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2092#false} is VALID [2022-02-20 14:04:08,739 INFO L290 TraceCheckUtils]: 46: Hoare triple {2092#false} assume !(main_~i~0#1 < 100000); {2092#false} is VALID [2022-02-20 14:04:08,739 INFO L290 TraceCheckUtils]: 47: Hoare triple {2092#false} main_~i~0#1 := 0; {2092#false} is VALID [2022-02-20 14:04:08,739 INFO L290 TraceCheckUtils]: 48: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {2092#false} is VALID [2022-02-20 14:04:08,740 INFO L290 TraceCheckUtils]: 49: Hoare triple {2092#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {2092#false} is VALID [2022-02-20 14:04:08,740 INFO L290 TraceCheckUtils]: 50: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {2092#false} is VALID [2022-02-20 14:04:08,740 INFO L290 TraceCheckUtils]: 51: Hoare triple {2092#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {2092#false} is VALID [2022-02-20 14:04:08,740 INFO L290 TraceCheckUtils]: 52: Hoare triple {2092#false} assume !(main_~i~0#1 < 100000); {2092#false} is VALID [2022-02-20 14:04:08,740 INFO L290 TraceCheckUtils]: 53: Hoare triple {2092#false} main_~i~0#1 := 0; {2092#false} is VALID [2022-02-20 14:04:08,741 INFO L290 TraceCheckUtils]: 54: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {2092#false} is VALID [2022-02-20 14:04:08,741 INFO L290 TraceCheckUtils]: 55: Hoare triple {2092#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2092#false} is VALID [2022-02-20 14:04:08,741 INFO L290 TraceCheckUtils]: 56: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {2092#false} is VALID [2022-02-20 14:04:08,741 INFO L290 TraceCheckUtils]: 57: Hoare triple {2092#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2092#false} is VALID [2022-02-20 14:04:08,741 INFO L290 TraceCheckUtils]: 58: Hoare triple {2092#false} assume !(main_~i~0#1 < 100000); {2092#false} is VALID [2022-02-20 14:04:08,741 INFO L290 TraceCheckUtils]: 59: Hoare triple {2092#false} main_~i~0#1 := 0; {2092#false} is VALID [2022-02-20 14:04:08,742 INFO L290 TraceCheckUtils]: 60: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {2092#false} is VALID [2022-02-20 14:04:08,742 INFO L290 TraceCheckUtils]: 61: Hoare triple {2092#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {2092#false} is VALID [2022-02-20 14:04:08,742 INFO L290 TraceCheckUtils]: 62: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {2092#false} is VALID [2022-02-20 14:04:08,742 INFO L290 TraceCheckUtils]: 63: Hoare triple {2092#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {2092#false} is VALID [2022-02-20 14:04:08,742 INFO L290 TraceCheckUtils]: 64: Hoare triple {2092#false} assume !(main_~i~0#1 < 100000); {2092#false} is VALID [2022-02-20 14:04:08,742 INFO L290 TraceCheckUtils]: 65: Hoare triple {2092#false} main_~i~0#1 := 0; {2092#false} is VALID [2022-02-20 14:04:08,743 INFO L290 TraceCheckUtils]: 66: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem18#1, main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem18#1; {2092#false} is VALID [2022-02-20 14:04:08,743 INFO L290 TraceCheckUtils]: 67: Hoare triple {2092#false} main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {2092#false} is VALID [2022-02-20 14:04:08,743 INFO L290 TraceCheckUtils]: 68: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem18#1, main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem18#1; {2092#false} is VALID [2022-02-20 14:04:08,743 INFO L290 TraceCheckUtils]: 69: Hoare triple {2092#false} main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {2092#false} is VALID [2022-02-20 14:04:08,743 INFO L290 TraceCheckUtils]: 70: Hoare triple {2092#false} assume !(main_~i~0#1 < 100000); {2092#false} is VALID [2022-02-20 14:04:08,743 INFO L290 TraceCheckUtils]: 71: Hoare triple {2092#false} main_~i~0#1 := 0; {2092#false} is VALID [2022-02-20 14:04:08,744 INFO L290 TraceCheckUtils]: 72: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem20#1 := read~int(main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem20#1, main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem20#1; {2092#false} is VALID [2022-02-20 14:04:08,744 INFO L290 TraceCheckUtils]: 73: Hoare triple {2092#false} main_#t~post19#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; {2092#false} is VALID [2022-02-20 14:04:08,744 INFO L290 TraceCheckUtils]: 74: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem20#1 := read~int(main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem20#1, main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem20#1; {2092#false} is VALID [2022-02-20 14:04:08,744 INFO L290 TraceCheckUtils]: 75: Hoare triple {2092#false} main_#t~post19#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; {2092#false} is VALID [2022-02-20 14:04:08,744 INFO L290 TraceCheckUtils]: 76: Hoare triple {2092#false} assume !(main_~i~0#1 < 100000); {2092#false} is VALID [2022-02-20 14:04:08,744 INFO L290 TraceCheckUtils]: 77: Hoare triple {2092#false} havoc main_~x~0#1;main_~x~0#1 := 0; {2092#false} is VALID [2022-02-20 14:04:08,745 INFO L290 TraceCheckUtils]: 78: Hoare triple {2092#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem22#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem23#1 := read~int(main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem22#1 == main_#t~mem23#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2092#false} is VALID [2022-02-20 14:04:08,745 INFO L290 TraceCheckUtils]: 79: Hoare triple {2092#false} assume 0 == __VERIFIER_assert_~cond#1; {2092#false} is VALID [2022-02-20 14:04:08,745 INFO L290 TraceCheckUtils]: 80: Hoare triple {2092#false} assume !false; {2092#false} is VALID [2022-02-20 14:04:08,745 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-02-20 14:04:08,745 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:04:08,746 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825633088] [2022-02-20 14:04:08,746 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825633088] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:04:08,746 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118387877] [2022-02-20 14:04:08,746 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 14:04:08,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:04:08,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:04:08,748 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:04:08,758 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:04:08,940 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-02-20 14:04:08,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:04:08,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 14:04:08,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:04:08,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:04:09,172 INFO L290 TraceCheckUtils]: 0: Hoare triple {2091#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(26, 2); {2091#true} is VALID [2022-02-20 14:04:09,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {2091#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem4#1, main_#t~post3#1, main_#t~mem6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~post11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~mem16#1, main_#t~post15#1, main_#t~mem18#1, main_#t~post17#1, main_#t~mem20#1, main_#t~post19#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~#a5~0#1.base, main_~#a5~0#1.offset, main_~#a6~0#1.base, main_~#a6~0#1.offset, main_~#a7~0#1.base, main_~#a7~0#1.offset, main_~#a8~0#1.base, main_~#a8~0#1.offset, main_~#a9~0#1.base, main_~#a9~0#1.offset, main_~#a0~0#1.base, main_~#a0~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a6~0#1.base, main_~#a6~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a7~0#1.base, main_~#a7~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a8~0#1.base, main_~#a8~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a9~0#1.base, main_~#a9~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a0~0#1.base, main_~#a0~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {2091#true} is VALID [2022-02-20 14:04:09,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {2091#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {2091#true} is VALID [2022-02-20 14:04:09,173 INFO L290 TraceCheckUtils]: 3: Hoare triple {2091#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2091#true} is VALID [2022-02-20 14:04:09,173 INFO L290 TraceCheckUtils]: 4: Hoare triple {2091#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {2091#true} is VALID [2022-02-20 14:04:09,173 INFO L290 TraceCheckUtils]: 5: Hoare triple {2091#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2091#true} is VALID [2022-02-20 14:04:09,173 INFO L290 TraceCheckUtils]: 6: Hoare triple {2091#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {2091#true} is VALID [2022-02-20 14:04:09,174 INFO L290 TraceCheckUtils]: 7: Hoare triple {2091#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2091#true} is VALID [2022-02-20 14:04:09,174 INFO L290 TraceCheckUtils]: 8: Hoare triple {2091#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {2091#true} is VALID [2022-02-20 14:04:09,174 INFO L290 TraceCheckUtils]: 9: Hoare triple {2091#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2091#true} is VALID [2022-02-20 14:04:09,174 INFO L290 TraceCheckUtils]: 10: Hoare triple {2091#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {2091#true} is VALID [2022-02-20 14:04:09,174 INFO L290 TraceCheckUtils]: 11: Hoare triple {2091#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2091#true} is VALID [2022-02-20 14:04:09,174 INFO L290 TraceCheckUtils]: 12: Hoare triple {2091#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {2091#true} is VALID [2022-02-20 14:04:09,175 INFO L290 TraceCheckUtils]: 13: Hoare triple {2091#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2091#true} is VALID [2022-02-20 14:04:09,175 INFO L290 TraceCheckUtils]: 14: Hoare triple {2091#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {2091#true} is VALID [2022-02-20 14:04:09,175 INFO L290 TraceCheckUtils]: 15: Hoare triple {2091#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2091#true} is VALID [2022-02-20 14:04:09,175 INFO L290 TraceCheckUtils]: 16: Hoare triple {2091#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {2091#true} is VALID [2022-02-20 14:04:09,175 INFO L290 TraceCheckUtils]: 17: Hoare triple {2091#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2091#true} is VALID [2022-02-20 14:04:09,175 INFO L290 TraceCheckUtils]: 18: Hoare triple {2091#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {2091#true} is VALID [2022-02-20 14:04:09,176 INFO L290 TraceCheckUtils]: 19: Hoare triple {2091#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2091#true} is VALID [2022-02-20 14:04:09,176 INFO L290 TraceCheckUtils]: 20: Hoare triple {2091#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {2091#true} is VALID [2022-02-20 14:04:09,176 INFO L290 TraceCheckUtils]: 21: Hoare triple {2091#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2091#true} is VALID [2022-02-20 14:04:09,176 INFO L290 TraceCheckUtils]: 22: Hoare triple {2091#true} assume !(main_~a~0#1 < 100000); {2091#true} is VALID [2022-02-20 14:04:09,176 INFO L290 TraceCheckUtils]: 23: Hoare triple {2091#true} havoc main_~i~0#1;main_~i~0#1 := 0; {2091#true} is VALID [2022-02-20 14:04:09,176 INFO L290 TraceCheckUtils]: 24: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {2091#true} is VALID [2022-02-20 14:04:09,177 INFO L290 TraceCheckUtils]: 25: Hoare triple {2091#true} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2091#true} is VALID [2022-02-20 14:04:09,177 INFO L290 TraceCheckUtils]: 26: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {2091#true} is VALID [2022-02-20 14:04:09,177 INFO L290 TraceCheckUtils]: 27: Hoare triple {2091#true} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2091#true} is VALID [2022-02-20 14:04:09,177 INFO L290 TraceCheckUtils]: 28: Hoare triple {2091#true} assume !(main_~i~0#1 < 100000); {2091#true} is VALID [2022-02-20 14:04:09,177 INFO L290 TraceCheckUtils]: 29: Hoare triple {2091#true} main_~i~0#1 := 0; {2091#true} is VALID [2022-02-20 14:04:09,177 INFO L290 TraceCheckUtils]: 30: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {2091#true} is VALID [2022-02-20 14:04:09,177 INFO L290 TraceCheckUtils]: 31: Hoare triple {2091#true} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2091#true} is VALID [2022-02-20 14:04:09,178 INFO L290 TraceCheckUtils]: 32: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {2091#true} is VALID [2022-02-20 14:04:09,178 INFO L290 TraceCheckUtils]: 33: Hoare triple {2091#true} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2091#true} is VALID [2022-02-20 14:04:09,178 INFO L290 TraceCheckUtils]: 34: Hoare triple {2091#true} assume !(main_~i~0#1 < 100000); {2091#true} is VALID [2022-02-20 14:04:09,178 INFO L290 TraceCheckUtils]: 35: Hoare triple {2091#true} main_~i~0#1 := 0; {2091#true} is VALID [2022-02-20 14:04:09,178 INFO L290 TraceCheckUtils]: 36: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {2091#true} is VALID [2022-02-20 14:04:09,178 INFO L290 TraceCheckUtils]: 37: Hoare triple {2091#true} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2091#true} is VALID [2022-02-20 14:04:09,179 INFO L290 TraceCheckUtils]: 38: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {2091#true} is VALID [2022-02-20 14:04:09,179 INFO L290 TraceCheckUtils]: 39: Hoare triple {2091#true} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2091#true} is VALID [2022-02-20 14:04:09,179 INFO L290 TraceCheckUtils]: 40: Hoare triple {2091#true} assume !(main_~i~0#1 < 100000); {2091#true} is VALID [2022-02-20 14:04:09,179 INFO L290 TraceCheckUtils]: 41: Hoare triple {2091#true} main_~i~0#1 := 0; {2091#true} is VALID [2022-02-20 14:04:09,179 INFO L290 TraceCheckUtils]: 42: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {2091#true} is VALID [2022-02-20 14:04:09,179 INFO L290 TraceCheckUtils]: 43: Hoare triple {2091#true} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2091#true} is VALID [2022-02-20 14:04:09,180 INFO L290 TraceCheckUtils]: 44: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {2091#true} is VALID [2022-02-20 14:04:09,180 INFO L290 TraceCheckUtils]: 45: Hoare triple {2091#true} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2091#true} is VALID [2022-02-20 14:04:09,180 INFO L290 TraceCheckUtils]: 46: Hoare triple {2091#true} assume !(main_~i~0#1 < 100000); {2091#true} is VALID [2022-02-20 14:04:09,180 INFO L290 TraceCheckUtils]: 47: Hoare triple {2091#true} main_~i~0#1 := 0; {2091#true} is VALID [2022-02-20 14:04:09,180 INFO L290 TraceCheckUtils]: 48: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {2091#true} is VALID [2022-02-20 14:04:09,180 INFO L290 TraceCheckUtils]: 49: Hoare triple {2091#true} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {2091#true} is VALID [2022-02-20 14:04:09,181 INFO L290 TraceCheckUtils]: 50: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {2091#true} is VALID [2022-02-20 14:04:09,181 INFO L290 TraceCheckUtils]: 51: Hoare triple {2091#true} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {2091#true} is VALID [2022-02-20 14:04:09,181 INFO L290 TraceCheckUtils]: 52: Hoare triple {2091#true} assume !(main_~i~0#1 < 100000); {2091#true} is VALID [2022-02-20 14:04:09,181 INFO L290 TraceCheckUtils]: 53: Hoare triple {2091#true} main_~i~0#1 := 0; {2091#true} is VALID [2022-02-20 14:04:09,181 INFO L290 TraceCheckUtils]: 54: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {2091#true} is VALID [2022-02-20 14:04:09,181 INFO L290 TraceCheckUtils]: 55: Hoare triple {2091#true} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2091#true} is VALID [2022-02-20 14:04:09,182 INFO L290 TraceCheckUtils]: 56: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {2091#true} is VALID [2022-02-20 14:04:09,182 INFO L290 TraceCheckUtils]: 57: Hoare triple {2091#true} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2091#true} is VALID [2022-02-20 14:04:09,182 INFO L290 TraceCheckUtils]: 58: Hoare triple {2091#true} assume !(main_~i~0#1 < 100000); {2091#true} is VALID [2022-02-20 14:04:09,182 INFO L290 TraceCheckUtils]: 59: Hoare triple {2091#true} main_~i~0#1 := 0; {2091#true} is VALID [2022-02-20 14:04:09,182 INFO L290 TraceCheckUtils]: 60: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {2091#true} is VALID [2022-02-20 14:04:09,182 INFO L290 TraceCheckUtils]: 61: Hoare triple {2091#true} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {2091#true} is VALID [2022-02-20 14:04:09,183 INFO L290 TraceCheckUtils]: 62: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {2091#true} is VALID [2022-02-20 14:04:09,183 INFO L290 TraceCheckUtils]: 63: Hoare triple {2091#true} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {2091#true} is VALID [2022-02-20 14:04:09,183 INFO L290 TraceCheckUtils]: 64: Hoare triple {2091#true} assume !(main_~i~0#1 < 100000); {2091#true} is VALID [2022-02-20 14:04:09,188 INFO L290 TraceCheckUtils]: 65: Hoare triple {2091#true} main_~i~0#1 := 0; {2302#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:04:09,189 INFO L290 TraceCheckUtils]: 66: Hoare triple {2302#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem18#1, main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem18#1; {2302#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:04:09,189 INFO L290 TraceCheckUtils]: 67: Hoare triple {2302#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {2309#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:04:09,190 INFO L290 TraceCheckUtils]: 68: Hoare triple {2309#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem18#1, main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem18#1; {2309#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:04:09,190 INFO L290 TraceCheckUtils]: 69: Hoare triple {2309#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {2316#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:04:09,191 INFO L290 TraceCheckUtils]: 70: Hoare triple {2316#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_~i~0#1 < 100000); {2092#false} is VALID [2022-02-20 14:04:09,191 INFO L290 TraceCheckUtils]: 71: Hoare triple {2092#false} main_~i~0#1 := 0; {2092#false} is VALID [2022-02-20 14:04:09,191 INFO L290 TraceCheckUtils]: 72: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem20#1 := read~int(main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem20#1, main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem20#1; {2092#false} is VALID [2022-02-20 14:04:09,191 INFO L290 TraceCheckUtils]: 73: Hoare triple {2092#false} main_#t~post19#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; {2092#false} is VALID [2022-02-20 14:04:09,191 INFO L290 TraceCheckUtils]: 74: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem20#1 := read~int(main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem20#1, main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem20#1; {2092#false} is VALID [2022-02-20 14:04:09,191 INFO L290 TraceCheckUtils]: 75: Hoare triple {2092#false} main_#t~post19#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; {2092#false} is VALID [2022-02-20 14:04:09,192 INFO L290 TraceCheckUtils]: 76: Hoare triple {2092#false} assume !(main_~i~0#1 < 100000); {2092#false} is VALID [2022-02-20 14:04:09,192 INFO L290 TraceCheckUtils]: 77: Hoare triple {2092#false} havoc main_~x~0#1;main_~x~0#1 := 0; {2092#false} is VALID [2022-02-20 14:04:09,192 INFO L290 TraceCheckUtils]: 78: Hoare triple {2092#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem22#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem23#1 := read~int(main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem22#1 == main_#t~mem23#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2092#false} is VALID [2022-02-20 14:04:09,192 INFO L290 TraceCheckUtils]: 79: Hoare triple {2092#false} assume 0 == __VERIFIER_assert_~cond#1; {2092#false} is VALID [2022-02-20 14:04:09,192 INFO L290 TraceCheckUtils]: 80: Hoare triple {2092#false} assume !false; {2092#false} is VALID [2022-02-20 14:04:09,193 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2022-02-20 14:04:09,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:04:09,387 INFO L290 TraceCheckUtils]: 80: Hoare triple {2092#false} assume !false; {2092#false} is VALID [2022-02-20 14:04:09,387 INFO L290 TraceCheckUtils]: 79: Hoare triple {2092#false} assume 0 == __VERIFIER_assert_~cond#1; {2092#false} is VALID [2022-02-20 14:04:09,387 INFO L290 TraceCheckUtils]: 78: Hoare triple {2092#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem22#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem23#1 := read~int(main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem22#1 == main_#t~mem23#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2092#false} is VALID [2022-02-20 14:04:09,388 INFO L290 TraceCheckUtils]: 77: Hoare triple {2092#false} havoc main_~x~0#1;main_~x~0#1 := 0; {2092#false} is VALID [2022-02-20 14:04:09,388 INFO L290 TraceCheckUtils]: 76: Hoare triple {2092#false} assume !(main_~i~0#1 < 100000); {2092#false} is VALID [2022-02-20 14:04:09,388 INFO L290 TraceCheckUtils]: 75: Hoare triple {2092#false} main_#t~post19#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; {2092#false} is VALID [2022-02-20 14:04:09,388 INFO L290 TraceCheckUtils]: 74: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem20#1 := read~int(main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem20#1, main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem20#1; {2092#false} is VALID [2022-02-20 14:04:09,388 INFO L290 TraceCheckUtils]: 73: Hoare triple {2092#false} main_#t~post19#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; {2092#false} is VALID [2022-02-20 14:04:09,388 INFO L290 TraceCheckUtils]: 72: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem20#1 := read~int(main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem20#1, main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem20#1; {2092#false} is VALID [2022-02-20 14:04:09,389 INFO L290 TraceCheckUtils]: 71: Hoare triple {2092#false} main_~i~0#1 := 0; {2092#false} is VALID [2022-02-20 14:04:09,389 INFO L290 TraceCheckUtils]: 70: Hoare triple {2380#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {2092#false} is VALID [2022-02-20 14:04:09,390 INFO L290 TraceCheckUtils]: 69: Hoare triple {2384#(< |ULTIMATE.start_main_~i~0#1| 99999)} main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {2380#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:04:09,390 INFO L290 TraceCheckUtils]: 68: Hoare triple {2384#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume !!(main_~i~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem18#1, main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem18#1; {2384#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:04:09,390 INFO L290 TraceCheckUtils]: 67: Hoare triple {2391#(< |ULTIMATE.start_main_~i~0#1| 99998)} main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {2384#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:04:09,391 INFO L290 TraceCheckUtils]: 66: Hoare triple {2391#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~i~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem18#1, main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem18#1; {2391#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:04:09,391 INFO L290 TraceCheckUtils]: 65: Hoare triple {2091#true} main_~i~0#1 := 0; {2391#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:04:09,391 INFO L290 TraceCheckUtils]: 64: Hoare triple {2091#true} assume !(main_~i~0#1 < 100000); {2091#true} is VALID [2022-02-20 14:04:09,391 INFO L290 TraceCheckUtils]: 63: Hoare triple {2091#true} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {2091#true} is VALID [2022-02-20 14:04:09,392 INFO L290 TraceCheckUtils]: 62: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {2091#true} is VALID [2022-02-20 14:04:09,392 INFO L290 TraceCheckUtils]: 61: Hoare triple {2091#true} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {2091#true} is VALID [2022-02-20 14:04:09,392 INFO L290 TraceCheckUtils]: 60: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {2091#true} is VALID [2022-02-20 14:04:09,392 INFO L290 TraceCheckUtils]: 59: Hoare triple {2091#true} main_~i~0#1 := 0; {2091#true} is VALID [2022-02-20 14:04:09,392 INFO L290 TraceCheckUtils]: 58: Hoare triple {2091#true} assume !(main_~i~0#1 < 100000); {2091#true} is VALID [2022-02-20 14:04:09,392 INFO L290 TraceCheckUtils]: 57: Hoare triple {2091#true} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2091#true} is VALID [2022-02-20 14:04:09,393 INFO L290 TraceCheckUtils]: 56: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {2091#true} is VALID [2022-02-20 14:04:09,393 INFO L290 TraceCheckUtils]: 55: Hoare triple {2091#true} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2091#true} is VALID [2022-02-20 14:04:09,393 INFO L290 TraceCheckUtils]: 54: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {2091#true} is VALID [2022-02-20 14:04:09,393 INFO L290 TraceCheckUtils]: 53: Hoare triple {2091#true} main_~i~0#1 := 0; {2091#true} is VALID [2022-02-20 14:04:09,393 INFO L290 TraceCheckUtils]: 52: Hoare triple {2091#true} assume !(main_~i~0#1 < 100000); {2091#true} is VALID [2022-02-20 14:04:09,393 INFO L290 TraceCheckUtils]: 51: Hoare triple {2091#true} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {2091#true} is VALID [2022-02-20 14:04:09,394 INFO L290 TraceCheckUtils]: 50: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {2091#true} is VALID [2022-02-20 14:04:09,394 INFO L290 TraceCheckUtils]: 49: Hoare triple {2091#true} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {2091#true} is VALID [2022-02-20 14:04:09,394 INFO L290 TraceCheckUtils]: 48: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {2091#true} is VALID [2022-02-20 14:04:09,394 INFO L290 TraceCheckUtils]: 47: Hoare triple {2091#true} main_~i~0#1 := 0; {2091#true} is VALID [2022-02-20 14:04:09,394 INFO L290 TraceCheckUtils]: 46: Hoare triple {2091#true} assume !(main_~i~0#1 < 100000); {2091#true} is VALID [2022-02-20 14:04:09,394 INFO L290 TraceCheckUtils]: 45: Hoare triple {2091#true} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2091#true} is VALID [2022-02-20 14:04:09,394 INFO L290 TraceCheckUtils]: 44: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {2091#true} is VALID [2022-02-20 14:04:09,395 INFO L290 TraceCheckUtils]: 43: Hoare triple {2091#true} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2091#true} is VALID [2022-02-20 14:04:09,395 INFO L290 TraceCheckUtils]: 42: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {2091#true} is VALID [2022-02-20 14:04:09,395 INFO L290 TraceCheckUtils]: 41: Hoare triple {2091#true} main_~i~0#1 := 0; {2091#true} is VALID [2022-02-20 14:04:09,395 INFO L290 TraceCheckUtils]: 40: Hoare triple {2091#true} assume !(main_~i~0#1 < 100000); {2091#true} is VALID [2022-02-20 14:04:09,395 INFO L290 TraceCheckUtils]: 39: Hoare triple {2091#true} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2091#true} is VALID [2022-02-20 14:04:09,395 INFO L290 TraceCheckUtils]: 38: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {2091#true} is VALID [2022-02-20 14:04:09,396 INFO L290 TraceCheckUtils]: 37: Hoare triple {2091#true} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2091#true} is VALID [2022-02-20 14:04:09,396 INFO L290 TraceCheckUtils]: 36: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {2091#true} is VALID [2022-02-20 14:04:09,396 INFO L290 TraceCheckUtils]: 35: Hoare triple {2091#true} main_~i~0#1 := 0; {2091#true} is VALID [2022-02-20 14:04:09,396 INFO L290 TraceCheckUtils]: 34: Hoare triple {2091#true} assume !(main_~i~0#1 < 100000); {2091#true} is VALID [2022-02-20 14:04:09,396 INFO L290 TraceCheckUtils]: 33: Hoare triple {2091#true} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2091#true} is VALID [2022-02-20 14:04:09,396 INFO L290 TraceCheckUtils]: 32: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {2091#true} is VALID [2022-02-20 14:04:09,397 INFO L290 TraceCheckUtils]: 31: Hoare triple {2091#true} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2091#true} is VALID [2022-02-20 14:04:09,397 INFO L290 TraceCheckUtils]: 30: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {2091#true} is VALID [2022-02-20 14:04:09,397 INFO L290 TraceCheckUtils]: 29: Hoare triple {2091#true} main_~i~0#1 := 0; {2091#true} is VALID [2022-02-20 14:04:09,397 INFO L290 TraceCheckUtils]: 28: Hoare triple {2091#true} assume !(main_~i~0#1 < 100000); {2091#true} is VALID [2022-02-20 14:04:09,397 INFO L290 TraceCheckUtils]: 27: Hoare triple {2091#true} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2091#true} is VALID [2022-02-20 14:04:09,397 INFO L290 TraceCheckUtils]: 26: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {2091#true} is VALID [2022-02-20 14:04:09,397 INFO L290 TraceCheckUtils]: 25: Hoare triple {2091#true} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2091#true} is VALID [2022-02-20 14:04:09,398 INFO L290 TraceCheckUtils]: 24: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {2091#true} is VALID [2022-02-20 14:04:09,398 INFO L290 TraceCheckUtils]: 23: Hoare triple {2091#true} havoc main_~i~0#1;main_~i~0#1 := 0; {2091#true} is VALID [2022-02-20 14:04:09,398 INFO L290 TraceCheckUtils]: 22: Hoare triple {2091#true} assume !(main_~a~0#1 < 100000); {2091#true} is VALID [2022-02-20 14:04:09,398 INFO L290 TraceCheckUtils]: 21: Hoare triple {2091#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2091#true} is VALID [2022-02-20 14:04:09,398 INFO L290 TraceCheckUtils]: 20: Hoare triple {2091#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {2091#true} is VALID [2022-02-20 14:04:09,398 INFO L290 TraceCheckUtils]: 19: Hoare triple {2091#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2091#true} is VALID [2022-02-20 14:04:09,399 INFO L290 TraceCheckUtils]: 18: Hoare triple {2091#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {2091#true} is VALID [2022-02-20 14:04:09,399 INFO L290 TraceCheckUtils]: 17: Hoare triple {2091#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2091#true} is VALID [2022-02-20 14:04:09,399 INFO L290 TraceCheckUtils]: 16: Hoare triple {2091#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {2091#true} is VALID [2022-02-20 14:04:09,399 INFO L290 TraceCheckUtils]: 15: Hoare triple {2091#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2091#true} is VALID [2022-02-20 14:04:09,399 INFO L290 TraceCheckUtils]: 14: Hoare triple {2091#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {2091#true} is VALID [2022-02-20 14:04:09,399 INFO L290 TraceCheckUtils]: 13: Hoare triple {2091#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2091#true} is VALID [2022-02-20 14:04:09,400 INFO L290 TraceCheckUtils]: 12: Hoare triple {2091#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {2091#true} is VALID [2022-02-20 14:04:09,400 INFO L290 TraceCheckUtils]: 11: Hoare triple {2091#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2091#true} is VALID [2022-02-20 14:04:09,400 INFO L290 TraceCheckUtils]: 10: Hoare triple {2091#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {2091#true} is VALID [2022-02-20 14:04:09,400 INFO L290 TraceCheckUtils]: 9: Hoare triple {2091#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2091#true} is VALID [2022-02-20 14:04:09,400 INFO L290 TraceCheckUtils]: 8: Hoare triple {2091#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {2091#true} is VALID [2022-02-20 14:04:09,400 INFO L290 TraceCheckUtils]: 7: Hoare triple {2091#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2091#true} is VALID [2022-02-20 14:04:09,400 INFO L290 TraceCheckUtils]: 6: Hoare triple {2091#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {2091#true} is VALID [2022-02-20 14:04:09,401 INFO L290 TraceCheckUtils]: 5: Hoare triple {2091#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2091#true} is VALID [2022-02-20 14:04:09,401 INFO L290 TraceCheckUtils]: 4: Hoare triple {2091#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {2091#true} is VALID [2022-02-20 14:04:09,401 INFO L290 TraceCheckUtils]: 3: Hoare triple {2091#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2091#true} is VALID [2022-02-20 14:04:09,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {2091#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {2091#true} is VALID [2022-02-20 14:04:09,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {2091#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem4#1, main_#t~post3#1, main_#t~mem6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~post11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~mem16#1, main_#t~post15#1, main_#t~mem18#1, main_#t~post17#1, main_#t~mem20#1, main_#t~post19#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~#a5~0#1.base, main_~#a5~0#1.offset, main_~#a6~0#1.base, main_~#a6~0#1.offset, main_~#a7~0#1.base, main_~#a7~0#1.offset, main_~#a8~0#1.base, main_~#a8~0#1.offset, main_~#a9~0#1.base, main_~#a9~0#1.offset, main_~#a0~0#1.base, main_~#a0~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a6~0#1.base, main_~#a6~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a7~0#1.base, main_~#a7~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a8~0#1.base, main_~#a8~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a9~0#1.base, main_~#a9~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a0~0#1.base, main_~#a0~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {2091#true} is VALID [2022-02-20 14:04:09,402 INFO L290 TraceCheckUtils]: 0: Hoare triple {2091#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(26, 2); {2091#true} is VALID [2022-02-20 14:04:09,402 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2022-02-20 14:04:09,402 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118387877] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:04:09,402 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:04:09,402 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5, 5] total 19 [2022-02-20 14:04:09,403 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944628537] [2022-02-20 14:04:09,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:04:09,404 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.631578947368421) internal successors, (107), 19 states have internal predecessors, (107), 0 states have call successors, (0), 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 81 [2022-02-20 14:04:09,404 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:04:09,404 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 5.631578947368421) internal successors, (107), 19 states have internal predecessors, (107), 0 states have call successors, (0), 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:04:09,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:04:09,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-20 14:04:09,480 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:04:09,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-20 14:04:09,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2022-02-20 14:04:09,481 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand has 19 states, 19 states have (on average 5.631578947368421) internal successors, (107), 19 states have internal predecessors, (107), 0 states have call successors, (0), 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:04:10,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:10,141 INFO L93 Difference]: Finished difference Result 220 states and 276 transitions. [2022-02-20 14:04:10,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-20 14:04:10,141 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.631578947368421) internal successors, (107), 19 states have internal predecessors, (107), 0 states have call successors, (0), 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 81 [2022-02-20 14:04:10,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:04:10,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 5.631578947368421) internal successors, (107), 19 states have internal predecessors, (107), 0 states have call successors, (0), 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:04:10,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 249 transitions. [2022-02-20 14:04:10,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 5.631578947368421) internal successors, (107), 19 states have internal predecessors, (107), 0 states have call successors, (0), 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:04:10,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 249 transitions. [2022-02-20 14:04:10,149 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 249 transitions. [2022-02-20 14:04:10,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 249 edges. 249 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:04:10,332 INFO L225 Difference]: With dead ends: 220 [2022-02-20 14:04:10,333 INFO L226 Difference]: Without dead ends: 159 [2022-02-20 14:04:10,333 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2022-02-20 14:04:10,334 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 100 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 14:04:10,334 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 185 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 14:04:10,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-02-20 14:04:10,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2022-02-20 14:04:10,376 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:04:10,376 INFO L82 GeneralOperation]: Start isEquivalent. First operand 159 states. Second operand has 158 states, 157 states have (on average 1.070063694267516) internal successors, (168), 157 states have internal predecessors, (168), 0 states have call successors, (0), 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:04:10,376 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand has 158 states, 157 states have (on average 1.070063694267516) internal successors, (168), 157 states have internal predecessors, (168), 0 states have call successors, (0), 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:04:10,377 INFO L87 Difference]: Start difference. First operand 159 states. Second operand has 158 states, 157 states have (on average 1.070063694267516) internal successors, (168), 157 states have internal predecessors, (168), 0 states have call successors, (0), 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:04:10,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:10,381 INFO L93 Difference]: Finished difference Result 159 states and 169 transitions. [2022-02-20 14:04:10,381 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 169 transitions. [2022-02-20 14:04:10,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:04:10,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:04:10,382 INFO L74 IsIncluded]: Start isIncluded. First operand has 158 states, 157 states have (on average 1.070063694267516) internal successors, (168), 157 states have internal predecessors, (168), 0 states have call successors, (0), 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 159 states. [2022-02-20 14:04:10,383 INFO L87 Difference]: Start difference. First operand has 158 states, 157 states have (on average 1.070063694267516) internal successors, (168), 157 states have internal predecessors, (168), 0 states have call successors, (0), 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 159 states. [2022-02-20 14:04:10,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:10,387 INFO L93 Difference]: Finished difference Result 159 states and 169 transitions. [2022-02-20 14:04:10,387 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 169 transitions. [2022-02-20 14:04:10,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:04:10,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:04:10,388 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:04:10,388 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:04:10,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 1.070063694267516) internal successors, (168), 157 states have internal predecessors, (168), 0 states have call successors, (0), 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:04:10,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 168 transitions. [2022-02-20 14:04:10,393 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 168 transitions. Word has length 81 [2022-02-20 14:04:10,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:04:10,393 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 168 transitions. [2022-02-20 14:04:10,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.631578947368421) internal successors, (107), 19 states have internal predecessors, (107), 0 states have call successors, (0), 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:04:10,394 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 168 transitions. [2022-02-20 14:04:10,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-02-20 14:04:10,398 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:04:10,398 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:04:10,425 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:04:10,612 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:04:10,612 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:04:10,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:04:10,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1529021629, now seen corresponding path program 4 times [2022-02-20 14:04:10,613 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:04:10,613 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733764552] [2022-02-20 14:04:10,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:04:10,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:04:10,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:04:10,875 INFO L290 TraceCheckUtils]: 0: Hoare triple {3468#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(26, 2); {3468#true} is VALID [2022-02-20 14:04:10,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {3468#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem4#1, main_#t~post3#1, main_#t~mem6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~post11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~mem16#1, main_#t~post15#1, main_#t~mem18#1, main_#t~post17#1, main_#t~mem20#1, main_#t~post19#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~#a5~0#1.base, main_~#a5~0#1.offset, main_~#a6~0#1.base, main_~#a6~0#1.offset, main_~#a7~0#1.base, main_~#a7~0#1.offset, main_~#a8~0#1.base, main_~#a8~0#1.offset, main_~#a9~0#1.base, main_~#a9~0#1.offset, main_~#a0~0#1.base, main_~#a0~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a6~0#1.base, main_~#a6~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a7~0#1.base, main_~#a7~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a8~0#1.base, main_~#a8~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a9~0#1.base, main_~#a9~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a0~0#1.base, main_~#a0~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {3470#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:04:10,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {3470#(= |ULTIMATE.start_main_~a~0#1| 0)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {3470#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:04:10,877 INFO L290 TraceCheckUtils]: 3: Hoare triple {3470#(= |ULTIMATE.start_main_~a~0#1| 0)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3471#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:04:10,877 INFO L290 TraceCheckUtils]: 4: Hoare triple {3471#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {3471#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:04:10,878 INFO L290 TraceCheckUtils]: 5: Hoare triple {3471#(<= |ULTIMATE.start_main_~a~0#1| 1)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3472#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:04:10,878 INFO L290 TraceCheckUtils]: 6: Hoare triple {3472#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {3472#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:04:10,879 INFO L290 TraceCheckUtils]: 7: Hoare triple {3472#(<= |ULTIMATE.start_main_~a~0#1| 2)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3473#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:04:10,879 INFO L290 TraceCheckUtils]: 8: Hoare triple {3473#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {3473#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:04:10,879 INFO L290 TraceCheckUtils]: 9: Hoare triple {3473#(<= |ULTIMATE.start_main_~a~0#1| 3)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3474#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:04:10,880 INFO L290 TraceCheckUtils]: 10: Hoare triple {3474#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {3474#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:04:10,880 INFO L290 TraceCheckUtils]: 11: Hoare triple {3474#(<= |ULTIMATE.start_main_~a~0#1| 4)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3475#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-20 14:04:10,881 INFO L290 TraceCheckUtils]: 12: Hoare triple {3475#(<= |ULTIMATE.start_main_~a~0#1| 5)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {3475#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-20 14:04:10,881 INFO L290 TraceCheckUtils]: 13: Hoare triple {3475#(<= |ULTIMATE.start_main_~a~0#1| 5)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3476#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-20 14:04:10,882 INFO L290 TraceCheckUtils]: 14: Hoare triple {3476#(<= |ULTIMATE.start_main_~a~0#1| 6)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {3476#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-20 14:04:10,882 INFO L290 TraceCheckUtils]: 15: Hoare triple {3476#(<= |ULTIMATE.start_main_~a~0#1| 6)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3477#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-20 14:04:10,882 INFO L290 TraceCheckUtils]: 16: Hoare triple {3477#(<= |ULTIMATE.start_main_~a~0#1| 7)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {3477#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-20 14:04:10,883 INFO L290 TraceCheckUtils]: 17: Hoare triple {3477#(<= |ULTIMATE.start_main_~a~0#1| 7)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3478#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-20 14:04:10,883 INFO L290 TraceCheckUtils]: 18: Hoare triple {3478#(<= |ULTIMATE.start_main_~a~0#1| 8)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {3478#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-20 14:04:10,884 INFO L290 TraceCheckUtils]: 19: Hoare triple {3478#(<= |ULTIMATE.start_main_~a~0#1| 8)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3479#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-20 14:04:10,884 INFO L290 TraceCheckUtils]: 20: Hoare triple {3479#(<= |ULTIMATE.start_main_~a~0#1| 9)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {3479#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-20 14:04:10,885 INFO L290 TraceCheckUtils]: 21: Hoare triple {3479#(<= |ULTIMATE.start_main_~a~0#1| 9)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3480#(<= |ULTIMATE.start_main_~a~0#1| 10)} is VALID [2022-02-20 14:04:10,885 INFO L290 TraceCheckUtils]: 22: Hoare triple {3480#(<= |ULTIMATE.start_main_~a~0#1| 10)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {3480#(<= |ULTIMATE.start_main_~a~0#1| 10)} is VALID [2022-02-20 14:04:10,886 INFO L290 TraceCheckUtils]: 23: Hoare triple {3480#(<= |ULTIMATE.start_main_~a~0#1| 10)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3481#(<= |ULTIMATE.start_main_~a~0#1| 11)} is VALID [2022-02-20 14:04:10,886 INFO L290 TraceCheckUtils]: 24: Hoare triple {3481#(<= |ULTIMATE.start_main_~a~0#1| 11)} assume !(main_~a~0#1 < 100000); {3469#false} is VALID [2022-02-20 14:04:10,886 INFO L290 TraceCheckUtils]: 25: Hoare triple {3469#false} havoc main_~i~0#1;main_~i~0#1 := 0; {3469#false} is VALID [2022-02-20 14:04:10,886 INFO L290 TraceCheckUtils]: 26: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {3469#false} is VALID [2022-02-20 14:04:10,886 INFO L290 TraceCheckUtils]: 27: Hoare triple {3469#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3469#false} is VALID [2022-02-20 14:04:10,887 INFO L290 TraceCheckUtils]: 28: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {3469#false} is VALID [2022-02-20 14:04:10,887 INFO L290 TraceCheckUtils]: 29: Hoare triple {3469#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3469#false} is VALID [2022-02-20 14:04:10,887 INFO L290 TraceCheckUtils]: 30: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {3469#false} is VALID [2022-02-20 14:04:10,887 INFO L290 TraceCheckUtils]: 31: Hoare triple {3469#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3469#false} is VALID [2022-02-20 14:04:10,887 INFO L290 TraceCheckUtils]: 32: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {3469#false} is VALID [2022-02-20 14:04:10,887 INFO L290 TraceCheckUtils]: 33: Hoare triple {3469#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3469#false} is VALID [2022-02-20 14:04:10,888 INFO L290 TraceCheckUtils]: 34: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {3469#false} is VALID [2022-02-20 14:04:10,888 INFO L290 TraceCheckUtils]: 35: Hoare triple {3469#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3469#false} is VALID [2022-02-20 14:04:10,888 INFO L290 TraceCheckUtils]: 36: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {3469#false} is VALID [2022-02-20 14:04:10,888 INFO L290 TraceCheckUtils]: 37: Hoare triple {3469#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3469#false} is VALID [2022-02-20 14:04:10,888 INFO L290 TraceCheckUtils]: 38: Hoare triple {3469#false} assume !(main_~i~0#1 < 100000); {3469#false} is VALID [2022-02-20 14:04:10,888 INFO L290 TraceCheckUtils]: 39: Hoare triple {3469#false} main_~i~0#1 := 0; {3469#false} is VALID [2022-02-20 14:04:10,888 INFO L290 TraceCheckUtils]: 40: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {3469#false} is VALID [2022-02-20 14:04:10,889 INFO L290 TraceCheckUtils]: 41: Hoare triple {3469#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3469#false} is VALID [2022-02-20 14:04:10,889 INFO L290 TraceCheckUtils]: 42: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {3469#false} is VALID [2022-02-20 14:04:10,889 INFO L290 TraceCheckUtils]: 43: Hoare triple {3469#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3469#false} is VALID [2022-02-20 14:04:10,889 INFO L290 TraceCheckUtils]: 44: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {3469#false} is VALID [2022-02-20 14:04:10,889 INFO L290 TraceCheckUtils]: 45: Hoare triple {3469#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3469#false} is VALID [2022-02-20 14:04:10,889 INFO L290 TraceCheckUtils]: 46: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {3469#false} is VALID [2022-02-20 14:04:10,890 INFO L290 TraceCheckUtils]: 47: Hoare triple {3469#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3469#false} is VALID [2022-02-20 14:04:10,890 INFO L290 TraceCheckUtils]: 48: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {3469#false} is VALID [2022-02-20 14:04:10,890 INFO L290 TraceCheckUtils]: 49: Hoare triple {3469#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3469#false} is VALID [2022-02-20 14:04:10,890 INFO L290 TraceCheckUtils]: 50: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {3469#false} is VALID [2022-02-20 14:04:10,890 INFO L290 TraceCheckUtils]: 51: Hoare triple {3469#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3469#false} is VALID [2022-02-20 14:04:10,890 INFO L290 TraceCheckUtils]: 52: Hoare triple {3469#false} assume !(main_~i~0#1 < 100000); {3469#false} is VALID [2022-02-20 14:04:10,890 INFO L290 TraceCheckUtils]: 53: Hoare triple {3469#false} main_~i~0#1 := 0; {3469#false} is VALID [2022-02-20 14:04:10,891 INFO L290 TraceCheckUtils]: 54: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {3469#false} is VALID [2022-02-20 14:04:10,891 INFO L290 TraceCheckUtils]: 55: Hoare triple {3469#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3469#false} is VALID [2022-02-20 14:04:10,891 INFO L290 TraceCheckUtils]: 56: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {3469#false} is VALID [2022-02-20 14:04:10,891 INFO L290 TraceCheckUtils]: 57: Hoare triple {3469#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3469#false} is VALID [2022-02-20 14:04:10,891 INFO L290 TraceCheckUtils]: 58: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {3469#false} is VALID [2022-02-20 14:04:10,891 INFO L290 TraceCheckUtils]: 59: Hoare triple {3469#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3469#false} is VALID [2022-02-20 14:04:10,892 INFO L290 TraceCheckUtils]: 60: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {3469#false} is VALID [2022-02-20 14:04:10,892 INFO L290 TraceCheckUtils]: 61: Hoare triple {3469#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3469#false} is VALID [2022-02-20 14:04:10,892 INFO L290 TraceCheckUtils]: 62: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {3469#false} is VALID [2022-02-20 14:04:10,892 INFO L290 TraceCheckUtils]: 63: Hoare triple {3469#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3469#false} is VALID [2022-02-20 14:04:10,892 INFO L290 TraceCheckUtils]: 64: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {3469#false} is VALID [2022-02-20 14:04:10,892 INFO L290 TraceCheckUtils]: 65: Hoare triple {3469#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3469#false} is VALID [2022-02-20 14:04:10,892 INFO L290 TraceCheckUtils]: 66: Hoare triple {3469#false} assume !(main_~i~0#1 < 100000); {3469#false} is VALID [2022-02-20 14:04:10,893 INFO L290 TraceCheckUtils]: 67: Hoare triple {3469#false} main_~i~0#1 := 0; {3469#false} is VALID [2022-02-20 14:04:10,893 INFO L290 TraceCheckUtils]: 68: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {3469#false} is VALID [2022-02-20 14:04:10,893 INFO L290 TraceCheckUtils]: 69: Hoare triple {3469#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3469#false} is VALID [2022-02-20 14:04:10,893 INFO L290 TraceCheckUtils]: 70: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {3469#false} is VALID [2022-02-20 14:04:10,893 INFO L290 TraceCheckUtils]: 71: Hoare triple {3469#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3469#false} is VALID [2022-02-20 14:04:10,893 INFO L290 TraceCheckUtils]: 72: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {3469#false} is VALID [2022-02-20 14:04:10,894 INFO L290 TraceCheckUtils]: 73: Hoare triple {3469#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3469#false} is VALID [2022-02-20 14:04:10,894 INFO L290 TraceCheckUtils]: 74: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {3469#false} is VALID [2022-02-20 14:04:10,894 INFO L290 TraceCheckUtils]: 75: Hoare triple {3469#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3469#false} is VALID [2022-02-20 14:04:10,894 INFO L290 TraceCheckUtils]: 76: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {3469#false} is VALID [2022-02-20 14:04:10,894 INFO L290 TraceCheckUtils]: 77: Hoare triple {3469#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3469#false} is VALID [2022-02-20 14:04:10,894 INFO L290 TraceCheckUtils]: 78: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {3469#false} is VALID [2022-02-20 14:04:10,894 INFO L290 TraceCheckUtils]: 79: Hoare triple {3469#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3469#false} is VALID [2022-02-20 14:04:10,895 INFO L290 TraceCheckUtils]: 80: Hoare triple {3469#false} assume !(main_~i~0#1 < 100000); {3469#false} is VALID [2022-02-20 14:04:10,895 INFO L290 TraceCheckUtils]: 81: Hoare triple {3469#false} main_~i~0#1 := 0; {3469#false} is VALID [2022-02-20 14:04:10,895 INFO L290 TraceCheckUtils]: 82: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {3469#false} is VALID [2022-02-20 14:04:10,895 INFO L290 TraceCheckUtils]: 83: Hoare triple {3469#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {3469#false} is VALID [2022-02-20 14:04:10,895 INFO L290 TraceCheckUtils]: 84: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {3469#false} is VALID [2022-02-20 14:04:10,895 INFO L290 TraceCheckUtils]: 85: Hoare triple {3469#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {3469#false} is VALID [2022-02-20 14:04:10,896 INFO L290 TraceCheckUtils]: 86: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {3469#false} is VALID [2022-02-20 14:04:10,896 INFO L290 TraceCheckUtils]: 87: Hoare triple {3469#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {3469#false} is VALID [2022-02-20 14:04:10,896 INFO L290 TraceCheckUtils]: 88: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {3469#false} is VALID [2022-02-20 14:04:10,896 INFO L290 TraceCheckUtils]: 89: Hoare triple {3469#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {3469#false} is VALID [2022-02-20 14:04:10,896 INFO L290 TraceCheckUtils]: 90: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {3469#false} is VALID [2022-02-20 14:04:10,896 INFO L290 TraceCheckUtils]: 91: Hoare triple {3469#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {3469#false} is VALID [2022-02-20 14:04:10,896 INFO L290 TraceCheckUtils]: 92: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {3469#false} is VALID [2022-02-20 14:04:10,897 INFO L290 TraceCheckUtils]: 93: Hoare triple {3469#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {3469#false} is VALID [2022-02-20 14:04:10,897 INFO L290 TraceCheckUtils]: 94: Hoare triple {3469#false} assume !(main_~i~0#1 < 100000); {3469#false} is VALID [2022-02-20 14:04:10,897 INFO L290 TraceCheckUtils]: 95: Hoare triple {3469#false} main_~i~0#1 := 0; {3469#false} is VALID [2022-02-20 14:04:10,897 INFO L290 TraceCheckUtils]: 96: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {3469#false} is VALID [2022-02-20 14:04:10,897 INFO L290 TraceCheckUtils]: 97: Hoare triple {3469#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3469#false} is VALID [2022-02-20 14:04:10,897 INFO L290 TraceCheckUtils]: 98: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {3469#false} is VALID [2022-02-20 14:04:10,897 INFO L290 TraceCheckUtils]: 99: Hoare triple {3469#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3469#false} is VALID [2022-02-20 14:04:10,898 INFO L290 TraceCheckUtils]: 100: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {3469#false} is VALID [2022-02-20 14:04:10,898 INFO L290 TraceCheckUtils]: 101: Hoare triple {3469#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3469#false} is VALID [2022-02-20 14:04:10,898 INFO L290 TraceCheckUtils]: 102: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {3469#false} is VALID [2022-02-20 14:04:10,898 INFO L290 TraceCheckUtils]: 103: Hoare triple {3469#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3469#false} is VALID [2022-02-20 14:04:10,898 INFO L290 TraceCheckUtils]: 104: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {3469#false} is VALID [2022-02-20 14:04:10,898 INFO L290 TraceCheckUtils]: 105: Hoare triple {3469#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3469#false} is VALID [2022-02-20 14:04:10,898 INFO L290 TraceCheckUtils]: 106: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {3469#false} is VALID [2022-02-20 14:04:10,898 INFO L290 TraceCheckUtils]: 107: Hoare triple {3469#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3469#false} is VALID [2022-02-20 14:04:10,898 INFO L290 TraceCheckUtils]: 108: Hoare triple {3469#false} assume !(main_~i~0#1 < 100000); {3469#false} is VALID [2022-02-20 14:04:10,898 INFO L290 TraceCheckUtils]: 109: Hoare triple {3469#false} main_~i~0#1 := 0; {3469#false} is VALID [2022-02-20 14:04:10,898 INFO L290 TraceCheckUtils]: 110: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {3469#false} is VALID [2022-02-20 14:04:10,899 INFO L290 TraceCheckUtils]: 111: Hoare triple {3469#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {3469#false} is VALID [2022-02-20 14:04:10,899 INFO L290 TraceCheckUtils]: 112: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {3469#false} is VALID [2022-02-20 14:04:10,899 INFO L290 TraceCheckUtils]: 113: Hoare triple {3469#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {3469#false} is VALID [2022-02-20 14:04:10,899 INFO L290 TraceCheckUtils]: 114: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {3469#false} is VALID [2022-02-20 14:04:10,899 INFO L290 TraceCheckUtils]: 115: Hoare triple {3469#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {3469#false} is VALID [2022-02-20 14:04:10,899 INFO L290 TraceCheckUtils]: 116: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {3469#false} is VALID [2022-02-20 14:04:10,899 INFO L290 TraceCheckUtils]: 117: Hoare triple {3469#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {3469#false} is VALID [2022-02-20 14:04:10,900 INFO L290 TraceCheckUtils]: 118: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {3469#false} is VALID [2022-02-20 14:04:10,900 INFO L290 TraceCheckUtils]: 119: Hoare triple {3469#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {3469#false} is VALID [2022-02-20 14:04:10,900 INFO L290 TraceCheckUtils]: 120: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {3469#false} is VALID [2022-02-20 14:04:10,900 INFO L290 TraceCheckUtils]: 121: Hoare triple {3469#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {3469#false} is VALID [2022-02-20 14:04:10,900 INFO L290 TraceCheckUtils]: 122: Hoare triple {3469#false} assume !(main_~i~0#1 < 100000); {3469#false} is VALID [2022-02-20 14:04:10,900 INFO L290 TraceCheckUtils]: 123: Hoare triple {3469#false} main_~i~0#1 := 0; {3469#false} is VALID [2022-02-20 14:04:10,901 INFO L290 TraceCheckUtils]: 124: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem18#1, main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem18#1; {3469#false} is VALID [2022-02-20 14:04:10,901 INFO L290 TraceCheckUtils]: 125: Hoare triple {3469#false} main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {3469#false} is VALID [2022-02-20 14:04:10,901 INFO L290 TraceCheckUtils]: 126: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem18#1, main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem18#1; {3469#false} is VALID [2022-02-20 14:04:10,901 INFO L290 TraceCheckUtils]: 127: Hoare triple {3469#false} main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {3469#false} is VALID [2022-02-20 14:04:10,901 INFO L290 TraceCheckUtils]: 128: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem18#1, main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem18#1; {3469#false} is VALID [2022-02-20 14:04:10,901 INFO L290 TraceCheckUtils]: 129: Hoare triple {3469#false} main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {3469#false} is VALID [2022-02-20 14:04:10,902 INFO L290 TraceCheckUtils]: 130: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem18#1, main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem18#1; {3469#false} is VALID [2022-02-20 14:04:10,902 INFO L290 TraceCheckUtils]: 131: Hoare triple {3469#false} main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {3469#false} is VALID [2022-02-20 14:04:10,902 INFO L290 TraceCheckUtils]: 132: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem18#1, main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem18#1; {3469#false} is VALID [2022-02-20 14:04:10,902 INFO L290 TraceCheckUtils]: 133: Hoare triple {3469#false} main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {3469#false} is VALID [2022-02-20 14:04:10,902 INFO L290 TraceCheckUtils]: 134: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem18#1, main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem18#1; {3469#false} is VALID [2022-02-20 14:04:10,902 INFO L290 TraceCheckUtils]: 135: Hoare triple {3469#false} main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {3469#false} is VALID [2022-02-20 14:04:10,902 INFO L290 TraceCheckUtils]: 136: Hoare triple {3469#false} assume !(main_~i~0#1 < 100000); {3469#false} is VALID [2022-02-20 14:04:10,903 INFO L290 TraceCheckUtils]: 137: Hoare triple {3469#false} main_~i~0#1 := 0; {3469#false} is VALID [2022-02-20 14:04:10,903 INFO L290 TraceCheckUtils]: 138: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem20#1 := read~int(main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem20#1, main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem20#1; {3469#false} is VALID [2022-02-20 14:04:10,903 INFO L290 TraceCheckUtils]: 139: Hoare triple {3469#false} main_#t~post19#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; {3469#false} is VALID [2022-02-20 14:04:10,903 INFO L290 TraceCheckUtils]: 140: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem20#1 := read~int(main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem20#1, main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem20#1; {3469#false} is VALID [2022-02-20 14:04:10,903 INFO L290 TraceCheckUtils]: 141: Hoare triple {3469#false} main_#t~post19#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; {3469#false} is VALID [2022-02-20 14:04:10,903 INFO L290 TraceCheckUtils]: 142: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem20#1 := read~int(main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem20#1, main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem20#1; {3469#false} is VALID [2022-02-20 14:04:10,904 INFO L290 TraceCheckUtils]: 143: Hoare triple {3469#false} main_#t~post19#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; {3469#false} is VALID [2022-02-20 14:04:10,904 INFO L290 TraceCheckUtils]: 144: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem20#1 := read~int(main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem20#1, main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem20#1; {3469#false} is VALID [2022-02-20 14:04:10,904 INFO L290 TraceCheckUtils]: 145: Hoare triple {3469#false} main_#t~post19#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; {3469#false} is VALID [2022-02-20 14:04:10,904 INFO L290 TraceCheckUtils]: 146: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem20#1 := read~int(main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem20#1, main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem20#1; {3469#false} is VALID [2022-02-20 14:04:10,904 INFO L290 TraceCheckUtils]: 147: Hoare triple {3469#false} main_#t~post19#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; {3469#false} is VALID [2022-02-20 14:04:10,904 INFO L290 TraceCheckUtils]: 148: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem20#1 := read~int(main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem20#1, main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem20#1; {3469#false} is VALID [2022-02-20 14:04:10,905 INFO L290 TraceCheckUtils]: 149: Hoare triple {3469#false} main_#t~post19#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; {3469#false} is VALID [2022-02-20 14:04:10,905 INFO L290 TraceCheckUtils]: 150: Hoare triple {3469#false} assume !(main_~i~0#1 < 100000); {3469#false} is VALID [2022-02-20 14:04:10,905 INFO L290 TraceCheckUtils]: 151: Hoare triple {3469#false} havoc main_~x~0#1;main_~x~0#1 := 0; {3469#false} is VALID [2022-02-20 14:04:10,905 INFO L290 TraceCheckUtils]: 152: Hoare triple {3469#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem22#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem23#1 := read~int(main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem22#1 == main_#t~mem23#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3469#false} is VALID [2022-02-20 14:04:10,905 INFO L290 TraceCheckUtils]: 153: Hoare triple {3469#false} assume 0 == __VERIFIER_assert_~cond#1; {3469#false} is VALID [2022-02-20 14:04:10,905 INFO L290 TraceCheckUtils]: 154: Hoare triple {3469#false} assume !false; {3469#false} is VALID [2022-02-20 14:04:10,906 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2022-02-20 14:04:10,906 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:04:10,906 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733764552] [2022-02-20 14:04:10,906 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733764552] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:04:10,907 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17696096] [2022-02-20 14:04:10,907 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 14:04:10,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:04:10,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:04:10,908 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:04:10,934 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:04:11,142 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 14:04:11,142 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:04:11,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 734 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 14:04:11,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:04:11,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:04:11,614 INFO L290 TraceCheckUtils]: 0: Hoare triple {3468#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(26, 2); {3468#true} is VALID [2022-02-20 14:04:11,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {3468#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem4#1, main_#t~post3#1, main_#t~mem6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~post11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~mem16#1, main_#t~post15#1, main_#t~mem18#1, main_#t~post17#1, main_#t~mem20#1, main_#t~post19#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~#a5~0#1.base, main_~#a5~0#1.offset, main_~#a6~0#1.base, main_~#a6~0#1.offset, main_~#a7~0#1.base, main_~#a7~0#1.offset, main_~#a8~0#1.base, main_~#a8~0#1.offset, main_~#a9~0#1.base, main_~#a9~0#1.offset, main_~#a0~0#1.base, main_~#a0~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a6~0#1.base, main_~#a6~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a7~0#1.base, main_~#a7~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a8~0#1.base, main_~#a8~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a9~0#1.base, main_~#a9~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a0~0#1.base, main_~#a0~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {3468#true} is VALID [2022-02-20 14:04:11,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {3468#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {3468#true} is VALID [2022-02-20 14:04:11,615 INFO L290 TraceCheckUtils]: 3: Hoare triple {3468#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3468#true} is VALID [2022-02-20 14:04:11,615 INFO L290 TraceCheckUtils]: 4: Hoare triple {3468#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {3468#true} is VALID [2022-02-20 14:04:11,615 INFO L290 TraceCheckUtils]: 5: Hoare triple {3468#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3468#true} is VALID [2022-02-20 14:04:11,615 INFO L290 TraceCheckUtils]: 6: Hoare triple {3468#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {3468#true} is VALID [2022-02-20 14:04:11,615 INFO L290 TraceCheckUtils]: 7: Hoare triple {3468#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3468#true} is VALID [2022-02-20 14:04:11,615 INFO L290 TraceCheckUtils]: 8: Hoare triple {3468#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {3468#true} is VALID [2022-02-20 14:04:11,616 INFO L290 TraceCheckUtils]: 9: Hoare triple {3468#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3468#true} is VALID [2022-02-20 14:04:11,616 INFO L290 TraceCheckUtils]: 10: Hoare triple {3468#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {3468#true} is VALID [2022-02-20 14:04:11,616 INFO L290 TraceCheckUtils]: 11: Hoare triple {3468#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3468#true} is VALID [2022-02-20 14:04:11,617 INFO L290 TraceCheckUtils]: 12: Hoare triple {3468#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {3468#true} is VALID [2022-02-20 14:04:11,617 INFO L290 TraceCheckUtils]: 13: Hoare triple {3468#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3468#true} is VALID [2022-02-20 14:04:11,617 INFO L290 TraceCheckUtils]: 14: Hoare triple {3468#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {3468#true} is VALID [2022-02-20 14:04:11,617 INFO L290 TraceCheckUtils]: 15: Hoare triple {3468#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3468#true} is VALID [2022-02-20 14:04:11,617 INFO L290 TraceCheckUtils]: 16: Hoare triple {3468#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {3468#true} is VALID [2022-02-20 14:04:11,618 INFO L290 TraceCheckUtils]: 17: Hoare triple {3468#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3468#true} is VALID [2022-02-20 14:04:11,618 INFO L290 TraceCheckUtils]: 18: Hoare triple {3468#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {3468#true} is VALID [2022-02-20 14:04:11,618 INFO L290 TraceCheckUtils]: 19: Hoare triple {3468#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3468#true} is VALID [2022-02-20 14:04:11,618 INFO L290 TraceCheckUtils]: 20: Hoare triple {3468#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {3468#true} is VALID [2022-02-20 14:04:11,618 INFO L290 TraceCheckUtils]: 21: Hoare triple {3468#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3468#true} is VALID [2022-02-20 14:04:11,618 INFO L290 TraceCheckUtils]: 22: Hoare triple {3468#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {3468#true} is VALID [2022-02-20 14:04:11,618 INFO L290 TraceCheckUtils]: 23: Hoare triple {3468#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3468#true} is VALID [2022-02-20 14:04:11,619 INFO L290 TraceCheckUtils]: 24: Hoare triple {3468#true} assume !(main_~a~0#1 < 100000); {3468#true} is VALID [2022-02-20 14:04:11,619 INFO L290 TraceCheckUtils]: 25: Hoare triple {3468#true} havoc main_~i~0#1;main_~i~0#1 := 0; {3468#true} is VALID [2022-02-20 14:04:11,619 INFO L290 TraceCheckUtils]: 26: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {3468#true} is VALID [2022-02-20 14:04:11,619 INFO L290 TraceCheckUtils]: 27: Hoare triple {3468#true} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3468#true} is VALID [2022-02-20 14:04:11,619 INFO L290 TraceCheckUtils]: 28: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {3468#true} is VALID [2022-02-20 14:04:11,619 INFO L290 TraceCheckUtils]: 29: Hoare triple {3468#true} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3468#true} is VALID [2022-02-20 14:04:11,620 INFO L290 TraceCheckUtils]: 30: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {3468#true} is VALID [2022-02-20 14:04:11,620 INFO L290 TraceCheckUtils]: 31: Hoare triple {3468#true} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3468#true} is VALID [2022-02-20 14:04:11,620 INFO L290 TraceCheckUtils]: 32: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {3468#true} is VALID [2022-02-20 14:04:11,620 INFO L290 TraceCheckUtils]: 33: Hoare triple {3468#true} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3468#true} is VALID [2022-02-20 14:04:11,620 INFO L290 TraceCheckUtils]: 34: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {3468#true} is VALID [2022-02-20 14:04:11,620 INFO L290 TraceCheckUtils]: 35: Hoare triple {3468#true} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3468#true} is VALID [2022-02-20 14:04:11,620 INFO L290 TraceCheckUtils]: 36: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {3468#true} is VALID [2022-02-20 14:04:11,621 INFO L290 TraceCheckUtils]: 37: Hoare triple {3468#true} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3468#true} is VALID [2022-02-20 14:04:11,621 INFO L290 TraceCheckUtils]: 38: Hoare triple {3468#true} assume !(main_~i~0#1 < 100000); {3468#true} is VALID [2022-02-20 14:04:11,621 INFO L290 TraceCheckUtils]: 39: Hoare triple {3468#true} main_~i~0#1 := 0; {3468#true} is VALID [2022-02-20 14:04:11,621 INFO L290 TraceCheckUtils]: 40: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {3468#true} is VALID [2022-02-20 14:04:11,621 INFO L290 TraceCheckUtils]: 41: Hoare triple {3468#true} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3468#true} is VALID [2022-02-20 14:04:11,621 INFO L290 TraceCheckUtils]: 42: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {3468#true} is VALID [2022-02-20 14:04:11,622 INFO L290 TraceCheckUtils]: 43: Hoare triple {3468#true} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3468#true} is VALID [2022-02-20 14:04:11,622 INFO L290 TraceCheckUtils]: 44: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {3468#true} is VALID [2022-02-20 14:04:11,622 INFO L290 TraceCheckUtils]: 45: Hoare triple {3468#true} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3468#true} is VALID [2022-02-20 14:04:11,622 INFO L290 TraceCheckUtils]: 46: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {3468#true} is VALID [2022-02-20 14:04:11,622 INFO L290 TraceCheckUtils]: 47: Hoare triple {3468#true} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3468#true} is VALID [2022-02-20 14:04:11,622 INFO L290 TraceCheckUtils]: 48: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {3468#true} is VALID [2022-02-20 14:04:11,622 INFO L290 TraceCheckUtils]: 49: Hoare triple {3468#true} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3468#true} is VALID [2022-02-20 14:04:11,623 INFO L290 TraceCheckUtils]: 50: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {3468#true} is VALID [2022-02-20 14:04:11,623 INFO L290 TraceCheckUtils]: 51: Hoare triple {3468#true} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3468#true} is VALID [2022-02-20 14:04:11,623 INFO L290 TraceCheckUtils]: 52: Hoare triple {3468#true} assume !(main_~i~0#1 < 100000); {3468#true} is VALID [2022-02-20 14:04:11,623 INFO L290 TraceCheckUtils]: 53: Hoare triple {3468#true} main_~i~0#1 := 0; {3468#true} is VALID [2022-02-20 14:04:11,623 INFO L290 TraceCheckUtils]: 54: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {3468#true} is VALID [2022-02-20 14:04:11,623 INFO L290 TraceCheckUtils]: 55: Hoare triple {3468#true} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3468#true} is VALID [2022-02-20 14:04:11,624 INFO L290 TraceCheckUtils]: 56: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {3468#true} is VALID [2022-02-20 14:04:11,624 INFO L290 TraceCheckUtils]: 57: Hoare triple {3468#true} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3468#true} is VALID [2022-02-20 14:04:11,624 INFO L290 TraceCheckUtils]: 58: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {3468#true} is VALID [2022-02-20 14:04:11,624 INFO L290 TraceCheckUtils]: 59: Hoare triple {3468#true} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3468#true} is VALID [2022-02-20 14:04:11,624 INFO L290 TraceCheckUtils]: 60: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {3468#true} is VALID [2022-02-20 14:04:11,624 INFO L290 TraceCheckUtils]: 61: Hoare triple {3468#true} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3468#true} is VALID [2022-02-20 14:04:11,624 INFO L290 TraceCheckUtils]: 62: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {3468#true} is VALID [2022-02-20 14:04:11,625 INFO L290 TraceCheckUtils]: 63: Hoare triple {3468#true} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3468#true} is VALID [2022-02-20 14:04:11,625 INFO L290 TraceCheckUtils]: 64: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {3468#true} is VALID [2022-02-20 14:04:11,625 INFO L290 TraceCheckUtils]: 65: Hoare triple {3468#true} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3468#true} is VALID [2022-02-20 14:04:11,625 INFO L290 TraceCheckUtils]: 66: Hoare triple {3468#true} assume !(main_~i~0#1 < 100000); {3468#true} is VALID [2022-02-20 14:04:11,625 INFO L290 TraceCheckUtils]: 67: Hoare triple {3468#true} main_~i~0#1 := 0; {3468#true} is VALID [2022-02-20 14:04:11,625 INFO L290 TraceCheckUtils]: 68: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {3468#true} is VALID [2022-02-20 14:04:11,626 INFO L290 TraceCheckUtils]: 69: Hoare triple {3468#true} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3468#true} is VALID [2022-02-20 14:04:11,626 INFO L290 TraceCheckUtils]: 70: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {3468#true} is VALID [2022-02-20 14:04:11,626 INFO L290 TraceCheckUtils]: 71: Hoare triple {3468#true} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3468#true} is VALID [2022-02-20 14:04:11,626 INFO L290 TraceCheckUtils]: 72: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {3468#true} is VALID [2022-02-20 14:04:11,626 INFO L290 TraceCheckUtils]: 73: Hoare triple {3468#true} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3468#true} is VALID [2022-02-20 14:04:11,626 INFO L290 TraceCheckUtils]: 74: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {3468#true} is VALID [2022-02-20 14:04:11,626 INFO L290 TraceCheckUtils]: 75: Hoare triple {3468#true} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3468#true} is VALID [2022-02-20 14:04:11,627 INFO L290 TraceCheckUtils]: 76: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {3468#true} is VALID [2022-02-20 14:04:11,627 INFO L290 TraceCheckUtils]: 77: Hoare triple {3468#true} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3468#true} is VALID [2022-02-20 14:04:11,627 INFO L290 TraceCheckUtils]: 78: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {3468#true} is VALID [2022-02-20 14:04:11,627 INFO L290 TraceCheckUtils]: 79: Hoare triple {3468#true} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3468#true} is VALID [2022-02-20 14:04:11,627 INFO L290 TraceCheckUtils]: 80: Hoare triple {3468#true} assume !(main_~i~0#1 < 100000); {3468#true} is VALID [2022-02-20 14:04:11,627 INFO L290 TraceCheckUtils]: 81: Hoare triple {3468#true} main_~i~0#1 := 0; {3468#true} is VALID [2022-02-20 14:04:11,628 INFO L290 TraceCheckUtils]: 82: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {3468#true} is VALID [2022-02-20 14:04:11,628 INFO L290 TraceCheckUtils]: 83: Hoare triple {3468#true} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {3468#true} is VALID [2022-02-20 14:04:11,628 INFO L290 TraceCheckUtils]: 84: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {3468#true} is VALID [2022-02-20 14:04:11,628 INFO L290 TraceCheckUtils]: 85: Hoare triple {3468#true} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {3468#true} is VALID [2022-02-20 14:04:11,628 INFO L290 TraceCheckUtils]: 86: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {3468#true} is VALID [2022-02-20 14:04:11,628 INFO L290 TraceCheckUtils]: 87: Hoare triple {3468#true} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {3468#true} is VALID [2022-02-20 14:04:11,628 INFO L290 TraceCheckUtils]: 88: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {3468#true} is VALID [2022-02-20 14:04:11,629 INFO L290 TraceCheckUtils]: 89: Hoare triple {3468#true} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {3468#true} is VALID [2022-02-20 14:04:11,629 INFO L290 TraceCheckUtils]: 90: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {3468#true} is VALID [2022-02-20 14:04:11,629 INFO L290 TraceCheckUtils]: 91: Hoare triple {3468#true} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {3468#true} is VALID [2022-02-20 14:04:11,629 INFO L290 TraceCheckUtils]: 92: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {3468#true} is VALID [2022-02-20 14:04:11,629 INFO L290 TraceCheckUtils]: 93: Hoare triple {3468#true} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {3468#true} is VALID [2022-02-20 14:04:11,629 INFO L290 TraceCheckUtils]: 94: Hoare triple {3468#true} assume !(main_~i~0#1 < 100000); {3468#true} is VALID [2022-02-20 14:04:11,630 INFO L290 TraceCheckUtils]: 95: Hoare triple {3468#true} main_~i~0#1 := 0; {3468#true} is VALID [2022-02-20 14:04:11,630 INFO L290 TraceCheckUtils]: 96: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {3468#true} is VALID [2022-02-20 14:04:11,630 INFO L290 TraceCheckUtils]: 97: Hoare triple {3468#true} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3468#true} is VALID [2022-02-20 14:04:11,630 INFO L290 TraceCheckUtils]: 98: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {3468#true} is VALID [2022-02-20 14:04:11,630 INFO L290 TraceCheckUtils]: 99: Hoare triple {3468#true} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3468#true} is VALID [2022-02-20 14:04:11,630 INFO L290 TraceCheckUtils]: 100: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {3468#true} is VALID [2022-02-20 14:04:11,630 INFO L290 TraceCheckUtils]: 101: Hoare triple {3468#true} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3468#true} is VALID [2022-02-20 14:04:11,631 INFO L290 TraceCheckUtils]: 102: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {3468#true} is VALID [2022-02-20 14:04:11,631 INFO L290 TraceCheckUtils]: 103: Hoare triple {3468#true} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3468#true} is VALID [2022-02-20 14:04:11,631 INFO L290 TraceCheckUtils]: 104: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {3468#true} is VALID [2022-02-20 14:04:11,631 INFO L290 TraceCheckUtils]: 105: Hoare triple {3468#true} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3468#true} is VALID [2022-02-20 14:04:11,631 INFO L290 TraceCheckUtils]: 106: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {3468#true} is VALID [2022-02-20 14:04:11,631 INFO L290 TraceCheckUtils]: 107: Hoare triple {3468#true} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3468#true} is VALID [2022-02-20 14:04:11,632 INFO L290 TraceCheckUtils]: 108: Hoare triple {3468#true} assume !(main_~i~0#1 < 100000); {3468#true} is VALID [2022-02-20 14:04:11,632 INFO L290 TraceCheckUtils]: 109: Hoare triple {3468#true} main_~i~0#1 := 0; {3468#true} is VALID [2022-02-20 14:04:11,632 INFO L290 TraceCheckUtils]: 110: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {3468#true} is VALID [2022-02-20 14:04:11,632 INFO L290 TraceCheckUtils]: 111: Hoare triple {3468#true} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {3468#true} is VALID [2022-02-20 14:04:11,632 INFO L290 TraceCheckUtils]: 112: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {3468#true} is VALID [2022-02-20 14:04:11,632 INFO L290 TraceCheckUtils]: 113: Hoare triple {3468#true} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {3468#true} is VALID [2022-02-20 14:04:11,632 INFO L290 TraceCheckUtils]: 114: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {3468#true} is VALID [2022-02-20 14:04:11,633 INFO L290 TraceCheckUtils]: 115: Hoare triple {3468#true} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {3468#true} is VALID [2022-02-20 14:04:11,633 INFO L290 TraceCheckUtils]: 116: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {3468#true} is VALID [2022-02-20 14:04:11,634 INFO L290 TraceCheckUtils]: 117: Hoare triple {3468#true} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {3468#true} is VALID [2022-02-20 14:04:11,634 INFO L290 TraceCheckUtils]: 118: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {3468#true} is VALID [2022-02-20 14:04:11,634 INFO L290 TraceCheckUtils]: 119: Hoare triple {3468#true} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {3468#true} is VALID [2022-02-20 14:04:11,634 INFO L290 TraceCheckUtils]: 120: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {3468#true} is VALID [2022-02-20 14:04:11,635 INFO L290 TraceCheckUtils]: 121: Hoare triple {3468#true} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {3468#true} is VALID [2022-02-20 14:04:11,635 INFO L290 TraceCheckUtils]: 122: Hoare triple {3468#true} assume !(main_~i~0#1 < 100000); {3468#true} is VALID [2022-02-20 14:04:11,635 INFO L290 TraceCheckUtils]: 123: Hoare triple {3468#true} main_~i~0#1 := 0; {3854#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:04:11,636 INFO L290 TraceCheckUtils]: 124: Hoare triple {3854#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem18#1, main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem18#1; {3854#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:04:11,636 INFO L290 TraceCheckUtils]: 125: Hoare triple {3854#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {3861#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:04:11,637 INFO L290 TraceCheckUtils]: 126: Hoare triple {3861#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem18#1, main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem18#1; {3861#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:04:11,637 INFO L290 TraceCheckUtils]: 127: Hoare triple {3861#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {3868#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:04:11,637 INFO L290 TraceCheckUtils]: 128: Hoare triple {3868#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem18#1, main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem18#1; {3868#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:04:11,638 INFO L290 TraceCheckUtils]: 129: Hoare triple {3868#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {3875#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:04:11,638 INFO L290 TraceCheckUtils]: 130: Hoare triple {3875#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem18#1, main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem18#1; {3875#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:04:11,639 INFO L290 TraceCheckUtils]: 131: Hoare triple {3875#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {3882#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:04:11,639 INFO L290 TraceCheckUtils]: 132: Hoare triple {3882#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem18#1, main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem18#1; {3882#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:04:11,640 INFO L290 TraceCheckUtils]: 133: Hoare triple {3882#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {3889#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:04:11,640 INFO L290 TraceCheckUtils]: 134: Hoare triple {3889#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem18#1, main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem18#1; {3889#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:04:11,640 INFO L290 TraceCheckUtils]: 135: Hoare triple {3889#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {3896#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:04:11,641 INFO L290 TraceCheckUtils]: 136: Hoare triple {3896#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !(main_~i~0#1 < 100000); {3469#false} is VALID [2022-02-20 14:04:11,641 INFO L290 TraceCheckUtils]: 137: Hoare triple {3469#false} main_~i~0#1 := 0; {3469#false} is VALID [2022-02-20 14:04:11,641 INFO L290 TraceCheckUtils]: 138: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem20#1 := read~int(main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem20#1, main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem20#1; {3469#false} is VALID [2022-02-20 14:04:11,641 INFO L290 TraceCheckUtils]: 139: Hoare triple {3469#false} main_#t~post19#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; {3469#false} is VALID [2022-02-20 14:04:11,641 INFO L290 TraceCheckUtils]: 140: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem20#1 := read~int(main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem20#1, main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem20#1; {3469#false} is VALID [2022-02-20 14:04:11,642 INFO L290 TraceCheckUtils]: 141: Hoare triple {3469#false} main_#t~post19#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; {3469#false} is VALID [2022-02-20 14:04:11,642 INFO L290 TraceCheckUtils]: 142: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem20#1 := read~int(main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem20#1, main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem20#1; {3469#false} is VALID [2022-02-20 14:04:11,642 INFO L290 TraceCheckUtils]: 143: Hoare triple {3469#false} main_#t~post19#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; {3469#false} is VALID [2022-02-20 14:04:11,642 INFO L290 TraceCheckUtils]: 144: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem20#1 := read~int(main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem20#1, main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem20#1; {3469#false} is VALID [2022-02-20 14:04:11,642 INFO L290 TraceCheckUtils]: 145: Hoare triple {3469#false} main_#t~post19#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; {3469#false} is VALID [2022-02-20 14:04:11,643 INFO L290 TraceCheckUtils]: 146: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem20#1 := read~int(main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem20#1, main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem20#1; {3469#false} is VALID [2022-02-20 14:04:11,643 INFO L290 TraceCheckUtils]: 147: Hoare triple {3469#false} main_#t~post19#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; {3469#false} is VALID [2022-02-20 14:04:11,643 INFO L290 TraceCheckUtils]: 148: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem20#1 := read~int(main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem20#1, main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem20#1; {3469#false} is VALID [2022-02-20 14:04:11,643 INFO L290 TraceCheckUtils]: 149: Hoare triple {3469#false} main_#t~post19#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; {3469#false} is VALID [2022-02-20 14:04:11,643 INFO L290 TraceCheckUtils]: 150: Hoare triple {3469#false} assume !(main_~i~0#1 < 100000); {3469#false} is VALID [2022-02-20 14:04:11,643 INFO L290 TraceCheckUtils]: 151: Hoare triple {3469#false} havoc main_~x~0#1;main_~x~0#1 := 0; {3469#false} is VALID [2022-02-20 14:04:11,643 INFO L290 TraceCheckUtils]: 152: Hoare triple {3469#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem22#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem23#1 := read~int(main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem22#1 == main_#t~mem23#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3469#false} is VALID [2022-02-20 14:04:11,644 INFO L290 TraceCheckUtils]: 153: Hoare triple {3469#false} assume 0 == __VERIFIER_assert_~cond#1; {3469#false} is VALID [2022-02-20 14:04:11,644 INFO L290 TraceCheckUtils]: 154: Hoare triple {3469#false} assume !false; {3469#false} is VALID [2022-02-20 14:04:11,644 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 409 trivial. 0 not checked. [2022-02-20 14:04:11,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:04:12,048 INFO L290 TraceCheckUtils]: 154: Hoare triple {3469#false} assume !false; {3469#false} is VALID [2022-02-20 14:04:12,048 INFO L290 TraceCheckUtils]: 153: Hoare triple {3469#false} assume 0 == __VERIFIER_assert_~cond#1; {3469#false} is VALID [2022-02-20 14:04:12,049 INFO L290 TraceCheckUtils]: 152: Hoare triple {3469#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem22#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem23#1 := read~int(main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem22#1 == main_#t~mem23#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3469#false} is VALID [2022-02-20 14:04:12,049 INFO L290 TraceCheckUtils]: 151: Hoare triple {3469#false} havoc main_~x~0#1;main_~x~0#1 := 0; {3469#false} is VALID [2022-02-20 14:04:12,049 INFO L290 TraceCheckUtils]: 150: Hoare triple {3469#false} assume !(main_~i~0#1 < 100000); {3469#false} is VALID [2022-02-20 14:04:12,049 INFO L290 TraceCheckUtils]: 149: Hoare triple {3469#false} main_#t~post19#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; {3469#false} is VALID [2022-02-20 14:04:12,049 INFO L290 TraceCheckUtils]: 148: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem20#1 := read~int(main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem20#1, main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem20#1; {3469#false} is VALID [2022-02-20 14:04:12,049 INFO L290 TraceCheckUtils]: 147: Hoare triple {3469#false} main_#t~post19#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; {3469#false} is VALID [2022-02-20 14:04:12,049 INFO L290 TraceCheckUtils]: 146: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem20#1 := read~int(main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem20#1, main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem20#1; {3469#false} is VALID [2022-02-20 14:04:12,049 INFO L290 TraceCheckUtils]: 145: Hoare triple {3469#false} main_#t~post19#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; {3469#false} is VALID [2022-02-20 14:04:12,049 INFO L290 TraceCheckUtils]: 144: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem20#1 := read~int(main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem20#1, main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem20#1; {3469#false} is VALID [2022-02-20 14:04:12,049 INFO L290 TraceCheckUtils]: 143: Hoare triple {3469#false} main_#t~post19#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; {3469#false} is VALID [2022-02-20 14:04:12,049 INFO L290 TraceCheckUtils]: 142: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem20#1 := read~int(main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem20#1, main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem20#1; {3469#false} is VALID [2022-02-20 14:04:12,049 INFO L290 TraceCheckUtils]: 141: Hoare triple {3469#false} main_#t~post19#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; {3469#false} is VALID [2022-02-20 14:04:12,049 INFO L290 TraceCheckUtils]: 140: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem20#1 := read~int(main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem20#1, main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem20#1; {3469#false} is VALID [2022-02-20 14:04:12,050 INFO L290 TraceCheckUtils]: 139: Hoare triple {3469#false} main_#t~post19#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; {3469#false} is VALID [2022-02-20 14:04:12,050 INFO L290 TraceCheckUtils]: 138: Hoare triple {3469#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem20#1 := read~int(main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem20#1, main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem20#1; {3469#false} is VALID [2022-02-20 14:04:12,050 INFO L290 TraceCheckUtils]: 137: Hoare triple {3469#false} main_~i~0#1 := 0; {3469#false} is VALID [2022-02-20 14:04:12,050 INFO L290 TraceCheckUtils]: 136: Hoare triple {4008#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {3469#false} is VALID [2022-02-20 14:04:12,050 INFO L290 TraceCheckUtils]: 135: Hoare triple {4012#(< |ULTIMATE.start_main_~i~0#1| 99999)} main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {4008#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:04:12,051 INFO L290 TraceCheckUtils]: 134: Hoare triple {4012#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume !!(main_~i~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem18#1, main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem18#1; {4012#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:04:12,051 INFO L290 TraceCheckUtils]: 133: Hoare triple {4019#(< |ULTIMATE.start_main_~i~0#1| 99998)} main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {4012#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:04:12,051 INFO L290 TraceCheckUtils]: 132: Hoare triple {4019#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~i~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem18#1, main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem18#1; {4019#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:04:12,052 INFO L290 TraceCheckUtils]: 131: Hoare triple {4026#(< |ULTIMATE.start_main_~i~0#1| 99997)} main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {4019#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:04:12,052 INFO L290 TraceCheckUtils]: 130: Hoare triple {4026#(< |ULTIMATE.start_main_~i~0#1| 99997)} assume !!(main_~i~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem18#1, main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem18#1; {4026#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:04:12,053 INFO L290 TraceCheckUtils]: 129: Hoare triple {4033#(< |ULTIMATE.start_main_~i~0#1| 99996)} main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {4026#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:04:12,053 INFO L290 TraceCheckUtils]: 128: Hoare triple {4033#(< |ULTIMATE.start_main_~i~0#1| 99996)} assume !!(main_~i~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem18#1, main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem18#1; {4033#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:04:12,053 INFO L290 TraceCheckUtils]: 127: Hoare triple {4040#(< |ULTIMATE.start_main_~i~0#1| 99995)} main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {4033#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:04:12,054 INFO L290 TraceCheckUtils]: 126: Hoare triple {4040#(< |ULTIMATE.start_main_~i~0#1| 99995)} assume !!(main_~i~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem18#1, main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem18#1; {4040#(< |ULTIMATE.start_main_~i~0#1| 99995)} is VALID [2022-02-20 14:04:12,054 INFO L290 TraceCheckUtils]: 125: Hoare triple {4047#(< |ULTIMATE.start_main_~i~0#1| 99994)} main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {4040#(< |ULTIMATE.start_main_~i~0#1| 99995)} is VALID [2022-02-20 14:04:12,054 INFO L290 TraceCheckUtils]: 124: Hoare triple {4047#(< |ULTIMATE.start_main_~i~0#1| 99994)} assume !!(main_~i~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem18#1, main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem18#1; {4047#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-20 14:04:12,055 INFO L290 TraceCheckUtils]: 123: Hoare triple {3468#true} main_~i~0#1 := 0; {4047#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-20 14:04:12,055 INFO L290 TraceCheckUtils]: 122: Hoare triple {3468#true} assume !(main_~i~0#1 < 100000); {3468#true} is VALID [2022-02-20 14:04:12,055 INFO L290 TraceCheckUtils]: 121: Hoare triple {3468#true} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {3468#true} is VALID [2022-02-20 14:04:12,055 INFO L290 TraceCheckUtils]: 120: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {3468#true} is VALID [2022-02-20 14:04:12,055 INFO L290 TraceCheckUtils]: 119: Hoare triple {3468#true} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {3468#true} is VALID [2022-02-20 14:04:12,055 INFO L290 TraceCheckUtils]: 118: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {3468#true} is VALID [2022-02-20 14:04:12,055 INFO L290 TraceCheckUtils]: 117: Hoare triple {3468#true} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {3468#true} is VALID [2022-02-20 14:04:12,055 INFO L290 TraceCheckUtils]: 116: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {3468#true} is VALID [2022-02-20 14:04:12,055 INFO L290 TraceCheckUtils]: 115: Hoare triple {3468#true} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {3468#true} is VALID [2022-02-20 14:04:12,055 INFO L290 TraceCheckUtils]: 114: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {3468#true} is VALID [2022-02-20 14:04:12,055 INFO L290 TraceCheckUtils]: 113: Hoare triple {3468#true} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {3468#true} is VALID [2022-02-20 14:04:12,055 INFO L290 TraceCheckUtils]: 112: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {3468#true} is VALID [2022-02-20 14:04:12,055 INFO L290 TraceCheckUtils]: 111: Hoare triple {3468#true} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {3468#true} is VALID [2022-02-20 14:04:12,056 INFO L290 TraceCheckUtils]: 110: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {3468#true} is VALID [2022-02-20 14:04:12,056 INFO L290 TraceCheckUtils]: 109: Hoare triple {3468#true} main_~i~0#1 := 0; {3468#true} is VALID [2022-02-20 14:04:12,056 INFO L290 TraceCheckUtils]: 108: Hoare triple {3468#true} assume !(main_~i~0#1 < 100000); {3468#true} is VALID [2022-02-20 14:04:12,056 INFO L290 TraceCheckUtils]: 107: Hoare triple {3468#true} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3468#true} is VALID [2022-02-20 14:04:12,056 INFO L290 TraceCheckUtils]: 106: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {3468#true} is VALID [2022-02-20 14:04:12,056 INFO L290 TraceCheckUtils]: 105: Hoare triple {3468#true} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3468#true} is VALID [2022-02-20 14:04:12,056 INFO L290 TraceCheckUtils]: 104: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {3468#true} is VALID [2022-02-20 14:04:12,056 INFO L290 TraceCheckUtils]: 103: Hoare triple {3468#true} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3468#true} is VALID [2022-02-20 14:04:12,056 INFO L290 TraceCheckUtils]: 102: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {3468#true} is VALID [2022-02-20 14:04:12,056 INFO L290 TraceCheckUtils]: 101: Hoare triple {3468#true} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3468#true} is VALID [2022-02-20 14:04:12,056 INFO L290 TraceCheckUtils]: 100: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {3468#true} is VALID [2022-02-20 14:04:12,064 INFO L290 TraceCheckUtils]: 99: Hoare triple {3468#true} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3468#true} is VALID [2022-02-20 14:04:12,064 INFO L290 TraceCheckUtils]: 98: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {3468#true} is VALID [2022-02-20 14:04:12,064 INFO L290 TraceCheckUtils]: 97: Hoare triple {3468#true} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3468#true} is VALID [2022-02-20 14:04:12,065 INFO L290 TraceCheckUtils]: 96: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {3468#true} is VALID [2022-02-20 14:04:12,065 INFO L290 TraceCheckUtils]: 95: Hoare triple {3468#true} main_~i~0#1 := 0; {3468#true} is VALID [2022-02-20 14:04:12,065 INFO L290 TraceCheckUtils]: 94: Hoare triple {3468#true} assume !(main_~i~0#1 < 100000); {3468#true} is VALID [2022-02-20 14:04:12,065 INFO L290 TraceCheckUtils]: 93: Hoare triple {3468#true} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {3468#true} is VALID [2022-02-20 14:04:12,065 INFO L290 TraceCheckUtils]: 92: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {3468#true} is VALID [2022-02-20 14:04:12,065 INFO L290 TraceCheckUtils]: 91: Hoare triple {3468#true} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {3468#true} is VALID [2022-02-20 14:04:12,065 INFO L290 TraceCheckUtils]: 90: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {3468#true} is VALID [2022-02-20 14:04:12,066 INFO L290 TraceCheckUtils]: 89: Hoare triple {3468#true} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {3468#true} is VALID [2022-02-20 14:04:12,066 INFO L290 TraceCheckUtils]: 88: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {3468#true} is VALID [2022-02-20 14:04:12,066 INFO L290 TraceCheckUtils]: 87: Hoare triple {3468#true} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {3468#true} is VALID [2022-02-20 14:04:12,066 INFO L290 TraceCheckUtils]: 86: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {3468#true} is VALID [2022-02-20 14:04:12,066 INFO L290 TraceCheckUtils]: 85: Hoare triple {3468#true} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {3468#true} is VALID [2022-02-20 14:04:12,066 INFO L290 TraceCheckUtils]: 84: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {3468#true} is VALID [2022-02-20 14:04:12,067 INFO L290 TraceCheckUtils]: 83: Hoare triple {3468#true} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {3468#true} is VALID [2022-02-20 14:04:12,067 INFO L290 TraceCheckUtils]: 82: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {3468#true} is VALID [2022-02-20 14:04:12,067 INFO L290 TraceCheckUtils]: 81: Hoare triple {3468#true} main_~i~0#1 := 0; {3468#true} is VALID [2022-02-20 14:04:12,067 INFO L290 TraceCheckUtils]: 80: Hoare triple {3468#true} assume !(main_~i~0#1 < 100000); {3468#true} is VALID [2022-02-20 14:04:12,067 INFO L290 TraceCheckUtils]: 79: Hoare triple {3468#true} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3468#true} is VALID [2022-02-20 14:04:12,067 INFO L290 TraceCheckUtils]: 78: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {3468#true} is VALID [2022-02-20 14:04:12,067 INFO L290 TraceCheckUtils]: 77: Hoare triple {3468#true} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3468#true} is VALID [2022-02-20 14:04:12,068 INFO L290 TraceCheckUtils]: 76: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {3468#true} is VALID [2022-02-20 14:04:12,068 INFO L290 TraceCheckUtils]: 75: Hoare triple {3468#true} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3468#true} is VALID [2022-02-20 14:04:12,068 INFO L290 TraceCheckUtils]: 74: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {3468#true} is VALID [2022-02-20 14:04:12,068 INFO L290 TraceCheckUtils]: 73: Hoare triple {3468#true} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3468#true} is VALID [2022-02-20 14:04:12,068 INFO L290 TraceCheckUtils]: 72: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {3468#true} is VALID [2022-02-20 14:04:12,068 INFO L290 TraceCheckUtils]: 71: Hoare triple {3468#true} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3468#true} is VALID [2022-02-20 14:04:12,069 INFO L290 TraceCheckUtils]: 70: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {3468#true} is VALID [2022-02-20 14:04:12,069 INFO L290 TraceCheckUtils]: 69: Hoare triple {3468#true} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3468#true} is VALID [2022-02-20 14:04:12,069 INFO L290 TraceCheckUtils]: 68: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {3468#true} is VALID [2022-02-20 14:04:12,069 INFO L290 TraceCheckUtils]: 67: Hoare triple {3468#true} main_~i~0#1 := 0; {3468#true} is VALID [2022-02-20 14:04:12,069 INFO L290 TraceCheckUtils]: 66: Hoare triple {3468#true} assume !(main_~i~0#1 < 100000); {3468#true} is VALID [2022-02-20 14:04:12,069 INFO L290 TraceCheckUtils]: 65: Hoare triple {3468#true} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3468#true} is VALID [2022-02-20 14:04:12,069 INFO L290 TraceCheckUtils]: 64: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {3468#true} is VALID [2022-02-20 14:04:12,070 INFO L290 TraceCheckUtils]: 63: Hoare triple {3468#true} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3468#true} is VALID [2022-02-20 14:04:12,070 INFO L290 TraceCheckUtils]: 62: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {3468#true} is VALID [2022-02-20 14:04:12,070 INFO L290 TraceCheckUtils]: 61: Hoare triple {3468#true} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3468#true} is VALID [2022-02-20 14:04:12,070 INFO L290 TraceCheckUtils]: 60: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {3468#true} is VALID [2022-02-20 14:04:12,070 INFO L290 TraceCheckUtils]: 59: Hoare triple {3468#true} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3468#true} is VALID [2022-02-20 14:04:12,070 INFO L290 TraceCheckUtils]: 58: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {3468#true} is VALID [2022-02-20 14:04:12,071 INFO L290 TraceCheckUtils]: 57: Hoare triple {3468#true} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3468#true} is VALID [2022-02-20 14:04:12,071 INFO L290 TraceCheckUtils]: 56: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {3468#true} is VALID [2022-02-20 14:04:12,071 INFO L290 TraceCheckUtils]: 55: Hoare triple {3468#true} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3468#true} is VALID [2022-02-20 14:04:12,071 INFO L290 TraceCheckUtils]: 54: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {3468#true} is VALID [2022-02-20 14:04:12,071 INFO L290 TraceCheckUtils]: 53: Hoare triple {3468#true} main_~i~0#1 := 0; {3468#true} is VALID [2022-02-20 14:04:12,071 INFO L290 TraceCheckUtils]: 52: Hoare triple {3468#true} assume !(main_~i~0#1 < 100000); {3468#true} is VALID [2022-02-20 14:04:12,071 INFO L290 TraceCheckUtils]: 51: Hoare triple {3468#true} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3468#true} is VALID [2022-02-20 14:04:12,072 INFO L290 TraceCheckUtils]: 50: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {3468#true} is VALID [2022-02-20 14:04:12,072 INFO L290 TraceCheckUtils]: 49: Hoare triple {3468#true} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3468#true} is VALID [2022-02-20 14:04:12,072 INFO L290 TraceCheckUtils]: 48: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {3468#true} is VALID [2022-02-20 14:04:12,072 INFO L290 TraceCheckUtils]: 47: Hoare triple {3468#true} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3468#true} is VALID [2022-02-20 14:04:12,072 INFO L290 TraceCheckUtils]: 46: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {3468#true} is VALID [2022-02-20 14:04:12,072 INFO L290 TraceCheckUtils]: 45: Hoare triple {3468#true} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3468#true} is VALID [2022-02-20 14:04:12,073 INFO L290 TraceCheckUtils]: 44: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {3468#true} is VALID [2022-02-20 14:04:12,073 INFO L290 TraceCheckUtils]: 43: Hoare triple {3468#true} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3468#true} is VALID [2022-02-20 14:04:12,073 INFO L290 TraceCheckUtils]: 42: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {3468#true} is VALID [2022-02-20 14:04:12,073 INFO L290 TraceCheckUtils]: 41: Hoare triple {3468#true} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3468#true} is VALID [2022-02-20 14:04:12,073 INFO L290 TraceCheckUtils]: 40: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {3468#true} is VALID [2022-02-20 14:04:12,073 INFO L290 TraceCheckUtils]: 39: Hoare triple {3468#true} main_~i~0#1 := 0; {3468#true} is VALID [2022-02-20 14:04:12,073 INFO L290 TraceCheckUtils]: 38: Hoare triple {3468#true} assume !(main_~i~0#1 < 100000); {3468#true} is VALID [2022-02-20 14:04:12,074 INFO L290 TraceCheckUtils]: 37: Hoare triple {3468#true} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3468#true} is VALID [2022-02-20 14:04:12,074 INFO L290 TraceCheckUtils]: 36: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {3468#true} is VALID [2022-02-20 14:04:12,074 INFO L290 TraceCheckUtils]: 35: Hoare triple {3468#true} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3468#true} is VALID [2022-02-20 14:04:12,074 INFO L290 TraceCheckUtils]: 34: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {3468#true} is VALID [2022-02-20 14:04:12,074 INFO L290 TraceCheckUtils]: 33: Hoare triple {3468#true} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3468#true} is VALID [2022-02-20 14:04:12,074 INFO L290 TraceCheckUtils]: 32: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {3468#true} is VALID [2022-02-20 14:04:12,075 INFO L290 TraceCheckUtils]: 31: Hoare triple {3468#true} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3468#true} is VALID [2022-02-20 14:04:12,075 INFO L290 TraceCheckUtils]: 30: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {3468#true} is VALID [2022-02-20 14:04:12,075 INFO L290 TraceCheckUtils]: 29: Hoare triple {3468#true} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3468#true} is VALID [2022-02-20 14:04:12,075 INFO L290 TraceCheckUtils]: 28: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {3468#true} is VALID [2022-02-20 14:04:12,075 INFO L290 TraceCheckUtils]: 27: Hoare triple {3468#true} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3468#true} is VALID [2022-02-20 14:04:12,075 INFO L290 TraceCheckUtils]: 26: Hoare triple {3468#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {3468#true} is VALID [2022-02-20 14:04:12,075 INFO L290 TraceCheckUtils]: 25: Hoare triple {3468#true} havoc main_~i~0#1;main_~i~0#1 := 0; {3468#true} is VALID [2022-02-20 14:04:12,076 INFO L290 TraceCheckUtils]: 24: Hoare triple {3468#true} assume !(main_~a~0#1 < 100000); {3468#true} is VALID [2022-02-20 14:04:12,076 INFO L290 TraceCheckUtils]: 23: Hoare triple {3468#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3468#true} is VALID [2022-02-20 14:04:12,076 INFO L290 TraceCheckUtils]: 22: Hoare triple {3468#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {3468#true} is VALID [2022-02-20 14:04:12,076 INFO L290 TraceCheckUtils]: 21: Hoare triple {3468#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3468#true} is VALID [2022-02-20 14:04:12,076 INFO L290 TraceCheckUtils]: 20: Hoare triple {3468#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {3468#true} is VALID [2022-02-20 14:04:12,076 INFO L290 TraceCheckUtils]: 19: Hoare triple {3468#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3468#true} is VALID [2022-02-20 14:04:12,076 INFO L290 TraceCheckUtils]: 18: Hoare triple {3468#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {3468#true} is VALID [2022-02-20 14:04:12,077 INFO L290 TraceCheckUtils]: 17: Hoare triple {3468#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3468#true} is VALID [2022-02-20 14:04:12,077 INFO L290 TraceCheckUtils]: 16: Hoare triple {3468#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {3468#true} is VALID [2022-02-20 14:04:12,077 INFO L290 TraceCheckUtils]: 15: Hoare triple {3468#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3468#true} is VALID [2022-02-20 14:04:12,077 INFO L290 TraceCheckUtils]: 14: Hoare triple {3468#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {3468#true} is VALID [2022-02-20 14:04:12,077 INFO L290 TraceCheckUtils]: 13: Hoare triple {3468#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3468#true} is VALID [2022-02-20 14:04:12,077 INFO L290 TraceCheckUtils]: 12: Hoare triple {3468#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {3468#true} is VALID [2022-02-20 14:04:12,078 INFO L290 TraceCheckUtils]: 11: Hoare triple {3468#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3468#true} is VALID [2022-02-20 14:04:12,078 INFO L290 TraceCheckUtils]: 10: Hoare triple {3468#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {3468#true} is VALID [2022-02-20 14:04:12,078 INFO L290 TraceCheckUtils]: 9: Hoare triple {3468#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3468#true} is VALID [2022-02-20 14:04:12,078 INFO L290 TraceCheckUtils]: 8: Hoare triple {3468#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {3468#true} is VALID [2022-02-20 14:04:12,078 INFO L290 TraceCheckUtils]: 7: Hoare triple {3468#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3468#true} is VALID [2022-02-20 14:04:12,078 INFO L290 TraceCheckUtils]: 6: Hoare triple {3468#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {3468#true} is VALID [2022-02-20 14:04:12,079 INFO L290 TraceCheckUtils]: 5: Hoare triple {3468#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3468#true} is VALID [2022-02-20 14:04:12,079 INFO L290 TraceCheckUtils]: 4: Hoare triple {3468#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {3468#true} is VALID [2022-02-20 14:04:12,079 INFO L290 TraceCheckUtils]: 3: Hoare triple {3468#true} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3468#true} is VALID [2022-02-20 14:04:12,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {3468#true} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {3468#true} is VALID [2022-02-20 14:04:12,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {3468#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem4#1, main_#t~post3#1, main_#t~mem6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~post11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~mem16#1, main_#t~post15#1, main_#t~mem18#1, main_#t~post17#1, main_#t~mem20#1, main_#t~post19#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~#a5~0#1.base, main_~#a5~0#1.offset, main_~#a6~0#1.base, main_~#a6~0#1.offset, main_~#a7~0#1.base, main_~#a7~0#1.offset, main_~#a8~0#1.base, main_~#a8~0#1.offset, main_~#a9~0#1.base, main_~#a9~0#1.offset, main_~#a0~0#1.base, main_~#a0~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a6~0#1.base, main_~#a6~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a7~0#1.base, main_~#a7~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a8~0#1.base, main_~#a8~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a9~0#1.base, main_~#a9~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a0~0#1.base, main_~#a0~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {3468#true} is VALID [2022-02-20 14:04:12,080 INFO L290 TraceCheckUtils]: 0: Hoare triple {3468#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(26, 2); {3468#true} is VALID [2022-02-20 14:04:12,080 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 409 trivial. 0 not checked. [2022-02-20 14:04:12,080 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17696096] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:04:12,080 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:04:12,081 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 9] total 28 [2022-02-20 14:04:12,081 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927516681] [2022-02-20 14:04:12,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:04:12,082 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.464285714285714) internal successors, (125), 28 states have internal predecessors, (125), 0 states have call successors, (0), 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 155 [2022-02-20 14:04:12,082 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:04:12,083 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 4.464285714285714) internal successors, (125), 28 states have internal predecessors, (125), 0 states have call successors, (0), 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:04:12,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:04:12,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-02-20 14:04:12,168 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:04:12,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-02-20 14:04:12,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2022-02-20 14:04:12,170 INFO L87 Difference]: Start difference. First operand 158 states and 168 transitions. Second operand has 28 states, 28 states have (on average 4.464285714285714) internal successors, (125), 28 states have internal predecessors, (125), 0 states have call successors, (0), 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:04:13,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:13,377 INFO L93 Difference]: Finished difference Result 438 states and 530 transitions. [2022-02-20 14:04:13,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-02-20 14:04:13,377 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.464285714285714) internal successors, (125), 28 states have internal predecessors, (125), 0 states have call successors, (0), 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 155 [2022-02-20 14:04:13,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:04:13,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 4.464285714285714) internal successors, (125), 28 states have internal predecessors, (125), 0 states have call successors, (0), 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:04:13,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 431 transitions. [2022-02-20 14:04:13,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 4.464285714285714) internal successors, (125), 28 states have internal predecessors, (125), 0 states have call successors, (0), 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:04:13,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 431 transitions. [2022-02-20 14:04:13,387 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 431 transitions. [2022-02-20 14:04:13,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 431 edges. 431 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:04:13,661 INFO L225 Difference]: With dead ends: 438 [2022-02-20 14:04:13,661 INFO L226 Difference]: Without dead ends: 305 [2022-02-20 14:04:13,662 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2022-02-20 14:04:13,663 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 377 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 430 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 14:04:13,663 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [377 Valid, 107 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [430 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 14:04:13,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2022-02-20 14:04:13,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 304. [2022-02-20 14:04:13,768 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:04:13,768 INFO L82 GeneralOperation]: Start isEquivalent. First operand 305 states. Second operand has 304 states, 303 states have (on average 1.0363036303630364) internal successors, (314), 303 states have internal predecessors, (314), 0 states have call successors, (0), 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:04:13,769 INFO L74 IsIncluded]: Start isIncluded. First operand 305 states. Second operand has 304 states, 303 states have (on average 1.0363036303630364) internal successors, (314), 303 states have internal predecessors, (314), 0 states have call successors, (0), 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:04:13,769 INFO L87 Difference]: Start difference. First operand 305 states. Second operand has 304 states, 303 states have (on average 1.0363036303630364) internal successors, (314), 303 states have internal predecessors, (314), 0 states have call successors, (0), 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:04:13,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:13,777 INFO L93 Difference]: Finished difference Result 305 states and 315 transitions. [2022-02-20 14:04:13,778 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 315 transitions. [2022-02-20 14:04:13,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:04:13,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:04:13,779 INFO L74 IsIncluded]: Start isIncluded. First operand has 304 states, 303 states have (on average 1.0363036303630364) internal successors, (314), 303 states have internal predecessors, (314), 0 states have call successors, (0), 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 305 states. [2022-02-20 14:04:13,780 INFO L87 Difference]: Start difference. First operand has 304 states, 303 states have (on average 1.0363036303630364) internal successors, (314), 303 states have internal predecessors, (314), 0 states have call successors, (0), 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 305 states. [2022-02-20 14:04:13,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:13,787 INFO L93 Difference]: Finished difference Result 305 states and 315 transitions. [2022-02-20 14:04:13,787 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 315 transitions. [2022-02-20 14:04:13,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:04:13,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:04:13,788 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:04:13,788 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:04:13,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 303 states have (on average 1.0363036303630364) internal successors, (314), 303 states have internal predecessors, (314), 0 states have call successors, (0), 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:04:13,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 314 transitions. [2022-02-20 14:04:13,798 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 314 transitions. Word has length 155 [2022-02-20 14:04:13,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:04:13,798 INFO L470 AbstractCegarLoop]: Abstraction has 304 states and 314 transitions. [2022-02-20 14:04:13,798 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.464285714285714) internal successors, (125), 28 states have internal predecessors, (125), 0 states have call successors, (0), 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:04:13,799 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 314 transitions. [2022-02-20 14:04:13,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2022-02-20 14:04:13,802 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:04:13,803 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:04:13,835 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:04:14,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:04:14,020 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:04:14,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:04:14,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1642142321, now seen corresponding path program 5 times [2022-02-20 14:04:14,020 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:04:14,020 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574669608] [2022-02-20 14:04:14,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:04:14,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:04:14,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:04:14,401 INFO L290 TraceCheckUtils]: 0: Hoare triple {6136#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(26, 2); {6136#true} is VALID [2022-02-20 14:04:14,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {6136#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~mem4#1, main_#t~post3#1, main_#t~mem6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~post11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~mem16#1, main_#t~post15#1, main_#t~mem18#1, main_#t~post17#1, main_#t~mem20#1, main_#t~post19#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_~#a1~0#1.base, main_~#a1~0#1.offset, main_~#a2~0#1.base, main_~#a2~0#1.offset, main_~#a3~0#1.base, main_~#a3~0#1.offset, main_~#a4~0#1.base, main_~#a4~0#1.offset, main_~#a5~0#1.base, main_~#a5~0#1.offset, main_~#a6~0#1.base, main_~#a6~0#1.offset, main_~#a7~0#1.base, main_~#a7~0#1.offset, main_~#a8~0#1.base, main_~#a8~0#1.offset, main_~#a9~0#1.base, main_~#a9~0#1.offset, main_~#a0~0#1.base, main_~#a0~0#1.offset, main_~a~0#1, main_~i~0#1, main_~x~0#1;call main_~#a1~0#1.base, main_~#a1~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a2~0#1.base, main_~#a2~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a3~0#1.base, main_~#a3~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a4~0#1.base, main_~#a4~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a5~0#1.base, main_~#a5~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a6~0#1.base, main_~#a6~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a7~0#1.base, main_~#a7~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a8~0#1.base, main_~#a8~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a9~0#1.base, main_~#a9~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#a0~0#1.base, main_~#a0~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~a~0#1;main_~a~0#1 := 0; {6138#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:04:14,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {6138#(= |ULTIMATE.start_main_~a~0#1| 0)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {6138#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:04:14,403 INFO L290 TraceCheckUtils]: 3: Hoare triple {6138#(= |ULTIMATE.start_main_~a~0#1| 0)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {6139#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:04:14,403 INFO L290 TraceCheckUtils]: 4: Hoare triple {6139#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {6139#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:04:14,404 INFO L290 TraceCheckUtils]: 5: Hoare triple {6139#(<= |ULTIMATE.start_main_~a~0#1| 1)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {6140#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:04:14,404 INFO L290 TraceCheckUtils]: 6: Hoare triple {6140#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {6140#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:04:14,404 INFO L290 TraceCheckUtils]: 7: Hoare triple {6140#(<= |ULTIMATE.start_main_~a~0#1| 2)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {6141#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:04:14,405 INFO L290 TraceCheckUtils]: 8: Hoare triple {6141#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {6141#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:04:14,405 INFO L290 TraceCheckUtils]: 9: Hoare triple {6141#(<= |ULTIMATE.start_main_~a~0#1| 3)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {6142#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:04:14,406 INFO L290 TraceCheckUtils]: 10: Hoare triple {6142#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {6142#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:04:14,406 INFO L290 TraceCheckUtils]: 11: Hoare triple {6142#(<= |ULTIMATE.start_main_~a~0#1| 4)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {6143#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-20 14:04:14,406 INFO L290 TraceCheckUtils]: 12: Hoare triple {6143#(<= |ULTIMATE.start_main_~a~0#1| 5)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {6143#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-20 14:04:14,407 INFO L290 TraceCheckUtils]: 13: Hoare triple {6143#(<= |ULTIMATE.start_main_~a~0#1| 5)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {6144#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-20 14:04:14,407 INFO L290 TraceCheckUtils]: 14: Hoare triple {6144#(<= |ULTIMATE.start_main_~a~0#1| 6)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {6144#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-20 14:04:14,408 INFO L290 TraceCheckUtils]: 15: Hoare triple {6144#(<= |ULTIMATE.start_main_~a~0#1| 6)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {6145#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-20 14:04:14,408 INFO L290 TraceCheckUtils]: 16: Hoare triple {6145#(<= |ULTIMATE.start_main_~a~0#1| 7)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {6145#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-20 14:04:14,408 INFO L290 TraceCheckUtils]: 17: Hoare triple {6145#(<= |ULTIMATE.start_main_~a~0#1| 7)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {6146#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-20 14:04:14,409 INFO L290 TraceCheckUtils]: 18: Hoare triple {6146#(<= |ULTIMATE.start_main_~a~0#1| 8)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {6146#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-20 14:04:14,409 INFO L290 TraceCheckUtils]: 19: Hoare triple {6146#(<= |ULTIMATE.start_main_~a~0#1| 8)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {6147#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-20 14:04:14,410 INFO L290 TraceCheckUtils]: 20: Hoare triple {6147#(<= |ULTIMATE.start_main_~a~0#1| 9)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {6147#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-20 14:04:14,410 INFO L290 TraceCheckUtils]: 21: Hoare triple {6147#(<= |ULTIMATE.start_main_~a~0#1| 9)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {6148#(<= |ULTIMATE.start_main_~a~0#1| 10)} is VALID [2022-02-20 14:04:14,410 INFO L290 TraceCheckUtils]: 22: Hoare triple {6148#(<= |ULTIMATE.start_main_~a~0#1| 10)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {6148#(<= |ULTIMATE.start_main_~a~0#1| 10)} is VALID [2022-02-20 14:04:14,411 INFO L290 TraceCheckUtils]: 23: Hoare triple {6148#(<= |ULTIMATE.start_main_~a~0#1| 10)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {6149#(<= |ULTIMATE.start_main_~a~0#1| 11)} is VALID [2022-02-20 14:04:14,427 INFO L290 TraceCheckUtils]: 24: Hoare triple {6149#(<= |ULTIMATE.start_main_~a~0#1| 11)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;call write~int(main_#t~nondet2#1, main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet2#1; {6149#(<= |ULTIMATE.start_main_~a~0#1| 11)} is VALID [2022-02-20 14:04:14,428 INFO L290 TraceCheckUtils]: 25: Hoare triple {6149#(<= |ULTIMATE.start_main_~a~0#1| 11)} main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {6150#(<= |ULTIMATE.start_main_~a~0#1| 12)} is VALID [2022-02-20 14:04:14,428 INFO L290 TraceCheckUtils]: 26: Hoare triple {6150#(<= |ULTIMATE.start_main_~a~0#1| 12)} assume !(main_~a~0#1 < 100000); {6137#false} is VALID [2022-02-20 14:04:14,429 INFO L290 TraceCheckUtils]: 27: Hoare triple {6137#false} havoc main_~i~0#1;main_~i~0#1 := 0; {6137#false} is VALID [2022-02-20 14:04:14,429 INFO L290 TraceCheckUtils]: 28: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {6137#false} is VALID [2022-02-20 14:04:14,429 INFO L290 TraceCheckUtils]: 29: Hoare triple {6137#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {6137#false} is VALID [2022-02-20 14:04:14,429 INFO L290 TraceCheckUtils]: 30: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {6137#false} is VALID [2022-02-20 14:04:14,429 INFO L290 TraceCheckUtils]: 31: Hoare triple {6137#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {6137#false} is VALID [2022-02-20 14:04:14,429 INFO L290 TraceCheckUtils]: 32: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {6137#false} is VALID [2022-02-20 14:04:14,429 INFO L290 TraceCheckUtils]: 33: Hoare triple {6137#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {6137#false} is VALID [2022-02-20 14:04:14,430 INFO L290 TraceCheckUtils]: 34: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {6137#false} is VALID [2022-02-20 14:04:14,430 INFO L290 TraceCheckUtils]: 35: Hoare triple {6137#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {6137#false} is VALID [2022-02-20 14:04:14,430 INFO L290 TraceCheckUtils]: 36: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {6137#false} is VALID [2022-02-20 14:04:14,430 INFO L290 TraceCheckUtils]: 37: Hoare triple {6137#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {6137#false} is VALID [2022-02-20 14:04:14,430 INFO L290 TraceCheckUtils]: 38: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {6137#false} is VALID [2022-02-20 14:04:14,430 INFO L290 TraceCheckUtils]: 39: Hoare triple {6137#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {6137#false} is VALID [2022-02-20 14:04:14,431 INFO L290 TraceCheckUtils]: 40: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {6137#false} is VALID [2022-02-20 14:04:14,431 INFO L290 TraceCheckUtils]: 41: Hoare triple {6137#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {6137#false} is VALID [2022-02-20 14:04:14,431 INFO L290 TraceCheckUtils]: 42: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {6137#false} is VALID [2022-02-20 14:04:14,431 INFO L290 TraceCheckUtils]: 43: Hoare triple {6137#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {6137#false} is VALID [2022-02-20 14:04:14,431 INFO L290 TraceCheckUtils]: 44: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {6137#false} is VALID [2022-02-20 14:04:14,431 INFO L290 TraceCheckUtils]: 45: Hoare triple {6137#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {6137#false} is VALID [2022-02-20 14:04:14,431 INFO L290 TraceCheckUtils]: 46: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {6137#false} is VALID [2022-02-20 14:04:14,432 INFO L290 TraceCheckUtils]: 47: Hoare triple {6137#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {6137#false} is VALID [2022-02-20 14:04:14,432 INFO L290 TraceCheckUtils]: 48: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {6137#false} is VALID [2022-02-20 14:04:14,432 INFO L290 TraceCheckUtils]: 49: Hoare triple {6137#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {6137#false} is VALID [2022-02-20 14:04:14,432 INFO L290 TraceCheckUtils]: 50: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {6137#false} is VALID [2022-02-20 14:04:14,432 INFO L290 TraceCheckUtils]: 51: Hoare triple {6137#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {6137#false} is VALID [2022-02-20 14:04:14,432 INFO L290 TraceCheckUtils]: 52: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {6137#false} is VALID [2022-02-20 14:04:14,432 INFO L290 TraceCheckUtils]: 53: Hoare triple {6137#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {6137#false} is VALID [2022-02-20 14:04:14,433 INFO L290 TraceCheckUtils]: 54: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem4#1, main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem4#1; {6137#false} is VALID [2022-02-20 14:04:14,433 INFO L290 TraceCheckUtils]: 55: Hoare triple {6137#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {6137#false} is VALID [2022-02-20 14:04:14,433 INFO L290 TraceCheckUtils]: 56: Hoare triple {6137#false} assume !(main_~i~0#1 < 100000); {6137#false} is VALID [2022-02-20 14:04:14,433 INFO L290 TraceCheckUtils]: 57: Hoare triple {6137#false} main_~i~0#1 := 0; {6137#false} is VALID [2022-02-20 14:04:14,433 INFO L290 TraceCheckUtils]: 58: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {6137#false} is VALID [2022-02-20 14:04:14,433 INFO L290 TraceCheckUtils]: 59: Hoare triple {6137#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {6137#false} is VALID [2022-02-20 14:04:14,433 INFO L290 TraceCheckUtils]: 60: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {6137#false} is VALID [2022-02-20 14:04:14,434 INFO L290 TraceCheckUtils]: 61: Hoare triple {6137#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {6137#false} is VALID [2022-02-20 14:04:14,434 INFO L290 TraceCheckUtils]: 62: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {6137#false} is VALID [2022-02-20 14:04:14,434 INFO L290 TraceCheckUtils]: 63: Hoare triple {6137#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {6137#false} is VALID [2022-02-20 14:04:14,434 INFO L290 TraceCheckUtils]: 64: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {6137#false} is VALID [2022-02-20 14:04:14,434 INFO L290 TraceCheckUtils]: 65: Hoare triple {6137#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {6137#false} is VALID [2022-02-20 14:04:14,434 INFO L290 TraceCheckUtils]: 66: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {6137#false} is VALID [2022-02-20 14:04:14,434 INFO L290 TraceCheckUtils]: 67: Hoare triple {6137#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {6137#false} is VALID [2022-02-20 14:04:14,435 INFO L290 TraceCheckUtils]: 68: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {6137#false} is VALID [2022-02-20 14:04:14,435 INFO L290 TraceCheckUtils]: 69: Hoare triple {6137#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {6137#false} is VALID [2022-02-20 14:04:14,435 INFO L290 TraceCheckUtils]: 70: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {6137#false} is VALID [2022-02-20 14:04:14,435 INFO L290 TraceCheckUtils]: 71: Hoare triple {6137#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {6137#false} is VALID [2022-02-20 14:04:14,435 INFO L290 TraceCheckUtils]: 72: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {6137#false} is VALID [2022-02-20 14:04:14,435 INFO L290 TraceCheckUtils]: 73: Hoare triple {6137#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {6137#false} is VALID [2022-02-20 14:04:14,436 INFO L290 TraceCheckUtils]: 74: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {6137#false} is VALID [2022-02-20 14:04:14,436 INFO L290 TraceCheckUtils]: 75: Hoare triple {6137#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {6137#false} is VALID [2022-02-20 14:04:14,436 INFO L290 TraceCheckUtils]: 76: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {6137#false} is VALID [2022-02-20 14:04:14,436 INFO L290 TraceCheckUtils]: 77: Hoare triple {6137#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {6137#false} is VALID [2022-02-20 14:04:14,436 INFO L290 TraceCheckUtils]: 78: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {6137#false} is VALID [2022-02-20 14:04:14,436 INFO L290 TraceCheckUtils]: 79: Hoare triple {6137#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {6137#false} is VALID [2022-02-20 14:04:14,436 INFO L290 TraceCheckUtils]: 80: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {6137#false} is VALID [2022-02-20 14:04:14,437 INFO L290 TraceCheckUtils]: 81: Hoare triple {6137#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {6137#false} is VALID [2022-02-20 14:04:14,437 INFO L290 TraceCheckUtils]: 82: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {6137#false} is VALID [2022-02-20 14:04:14,437 INFO L290 TraceCheckUtils]: 83: Hoare triple {6137#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {6137#false} is VALID [2022-02-20 14:04:14,437 INFO L290 TraceCheckUtils]: 84: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem6#1 := read~int(main_~#a2~0#1.base, main_~#a2~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem6#1; {6137#false} is VALID [2022-02-20 14:04:14,437 INFO L290 TraceCheckUtils]: 85: Hoare triple {6137#false} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {6137#false} is VALID [2022-02-20 14:04:14,437 INFO L290 TraceCheckUtils]: 86: Hoare triple {6137#false} assume !(main_~i~0#1 < 100000); {6137#false} is VALID [2022-02-20 14:04:14,437 INFO L290 TraceCheckUtils]: 87: Hoare triple {6137#false} main_~i~0#1 := 0; {6137#false} is VALID [2022-02-20 14:04:14,438 INFO L290 TraceCheckUtils]: 88: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {6137#false} is VALID [2022-02-20 14:04:14,438 INFO L290 TraceCheckUtils]: 89: Hoare triple {6137#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {6137#false} is VALID [2022-02-20 14:04:14,438 INFO L290 TraceCheckUtils]: 90: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {6137#false} is VALID [2022-02-20 14:04:14,438 INFO L290 TraceCheckUtils]: 91: Hoare triple {6137#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {6137#false} is VALID [2022-02-20 14:04:14,438 INFO L290 TraceCheckUtils]: 92: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {6137#false} is VALID [2022-02-20 14:04:14,438 INFO L290 TraceCheckUtils]: 93: Hoare triple {6137#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {6137#false} is VALID [2022-02-20 14:04:14,438 INFO L290 TraceCheckUtils]: 94: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {6137#false} is VALID [2022-02-20 14:04:14,439 INFO L290 TraceCheckUtils]: 95: Hoare triple {6137#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {6137#false} is VALID [2022-02-20 14:04:14,439 INFO L290 TraceCheckUtils]: 96: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {6137#false} is VALID [2022-02-20 14:04:14,439 INFO L290 TraceCheckUtils]: 97: Hoare triple {6137#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {6137#false} is VALID [2022-02-20 14:04:14,439 INFO L290 TraceCheckUtils]: 98: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {6137#false} is VALID [2022-02-20 14:04:14,439 INFO L290 TraceCheckUtils]: 99: Hoare triple {6137#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {6137#false} is VALID [2022-02-20 14:04:14,439 INFO L290 TraceCheckUtils]: 100: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {6137#false} is VALID [2022-02-20 14:04:14,439 INFO L290 TraceCheckUtils]: 101: Hoare triple {6137#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {6137#false} is VALID [2022-02-20 14:04:14,440 INFO L290 TraceCheckUtils]: 102: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {6137#false} is VALID [2022-02-20 14:04:14,440 INFO L290 TraceCheckUtils]: 103: Hoare triple {6137#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {6137#false} is VALID [2022-02-20 14:04:14,440 INFO L290 TraceCheckUtils]: 104: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {6137#false} is VALID [2022-02-20 14:04:14,440 INFO L290 TraceCheckUtils]: 105: Hoare triple {6137#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {6137#false} is VALID [2022-02-20 14:04:14,440 INFO L290 TraceCheckUtils]: 106: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {6137#false} is VALID [2022-02-20 14:04:14,440 INFO L290 TraceCheckUtils]: 107: Hoare triple {6137#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {6137#false} is VALID [2022-02-20 14:04:14,441 INFO L290 TraceCheckUtils]: 108: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {6137#false} is VALID [2022-02-20 14:04:14,441 INFO L290 TraceCheckUtils]: 109: Hoare triple {6137#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {6137#false} is VALID [2022-02-20 14:04:14,441 INFO L290 TraceCheckUtils]: 110: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {6137#false} is VALID [2022-02-20 14:04:14,441 INFO L290 TraceCheckUtils]: 111: Hoare triple {6137#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {6137#false} is VALID [2022-02-20 14:04:14,441 INFO L290 TraceCheckUtils]: 112: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {6137#false} is VALID [2022-02-20 14:04:14,441 INFO L290 TraceCheckUtils]: 113: Hoare triple {6137#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {6137#false} is VALID [2022-02-20 14:04:14,441 INFO L290 TraceCheckUtils]: 114: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem8#1 := read~int(main_~#a3~0#1.base, main_~#a3~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem8#1, main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem8#1; {6137#false} is VALID [2022-02-20 14:04:14,442 INFO L290 TraceCheckUtils]: 115: Hoare triple {6137#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {6137#false} is VALID [2022-02-20 14:04:14,442 INFO L290 TraceCheckUtils]: 116: Hoare triple {6137#false} assume !(main_~i~0#1 < 100000); {6137#false} is VALID [2022-02-20 14:04:14,442 INFO L290 TraceCheckUtils]: 117: Hoare triple {6137#false} main_~i~0#1 := 0; {6137#false} is VALID [2022-02-20 14:04:14,442 INFO L290 TraceCheckUtils]: 118: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {6137#false} is VALID [2022-02-20 14:04:14,442 INFO L290 TraceCheckUtils]: 119: Hoare triple {6137#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {6137#false} is VALID [2022-02-20 14:04:14,442 INFO L290 TraceCheckUtils]: 120: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {6137#false} is VALID [2022-02-20 14:04:14,442 INFO L290 TraceCheckUtils]: 121: Hoare triple {6137#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {6137#false} is VALID [2022-02-20 14:04:14,443 INFO L290 TraceCheckUtils]: 122: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {6137#false} is VALID [2022-02-20 14:04:14,443 INFO L290 TraceCheckUtils]: 123: Hoare triple {6137#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {6137#false} is VALID [2022-02-20 14:04:14,443 INFO L290 TraceCheckUtils]: 124: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {6137#false} is VALID [2022-02-20 14:04:14,443 INFO L290 TraceCheckUtils]: 125: Hoare triple {6137#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {6137#false} is VALID [2022-02-20 14:04:14,443 INFO L290 TraceCheckUtils]: 126: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {6137#false} is VALID [2022-02-20 14:04:14,443 INFO L290 TraceCheckUtils]: 127: Hoare triple {6137#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {6137#false} is VALID [2022-02-20 14:04:14,444 INFO L290 TraceCheckUtils]: 128: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {6137#false} is VALID [2022-02-20 14:04:14,444 INFO L290 TraceCheckUtils]: 129: Hoare triple {6137#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {6137#false} is VALID [2022-02-20 14:04:14,444 INFO L290 TraceCheckUtils]: 130: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {6137#false} is VALID [2022-02-20 14:04:14,444 INFO L290 TraceCheckUtils]: 131: Hoare triple {6137#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {6137#false} is VALID [2022-02-20 14:04:14,444 INFO L290 TraceCheckUtils]: 132: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {6137#false} is VALID [2022-02-20 14:04:14,444 INFO L290 TraceCheckUtils]: 133: Hoare triple {6137#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {6137#false} is VALID [2022-02-20 14:04:14,444 INFO L290 TraceCheckUtils]: 134: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {6137#false} is VALID [2022-02-20 14:04:14,445 INFO L290 TraceCheckUtils]: 135: Hoare triple {6137#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {6137#false} is VALID [2022-02-20 14:04:14,445 INFO L290 TraceCheckUtils]: 136: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {6137#false} is VALID [2022-02-20 14:04:14,445 INFO L290 TraceCheckUtils]: 137: Hoare triple {6137#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {6137#false} is VALID [2022-02-20 14:04:14,445 INFO L290 TraceCheckUtils]: 138: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {6137#false} is VALID [2022-02-20 14:04:14,445 INFO L290 TraceCheckUtils]: 139: Hoare triple {6137#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {6137#false} is VALID [2022-02-20 14:04:14,445 INFO L290 TraceCheckUtils]: 140: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {6137#false} is VALID [2022-02-20 14:04:14,445 INFO L290 TraceCheckUtils]: 141: Hoare triple {6137#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {6137#false} is VALID [2022-02-20 14:04:14,446 INFO L290 TraceCheckUtils]: 142: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {6137#false} is VALID [2022-02-20 14:04:14,446 INFO L290 TraceCheckUtils]: 143: Hoare triple {6137#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {6137#false} is VALID [2022-02-20 14:04:14,446 INFO L290 TraceCheckUtils]: 144: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem10#1 := read~int(main_~#a4~0#1.base, main_~#a4~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem10#1, main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem10#1; {6137#false} is VALID [2022-02-20 14:04:14,446 INFO L290 TraceCheckUtils]: 145: Hoare triple {6137#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {6137#false} is VALID [2022-02-20 14:04:14,446 INFO L290 TraceCheckUtils]: 146: Hoare triple {6137#false} assume !(main_~i~0#1 < 100000); {6137#false} is VALID [2022-02-20 14:04:14,446 INFO L290 TraceCheckUtils]: 147: Hoare triple {6137#false} main_~i~0#1 := 0; {6137#false} is VALID [2022-02-20 14:04:14,446 INFO L290 TraceCheckUtils]: 148: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {6137#false} is VALID [2022-02-20 14:04:14,447 INFO L290 TraceCheckUtils]: 149: Hoare triple {6137#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {6137#false} is VALID [2022-02-20 14:04:14,447 INFO L290 TraceCheckUtils]: 150: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {6137#false} is VALID [2022-02-20 14:04:14,447 INFO L290 TraceCheckUtils]: 151: Hoare triple {6137#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {6137#false} is VALID [2022-02-20 14:04:14,447 INFO L290 TraceCheckUtils]: 152: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {6137#false} is VALID [2022-02-20 14:04:14,447 INFO L290 TraceCheckUtils]: 153: Hoare triple {6137#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {6137#false} is VALID [2022-02-20 14:04:14,447 INFO L290 TraceCheckUtils]: 154: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {6137#false} is VALID [2022-02-20 14:04:14,447 INFO L290 TraceCheckUtils]: 155: Hoare triple {6137#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {6137#false} is VALID [2022-02-20 14:04:14,448 INFO L290 TraceCheckUtils]: 156: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {6137#false} is VALID [2022-02-20 14:04:14,448 INFO L290 TraceCheckUtils]: 157: Hoare triple {6137#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {6137#false} is VALID [2022-02-20 14:04:14,448 INFO L290 TraceCheckUtils]: 158: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {6137#false} is VALID [2022-02-20 14:04:14,448 INFO L290 TraceCheckUtils]: 159: Hoare triple {6137#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {6137#false} is VALID [2022-02-20 14:04:14,448 INFO L290 TraceCheckUtils]: 160: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {6137#false} is VALID [2022-02-20 14:04:14,448 INFO L290 TraceCheckUtils]: 161: Hoare triple {6137#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {6137#false} is VALID [2022-02-20 14:04:14,448 INFO L290 TraceCheckUtils]: 162: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {6137#false} is VALID [2022-02-20 14:04:14,449 INFO L290 TraceCheckUtils]: 163: Hoare triple {6137#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {6137#false} is VALID [2022-02-20 14:04:14,449 INFO L290 TraceCheckUtils]: 164: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {6137#false} is VALID [2022-02-20 14:04:14,449 INFO L290 TraceCheckUtils]: 165: Hoare triple {6137#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {6137#false} is VALID [2022-02-20 14:04:14,449 INFO L290 TraceCheckUtils]: 166: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {6137#false} is VALID [2022-02-20 14:04:14,449 INFO L290 TraceCheckUtils]: 167: Hoare triple {6137#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {6137#false} is VALID [2022-02-20 14:04:14,449 INFO L290 TraceCheckUtils]: 168: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {6137#false} is VALID [2022-02-20 14:04:14,449 INFO L290 TraceCheckUtils]: 169: Hoare triple {6137#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {6137#false} is VALID [2022-02-20 14:04:14,450 INFO L290 TraceCheckUtils]: 170: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {6137#false} is VALID [2022-02-20 14:04:14,450 INFO L290 TraceCheckUtils]: 171: Hoare triple {6137#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {6137#false} is VALID [2022-02-20 14:04:14,450 INFO L290 TraceCheckUtils]: 172: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {6137#false} is VALID [2022-02-20 14:04:14,450 INFO L290 TraceCheckUtils]: 173: Hoare triple {6137#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {6137#false} is VALID [2022-02-20 14:04:14,450 INFO L290 TraceCheckUtils]: 174: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem12#1 := read~int(main_~#a5~0#1.base, main_~#a5~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem12#1, main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem12#1; {6137#false} is VALID [2022-02-20 14:04:14,450 INFO L290 TraceCheckUtils]: 175: Hoare triple {6137#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {6137#false} is VALID [2022-02-20 14:04:14,450 INFO L290 TraceCheckUtils]: 176: Hoare triple {6137#false} assume !(main_~i~0#1 < 100000); {6137#false} is VALID [2022-02-20 14:04:14,451 INFO L290 TraceCheckUtils]: 177: Hoare triple {6137#false} main_~i~0#1 := 0; {6137#false} is VALID [2022-02-20 14:04:14,451 INFO L290 TraceCheckUtils]: 178: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {6137#false} is VALID [2022-02-20 14:04:14,451 INFO L290 TraceCheckUtils]: 179: Hoare triple {6137#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {6137#false} is VALID [2022-02-20 14:04:14,451 INFO L290 TraceCheckUtils]: 180: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {6137#false} is VALID [2022-02-20 14:04:14,451 INFO L290 TraceCheckUtils]: 181: Hoare triple {6137#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {6137#false} is VALID [2022-02-20 14:04:14,451 INFO L290 TraceCheckUtils]: 182: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {6137#false} is VALID [2022-02-20 14:04:14,452 INFO L290 TraceCheckUtils]: 183: Hoare triple {6137#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {6137#false} is VALID [2022-02-20 14:04:14,452 INFO L290 TraceCheckUtils]: 184: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {6137#false} is VALID [2022-02-20 14:04:14,452 INFO L290 TraceCheckUtils]: 185: Hoare triple {6137#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {6137#false} is VALID [2022-02-20 14:04:14,452 INFO L290 TraceCheckUtils]: 186: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {6137#false} is VALID [2022-02-20 14:04:14,452 INFO L290 TraceCheckUtils]: 187: Hoare triple {6137#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {6137#false} is VALID [2022-02-20 14:04:14,452 INFO L290 TraceCheckUtils]: 188: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {6137#false} is VALID [2022-02-20 14:04:14,452 INFO L290 TraceCheckUtils]: 189: Hoare triple {6137#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {6137#false} is VALID [2022-02-20 14:04:14,453 INFO L290 TraceCheckUtils]: 190: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {6137#false} is VALID [2022-02-20 14:04:14,453 INFO L290 TraceCheckUtils]: 191: Hoare triple {6137#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {6137#false} is VALID [2022-02-20 14:04:14,453 INFO L290 TraceCheckUtils]: 192: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {6137#false} is VALID [2022-02-20 14:04:14,453 INFO L290 TraceCheckUtils]: 193: Hoare triple {6137#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {6137#false} is VALID [2022-02-20 14:04:14,453 INFO L290 TraceCheckUtils]: 194: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {6137#false} is VALID [2022-02-20 14:04:14,453 INFO L290 TraceCheckUtils]: 195: Hoare triple {6137#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {6137#false} is VALID [2022-02-20 14:04:14,453 INFO L290 TraceCheckUtils]: 196: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {6137#false} is VALID [2022-02-20 14:04:14,454 INFO L290 TraceCheckUtils]: 197: Hoare triple {6137#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {6137#false} is VALID [2022-02-20 14:04:14,454 INFO L290 TraceCheckUtils]: 198: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {6137#false} is VALID [2022-02-20 14:04:14,454 INFO L290 TraceCheckUtils]: 199: Hoare triple {6137#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {6137#false} is VALID [2022-02-20 14:04:14,454 INFO L290 TraceCheckUtils]: 200: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {6137#false} is VALID [2022-02-20 14:04:14,454 INFO L290 TraceCheckUtils]: 201: Hoare triple {6137#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {6137#false} is VALID [2022-02-20 14:04:14,454 INFO L290 TraceCheckUtils]: 202: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {6137#false} is VALID [2022-02-20 14:04:14,454 INFO L290 TraceCheckUtils]: 203: Hoare triple {6137#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {6137#false} is VALID [2022-02-20 14:04:14,455 INFO L290 TraceCheckUtils]: 204: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem14#1 := read~int(main_~#a6~0#1.base, main_~#a6~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem14#1, main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem14#1; {6137#false} is VALID [2022-02-20 14:04:14,455 INFO L290 TraceCheckUtils]: 205: Hoare triple {6137#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {6137#false} is VALID [2022-02-20 14:04:14,455 INFO L290 TraceCheckUtils]: 206: Hoare triple {6137#false} assume !(main_~i~0#1 < 100000); {6137#false} is VALID [2022-02-20 14:04:14,455 INFO L290 TraceCheckUtils]: 207: Hoare triple {6137#false} main_~i~0#1 := 0; {6137#false} is VALID [2022-02-20 14:04:14,455 INFO L290 TraceCheckUtils]: 208: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {6137#false} is VALID [2022-02-20 14:04:14,455 INFO L290 TraceCheckUtils]: 209: Hoare triple {6137#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {6137#false} is VALID [2022-02-20 14:04:14,455 INFO L290 TraceCheckUtils]: 210: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {6137#false} is VALID [2022-02-20 14:04:14,456 INFO L290 TraceCheckUtils]: 211: Hoare triple {6137#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {6137#false} is VALID [2022-02-20 14:04:14,456 INFO L290 TraceCheckUtils]: 212: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {6137#false} is VALID [2022-02-20 14:04:14,456 INFO L290 TraceCheckUtils]: 213: Hoare triple {6137#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {6137#false} is VALID [2022-02-20 14:04:14,456 INFO L290 TraceCheckUtils]: 214: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {6137#false} is VALID [2022-02-20 14:04:14,456 INFO L290 TraceCheckUtils]: 215: Hoare triple {6137#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {6137#false} is VALID [2022-02-20 14:04:14,456 INFO L290 TraceCheckUtils]: 216: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {6137#false} is VALID [2022-02-20 14:04:14,456 INFO L290 TraceCheckUtils]: 217: Hoare triple {6137#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {6137#false} is VALID [2022-02-20 14:04:14,457 INFO L290 TraceCheckUtils]: 218: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {6137#false} is VALID [2022-02-20 14:04:14,457 INFO L290 TraceCheckUtils]: 219: Hoare triple {6137#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {6137#false} is VALID [2022-02-20 14:04:14,457 INFO L290 TraceCheckUtils]: 220: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {6137#false} is VALID [2022-02-20 14:04:14,457 INFO L290 TraceCheckUtils]: 221: Hoare triple {6137#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {6137#false} is VALID [2022-02-20 14:04:14,457 INFO L290 TraceCheckUtils]: 222: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {6137#false} is VALID [2022-02-20 14:04:14,457 INFO L290 TraceCheckUtils]: 223: Hoare triple {6137#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {6137#false} is VALID [2022-02-20 14:04:14,458 INFO L290 TraceCheckUtils]: 224: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {6137#false} is VALID [2022-02-20 14:04:14,458 INFO L290 TraceCheckUtils]: 225: Hoare triple {6137#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {6137#false} is VALID [2022-02-20 14:04:14,458 INFO L290 TraceCheckUtils]: 226: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {6137#false} is VALID [2022-02-20 14:04:14,458 INFO L290 TraceCheckUtils]: 227: Hoare triple {6137#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {6137#false} is VALID [2022-02-20 14:04:14,458 INFO L290 TraceCheckUtils]: 228: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {6137#false} is VALID [2022-02-20 14:04:14,458 INFO L290 TraceCheckUtils]: 229: Hoare triple {6137#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {6137#false} is VALID [2022-02-20 14:04:14,458 INFO L290 TraceCheckUtils]: 230: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {6137#false} is VALID [2022-02-20 14:04:14,459 INFO L290 TraceCheckUtils]: 231: Hoare triple {6137#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {6137#false} is VALID [2022-02-20 14:04:14,459 INFO L290 TraceCheckUtils]: 232: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {6137#false} is VALID [2022-02-20 14:04:14,459 INFO L290 TraceCheckUtils]: 233: Hoare triple {6137#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {6137#false} is VALID [2022-02-20 14:04:14,459 INFO L290 TraceCheckUtils]: 234: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem16#1 := read~int(main_~#a7~0#1.base, main_~#a7~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem16#1, main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem16#1; {6137#false} is VALID [2022-02-20 14:04:14,459 INFO L290 TraceCheckUtils]: 235: Hoare triple {6137#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {6137#false} is VALID [2022-02-20 14:04:14,459 INFO L290 TraceCheckUtils]: 236: Hoare triple {6137#false} assume !(main_~i~0#1 < 100000); {6137#false} is VALID [2022-02-20 14:04:14,459 INFO L290 TraceCheckUtils]: 237: Hoare triple {6137#false} main_~i~0#1 := 0; {6137#false} is VALID [2022-02-20 14:04:14,460 INFO L290 TraceCheckUtils]: 238: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem18#1, main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem18#1; {6137#false} is VALID [2022-02-20 14:04:14,460 INFO L290 TraceCheckUtils]: 239: Hoare triple {6137#false} main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {6137#false} is VALID [2022-02-20 14:04:14,460 INFO L290 TraceCheckUtils]: 240: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem18#1, main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem18#1; {6137#false} is VALID [2022-02-20 14:04:14,460 INFO L290 TraceCheckUtils]: 241: Hoare triple {6137#false} main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {6137#false} is VALID [2022-02-20 14:04:14,460 INFO L290 TraceCheckUtils]: 242: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem18#1, main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem18#1; {6137#false} is VALID [2022-02-20 14:04:14,460 INFO L290 TraceCheckUtils]: 243: Hoare triple {6137#false} main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {6137#false} is VALID [2022-02-20 14:04:14,461 INFO L290 TraceCheckUtils]: 244: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem18#1, main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem18#1; {6137#false} is VALID [2022-02-20 14:04:14,461 INFO L290 TraceCheckUtils]: 245: Hoare triple {6137#false} main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {6137#false} is VALID [2022-02-20 14:04:14,461 INFO L290 TraceCheckUtils]: 246: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem18#1, main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem18#1; {6137#false} is VALID [2022-02-20 14:04:14,461 INFO L290 TraceCheckUtils]: 247: Hoare triple {6137#false} main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {6137#false} is VALID [2022-02-20 14:04:14,461 INFO L290 TraceCheckUtils]: 248: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem18#1, main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem18#1; {6137#false} is VALID [2022-02-20 14:04:14,461 INFO L290 TraceCheckUtils]: 249: Hoare triple {6137#false} main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {6137#false} is VALID [2022-02-20 14:04:14,461 INFO L290 TraceCheckUtils]: 250: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem18#1, main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem18#1; {6137#false} is VALID [2022-02-20 14:04:14,462 INFO L290 TraceCheckUtils]: 251: Hoare triple {6137#false} main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {6137#false} is VALID [2022-02-20 14:04:14,462 INFO L290 TraceCheckUtils]: 252: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem18#1, main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem18#1; {6137#false} is VALID [2022-02-20 14:04:14,462 INFO L290 TraceCheckUtils]: 253: Hoare triple {6137#false} main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {6137#false} is VALID [2022-02-20 14:04:14,462 INFO L290 TraceCheckUtils]: 254: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem18#1, main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem18#1; {6137#false} is VALID [2022-02-20 14:04:14,462 INFO L290 TraceCheckUtils]: 255: Hoare triple {6137#false} main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {6137#false} is VALID [2022-02-20 14:04:14,462 INFO L290 TraceCheckUtils]: 256: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem18#1, main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem18#1; {6137#false} is VALID [2022-02-20 14:04:14,463 INFO L290 TraceCheckUtils]: 257: Hoare triple {6137#false} main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {6137#false} is VALID [2022-02-20 14:04:14,463 INFO L290 TraceCheckUtils]: 258: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem18#1, main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem18#1; {6137#false} is VALID [2022-02-20 14:04:14,463 INFO L290 TraceCheckUtils]: 259: Hoare triple {6137#false} main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {6137#false} is VALID [2022-02-20 14:04:14,463 INFO L290 TraceCheckUtils]: 260: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem18#1, main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem18#1; {6137#false} is VALID [2022-02-20 14:04:14,463 INFO L290 TraceCheckUtils]: 261: Hoare triple {6137#false} main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {6137#false} is VALID [2022-02-20 14:04:14,463 INFO L290 TraceCheckUtils]: 262: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem18#1, main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem18#1; {6137#false} is VALID [2022-02-20 14:04:14,463 INFO L290 TraceCheckUtils]: 263: Hoare triple {6137#false} main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {6137#false} is VALID [2022-02-20 14:04:14,463 INFO L290 TraceCheckUtils]: 264: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem18#1 := read~int(main_~#a8~0#1.base, main_~#a8~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem18#1, main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem18#1; {6137#false} is VALID [2022-02-20 14:04:14,464 INFO L290 TraceCheckUtils]: 265: Hoare triple {6137#false} main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {6137#false} is VALID [2022-02-20 14:04:14,464 INFO L290 TraceCheckUtils]: 266: Hoare triple {6137#false} assume !(main_~i~0#1 < 100000); {6137#false} is VALID [2022-02-20 14:04:14,464 INFO L290 TraceCheckUtils]: 267: Hoare triple {6137#false} main_~i~0#1 := 0; {6137#false} is VALID [2022-02-20 14:04:14,464 INFO L290 TraceCheckUtils]: 268: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem20#1 := read~int(main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem20#1, main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem20#1; {6137#false} is VALID [2022-02-20 14:04:14,464 INFO L290 TraceCheckUtils]: 269: Hoare triple {6137#false} main_#t~post19#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; {6137#false} is VALID [2022-02-20 14:04:14,464 INFO L290 TraceCheckUtils]: 270: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem20#1 := read~int(main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem20#1, main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem20#1; {6137#false} is VALID [2022-02-20 14:04:14,465 INFO L290 TraceCheckUtils]: 271: Hoare triple {6137#false} main_#t~post19#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; {6137#false} is VALID [2022-02-20 14:04:14,465 INFO L290 TraceCheckUtils]: 272: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem20#1 := read~int(main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem20#1, main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem20#1; {6137#false} is VALID [2022-02-20 14:04:14,465 INFO L290 TraceCheckUtils]: 273: Hoare triple {6137#false} main_#t~post19#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; {6137#false} is VALID [2022-02-20 14:04:14,465 INFO L290 TraceCheckUtils]: 274: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem20#1 := read~int(main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem20#1, main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem20#1; {6137#false} is VALID [2022-02-20 14:04:14,465 INFO L290 TraceCheckUtils]: 275: Hoare triple {6137#false} main_#t~post19#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; {6137#false} is VALID [2022-02-20 14:04:14,465 INFO L290 TraceCheckUtils]: 276: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem20#1 := read~int(main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem20#1, main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem20#1; {6137#false} is VALID [2022-02-20 14:04:14,465 INFO L290 TraceCheckUtils]: 277: Hoare triple {6137#false} main_#t~post19#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; {6137#false} is VALID [2022-02-20 14:04:14,466 INFO L290 TraceCheckUtils]: 278: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem20#1 := read~int(main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem20#1, main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem20#1; {6137#false} is VALID [2022-02-20 14:04:14,466 INFO L290 TraceCheckUtils]: 279: Hoare triple {6137#false} main_#t~post19#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; {6137#false} is VALID [2022-02-20 14:04:14,466 INFO L290 TraceCheckUtils]: 280: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem20#1 := read~int(main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem20#1, main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem20#1; {6137#false} is VALID [2022-02-20 14:04:14,466 INFO L290 TraceCheckUtils]: 281: Hoare triple {6137#false} main_#t~post19#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; {6137#false} is VALID [2022-02-20 14:04:14,466 INFO L290 TraceCheckUtils]: 282: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem20#1 := read~int(main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem20#1, main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem20#1; {6137#false} is VALID [2022-02-20 14:04:14,466 INFO L290 TraceCheckUtils]: 283: Hoare triple {6137#false} main_#t~post19#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; {6137#false} is VALID [2022-02-20 14:04:14,466 INFO L290 TraceCheckUtils]: 284: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem20#1 := read~int(main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem20#1, main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem20#1; {6137#false} is VALID [2022-02-20 14:04:14,467 INFO L290 TraceCheckUtils]: 285: Hoare triple {6137#false} main_#t~post19#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; {6137#false} is VALID [2022-02-20 14:04:14,467 INFO L290 TraceCheckUtils]: 286: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem20#1 := read~int(main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem20#1, main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem20#1; {6137#false} is VALID [2022-02-20 14:04:14,467 INFO L290 TraceCheckUtils]: 287: Hoare triple {6137#false} main_#t~post19#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; {6137#false} is VALID [2022-02-20 14:04:14,467 INFO L290 TraceCheckUtils]: 288: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem20#1 := read~int(main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem20#1, main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem20#1; {6137#false} is VALID [2022-02-20 14:04:14,467 INFO L290 TraceCheckUtils]: 289: Hoare triple {6137#false} main_#t~post19#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; {6137#false} is VALID [2022-02-20 14:04:14,467 INFO L290 TraceCheckUtils]: 290: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem20#1 := read~int(main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem20#1, main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem20#1; {6137#false} is VALID [2022-02-20 14:04:14,468 INFO L290 TraceCheckUtils]: 291: Hoare triple {6137#false} main_#t~post19#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; {6137#false} is VALID [2022-02-20 14:04:14,468 INFO L290 TraceCheckUtils]: 292: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem20#1 := read~int(main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem20#1, main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem20#1; {6137#false} is VALID [2022-02-20 14:04:14,468 INFO L290 TraceCheckUtils]: 293: Hoare triple {6137#false} main_#t~post19#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; {6137#false} is VALID [2022-02-20 14:04:14,468 INFO L290 TraceCheckUtils]: 294: Hoare triple {6137#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem20#1 := read~int(main_~#a9~0#1.base, main_~#a9~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem20#1, main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem20#1; {6137#false} is VALID [2022-02-20 14:04:14,468 INFO L290 TraceCheckUtils]: 295: Hoare triple {6137#false} main_#t~post19#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; {6137#false} is VALID [2022-02-20 14:04:14,468 INFO L290 TraceCheckUtils]: 296: Hoare triple {6137#false} assume !(main_~i~0#1 < 100000); {6137#false} is VALID [2022-02-20 14:04:14,468 INFO L290 TraceCheckUtils]: 297: Hoare triple {6137#false} havoc main_~x~0#1;main_~x~0#1 := 0; {6137#false} is VALID [2022-02-20 14:04:14,469 INFO L290 TraceCheckUtils]: 298: Hoare triple {6137#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem22#1 := read~int(main_~#a1~0#1.base, main_~#a1~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem23#1 := read~int(main_~#a0~0#1.base, main_~#a0~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem22#1 == main_#t~mem23#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {6137#false} is VALID [2022-02-20 14:04:14,469 INFO L290 TraceCheckUtils]: 299: Hoare triple {6137#false} assume 0 == __VERIFIER_assert_~cond#1; {6137#false} is VALID [2022-02-20 14:04:14,469 INFO L290 TraceCheckUtils]: 300: Hoare triple {6137#false} assume !false; {6137#false} is VALID [2022-02-20 14:04:14,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1908 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2022-02-20 14:04:14,470 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:04:14,470 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574669608] [2022-02-20 14:04:14,470 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574669608] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:04:14,471 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568783308] [2022-02-20 14:04:14,471 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-20 14:04:14,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:04:14,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:04:14,475 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:04:14,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process