./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-examples/standard_copyInitSum_ground.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_copyInitSum_ground.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 19809800fbb837760f7dcf4b8a93f7732bb250505f3f751815caa258bac4c35a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:04:11,957 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:04:11,960 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:04:12,010 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:04:12,011 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:04:12,015 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:04:12,017 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:04:12,020 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:04:12,022 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:04:12,026 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:04:12,027 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:04:12,029 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:04:12,029 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:04:12,032 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:04:12,033 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:04:12,038 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:04:12,039 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:04:12,039 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:04:12,042 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:04:12,050 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:04:12,052 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:04:12,053 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:04:12,055 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:04:12,056 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:04:12,062 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:04:12,062 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:04:12,063 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:04:12,065 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:04:12,065 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:04:12,066 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:04:12,066 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:04:12,067 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:04:12,069 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:04:12,070 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:04:12,071 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:04:12,072 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:04:12,072 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:04:12,072 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:04:12,073 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:04:12,073 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:04:12,074 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:04:12,075 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:12,109 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:04:12,109 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:04:12,110 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:04:12,110 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:04:12,111 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:04:12,111 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:04:12,112 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:04:12,112 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:04:12,112 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:04:12,112 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:04:12,113 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:04:12,113 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:04:12,114 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:04:12,114 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:04:12,114 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:04:12,114 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:04:12,114 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:04:12,114 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:04:12,115 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:04:12,115 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:04:12,115 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:04:12,115 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:04:12,115 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:04:12,116 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:04:12,116 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:04:12,116 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:04:12,116 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:04:12,118 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:04:12,118 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:04:12,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:04:12,118 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:04:12,118 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:04:12,119 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:04:12,119 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 -> 19809800fbb837760f7dcf4b8a93f7732bb250505f3f751815caa258bac4c35a [2022-02-20 14:04:12,368 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:04:12,395 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:04:12,397 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:04:12,397 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:04:12,401 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:04:12,402 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/standard_copyInitSum_ground.i [2022-02-20 14:04:12,463 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e70807ee3/44030460ea394fa585e84f371e29c01f/FLAGfd94db44c [2022-02-20 14:04:12,860 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:04:12,861 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/standard_copyInitSum_ground.i [2022-02-20 14:04:12,865 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e70807ee3/44030460ea394fa585e84f371e29c01f/FLAGfd94db44c [2022-02-20 14:04:13,237 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e70807ee3/44030460ea394fa585e84f371e29c01f [2022-02-20 14:04:13,239 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:04:13,240 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:04:13,241 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:04:13,241 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:04:13,259 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:04:13,260 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:04:13" (1/1) ... [2022-02-20 14:04:13,262 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53b470df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:04:13, skipping insertion in model container [2022-02-20 14:04:13,262 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:04:13" (1/1) ... [2022-02-20 14:04:13,269 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:04:13,280 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:04:13,463 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_copyInitSum_ground.i[860,873] [2022-02-20 14:04:13,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:04:13,507 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:04:13,519 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_copyInitSum_ground.i[860,873] [2022-02-20 14:04:13,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:04:13,559 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:04:13,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:04:13 WrapperNode [2022-02-20 14:04:13,576 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:04:13,577 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:04:13,577 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:04:13,577 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:04:13,582 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:13" (1/1) ... [2022-02-20 14:04:13,588 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:13" (1/1) ... [2022-02-20 14:04:13,627 INFO L137 Inliner]: procedures = 16, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 70 [2022-02-20 14:04:13,627 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:04:13,628 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:04:13,628 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:04:13,628 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:04:13,649 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:13" (1/1) ... [2022-02-20 14:04:13,650 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:13" (1/1) ... [2022-02-20 14:04:13,651 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:13" (1/1) ... [2022-02-20 14:04:13,651 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:13" (1/1) ... [2022-02-20 14:04:13,654 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:13" (1/1) ... [2022-02-20 14:04:13,665 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:13" (1/1) ... [2022-02-20 14:04:13,667 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:13" (1/1) ... [2022-02-20 14:04:13,671 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:04:13,674 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:04:13,683 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:04:13,683 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:04:13,684 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:04:13" (1/1) ... [2022-02-20 14:04:13,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:04:13,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:04:13,707 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:13,727 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:13,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:04:13,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:04:13,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:04:13,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:04:13,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:04:13,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:04:13,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:04:13,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:04:13,793 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:04:13,795 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:04:13,915 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:04:13,918 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:04:13,919 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-20 14:04:13,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:04:13 BoogieIcfgContainer [2022-02-20 14:04:13,937 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:04:13,938 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:04:13,938 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:04:13,941 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:04:13,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:04:13" (1/3) ... [2022-02-20 14:04:13,942 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f3b788a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:04:13, skipping insertion in model container [2022-02-20 14:04:13,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:04:13" (2/3) ... [2022-02-20 14:04:13,942 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f3b788a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:04:13, skipping insertion in model container [2022-02-20 14:04:13,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:04:13" (3/3) ... [2022-02-20 14:04:13,943 INFO L111 eAbstractionObserver]: Analyzing ICFG standard_copyInitSum_ground.i [2022-02-20 14:04:13,946 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:04:13,947 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:04:13,986 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:04:14,004 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:14,004 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:04:14,027 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 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:14,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 14:04:14,030 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:04:14,031 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:04:14,031 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:04:14,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:04:14,036 INFO L85 PathProgramCache]: Analyzing trace with hash -952172836, now seen corresponding path program 1 times [2022-02-20 14:04:14,043 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:04:14,045 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057760833] [2022-02-20 14:04:14,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:04:14,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:04:14,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:04:14,221 INFO L290 TraceCheckUtils]: 0: Hoare triple {23#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(30, 2); {23#true} is VALID [2022-02-20 14:04:14,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~incr~0#1, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~incr~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {25#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:04:14,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~i~0#1 < 100000); {24#false} is VALID [2022-02-20 14:04:14,225 INFO L290 TraceCheckUtils]: 3: Hoare triple {24#false} main_~i~0#1 := 0; {24#false} is VALID [2022-02-20 14:04:14,226 INFO L290 TraceCheckUtils]: 4: Hoare triple {24#false} assume !(main_~i~0#1 < 100000); {24#false} is VALID [2022-02-20 14:04:14,226 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#false} main_~i~0#1 := 0; {24#false} is VALID [2022-02-20 14:04:14,226 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#false} assume !(main_~i~0#1 < 100000); {24#false} is VALID [2022-02-20 14:04:14,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {24#false} havoc main_~x~0#1;main_~x~0#1 := 0; {24#false} is VALID [2022-02-20 14:04:14,226 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 == 42 + main_~incr~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {24#false} is VALID [2022-02-20 14:04:14,227 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} assume 0 == __VERIFIER_assert_~cond#1; {24#false} is VALID [2022-02-20 14:04:14,227 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-02-20 14:04:14,228 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:14,228 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:04:14,229 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057760833] [2022-02-20 14:04:14,229 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057760833] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:04:14,229 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:04:14,229 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:04:14,231 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262430725] [2022-02-20 14:04:14,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:04:14,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 14:04:14,235 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:04:14,238 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:14,260 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:04:14,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:04:14,261 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:04:14,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:04:14,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:04:14,285 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 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 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:14,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:14,359 INFO L93 Difference]: Finished difference Result 42 states and 62 transitions. [2022-02-20 14:04:14,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:04:14,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 14:04:14,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:04:14,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:14,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-02-20 14:04:14,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:14,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-02-20 14:04:14,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 62 transitions. [2022-02-20 14:04:14,424 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:04:14,430 INFO L225 Difference]: With dead ends: 42 [2022-02-20 14:04:14,430 INFO L226 Difference]: Without dead ends: 21 [2022-02-20 14:04:14,432 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:14,434 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:04:14,435 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 30 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:04:14,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-02-20 14:04:14,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2022-02-20 14:04:14,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:04:14,453 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:14,453 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:14,454 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:14,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:14,456 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-02-20 14:04:14,456 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-02-20 14:04:14,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:04:14,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:04:14,457 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 21 states. [2022-02-20 14:04:14,457 INFO L87 Difference]: Start difference. First operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 21 states. [2022-02-20 14:04:14,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:14,460 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-02-20 14:04:14,460 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-02-20 14:04:14,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:04:14,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:04:14,460 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:04:14,461 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:04:14,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:14,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-02-20 14:04:14,463 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 11 [2022-02-20 14:04:14,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:04:14,464 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-02-20 14:04:14,464 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:14,464 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-02-20 14:04:14,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 14:04:14,465 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:04:14,465 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:04:14,465 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:04:14,466 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:04:14,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:04:14,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1567052653, now seen corresponding path program 1 times [2022-02-20 14:04:14,467 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:04:14,467 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532707202] [2022-02-20 14:04:14,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:04:14,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:04:14,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:04:14,510 INFO L290 TraceCheckUtils]: 0: Hoare triple {150#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(30, 2); {150#true} is VALID [2022-02-20 14:04:14,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {150#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~incr~0#1, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~incr~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {152#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:04:14,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {152#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {153#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:04:14,512 INFO L290 TraceCheckUtils]: 3: Hoare triple {153#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 100000); {151#false} is VALID [2022-02-20 14:04:14,512 INFO L290 TraceCheckUtils]: 4: Hoare triple {151#false} main_~i~0#1 := 0; {151#false} is VALID [2022-02-20 14:04:14,512 INFO L290 TraceCheckUtils]: 5: Hoare triple {151#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {151#false} is VALID [2022-02-20 14:04:14,512 INFO L290 TraceCheckUtils]: 6: Hoare triple {151#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {151#false} is VALID [2022-02-20 14:04:14,513 INFO L290 TraceCheckUtils]: 7: Hoare triple {151#false} assume !(main_~i~0#1 < 100000); {151#false} is VALID [2022-02-20 14:04:14,513 INFO L290 TraceCheckUtils]: 8: Hoare triple {151#false} main_~i~0#1 := 0; {151#false} is VALID [2022-02-20 14:04:14,513 INFO L290 TraceCheckUtils]: 9: Hoare triple {151#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {151#false} is VALID [2022-02-20 14:04:14,513 INFO L290 TraceCheckUtils]: 10: Hoare triple {151#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {151#false} is VALID [2022-02-20 14:04:14,513 INFO L290 TraceCheckUtils]: 11: Hoare triple {151#false} assume !(main_~i~0#1 < 100000); {151#false} is VALID [2022-02-20 14:04:14,514 INFO L290 TraceCheckUtils]: 12: Hoare triple {151#false} havoc main_~x~0#1;main_~x~0#1 := 0; {151#false} is VALID [2022-02-20 14:04:14,514 INFO L290 TraceCheckUtils]: 13: Hoare triple {151#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 == 42 + main_~incr~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {151#false} is VALID [2022-02-20 14:04:14,514 INFO L290 TraceCheckUtils]: 14: Hoare triple {151#false} assume 0 == __VERIFIER_assert_~cond#1; {151#false} is VALID [2022-02-20 14:04:14,514 INFO L290 TraceCheckUtils]: 15: Hoare triple {151#false} assume !false; {151#false} is VALID [2022-02-20 14:04:14,515 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 14:04:14,515 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:04:14,515 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532707202] [2022-02-20 14:04:14,515 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532707202] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:04:14,516 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580372652] [2022-02-20 14:04:14,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:04:14,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:04:14,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:04:14,518 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:14,519 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:14,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:04:14,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 14:04:14,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:04:14,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:04:14,675 INFO L290 TraceCheckUtils]: 0: Hoare triple {150#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(30, 2); {150#true} is VALID [2022-02-20 14:04:14,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {150#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~incr~0#1, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~incr~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {160#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:04:14,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {160#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {153#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:04:14,678 INFO L290 TraceCheckUtils]: 3: Hoare triple {153#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 100000); {151#false} is VALID [2022-02-20 14:04:14,678 INFO L290 TraceCheckUtils]: 4: Hoare triple {151#false} main_~i~0#1 := 0; {151#false} is VALID [2022-02-20 14:04:14,678 INFO L290 TraceCheckUtils]: 5: Hoare triple {151#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {151#false} is VALID [2022-02-20 14:04:14,678 INFO L290 TraceCheckUtils]: 6: Hoare triple {151#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {151#false} is VALID [2022-02-20 14:04:14,679 INFO L290 TraceCheckUtils]: 7: Hoare triple {151#false} assume !(main_~i~0#1 < 100000); {151#false} is VALID [2022-02-20 14:04:14,679 INFO L290 TraceCheckUtils]: 8: Hoare triple {151#false} main_~i~0#1 := 0; {151#false} is VALID [2022-02-20 14:04:14,679 INFO L290 TraceCheckUtils]: 9: Hoare triple {151#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {151#false} is VALID [2022-02-20 14:04:14,679 INFO L290 TraceCheckUtils]: 10: Hoare triple {151#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {151#false} is VALID [2022-02-20 14:04:14,680 INFO L290 TraceCheckUtils]: 11: Hoare triple {151#false} assume !(main_~i~0#1 < 100000); {151#false} is VALID [2022-02-20 14:04:14,680 INFO L290 TraceCheckUtils]: 12: Hoare triple {151#false} havoc main_~x~0#1;main_~x~0#1 := 0; {151#false} is VALID [2022-02-20 14:04:14,680 INFO L290 TraceCheckUtils]: 13: Hoare triple {151#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 == 42 + main_~incr~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {151#false} is VALID [2022-02-20 14:04:14,680 INFO L290 TraceCheckUtils]: 14: Hoare triple {151#false} assume 0 == __VERIFIER_assert_~cond#1; {151#false} is VALID [2022-02-20 14:04:14,680 INFO L290 TraceCheckUtils]: 15: Hoare triple {151#false} assume !false; {151#false} is VALID [2022-02-20 14:04:14,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 14:04:14,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:04:14,788 INFO L290 TraceCheckUtils]: 15: Hoare triple {151#false} assume !false; {151#false} is VALID [2022-02-20 14:04:14,789 INFO L290 TraceCheckUtils]: 14: Hoare triple {151#false} assume 0 == __VERIFIER_assert_~cond#1; {151#false} is VALID [2022-02-20 14:04:14,789 INFO L290 TraceCheckUtils]: 13: Hoare triple {151#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 == 42 + main_~incr~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {151#false} is VALID [2022-02-20 14:04:14,789 INFO L290 TraceCheckUtils]: 12: Hoare triple {151#false} havoc main_~x~0#1;main_~x~0#1 := 0; {151#false} is VALID [2022-02-20 14:04:14,790 INFO L290 TraceCheckUtils]: 11: Hoare triple {151#false} assume !(main_~i~0#1 < 100000); {151#false} is VALID [2022-02-20 14:04:14,790 INFO L290 TraceCheckUtils]: 10: Hoare triple {151#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {151#false} is VALID [2022-02-20 14:04:14,791 INFO L290 TraceCheckUtils]: 9: Hoare triple {151#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {151#false} is VALID [2022-02-20 14:04:14,791 INFO L290 TraceCheckUtils]: 8: Hoare triple {151#false} main_~i~0#1 := 0; {151#false} is VALID [2022-02-20 14:04:14,795 INFO L290 TraceCheckUtils]: 7: Hoare triple {151#false} assume !(main_~i~0#1 < 100000); {151#false} is VALID [2022-02-20 14:04:14,796 INFO L290 TraceCheckUtils]: 6: Hoare triple {151#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {151#false} is VALID [2022-02-20 14:04:14,796 INFO L290 TraceCheckUtils]: 5: Hoare triple {151#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {151#false} is VALID [2022-02-20 14:04:14,797 INFO L290 TraceCheckUtils]: 4: Hoare triple {151#false} main_~i~0#1 := 0; {151#false} is VALID [2022-02-20 14:04:14,798 INFO L290 TraceCheckUtils]: 3: Hoare triple {239#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {151#false} is VALID [2022-02-20 14:04:14,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {243#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {239#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:04:14,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {150#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~incr~0#1, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~incr~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {243#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:04:14,812 INFO L290 TraceCheckUtils]: 0: Hoare triple {150#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(30, 2); {150#true} is VALID [2022-02-20 14:04:14,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 14:04:14,813 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580372652] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:04:14,813 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:04:14,813 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-02-20 14:04:14,814 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459435949] [2022-02-20 14:04:14,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:04:14,815 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 14:04:14,816 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:04:14,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:14,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:04:14,850 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 14:04:14,850 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:04:14,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 14:04:14,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:04:14,851 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:14,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:14,973 INFO L93 Difference]: Finished difference Result 49 states and 63 transitions. [2022-02-20 14:04:14,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 14:04:14,973 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 14:04:14,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:04:14,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:14,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2022-02-20 14:04:14,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:14,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2022-02-20 14:04:14,987 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 61 transitions. [2022-02-20 14:04:15,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:04:15,032 INFO L225 Difference]: With dead ends: 49 [2022-02-20 14:04:15,032 INFO L226 Difference]: Without dead ends: 34 [2022-02-20 14:04:15,033 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 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:15,034 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:04:15,034 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 38 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:04:15,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-02-20 14:04:15,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-02-20 14:04:15,051 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:04:15,051 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 0 states have call successors, (0), 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:15,052 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 0 states have call successors, (0), 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:15,052 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 0 states have call successors, (0), 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:15,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:15,053 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-02-20 14:04:15,053 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-02-20 14:04:15,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:04:15,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:04:15,054 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 0 states have call successors, (0), 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 34 states. [2022-02-20 14:04:15,054 INFO L87 Difference]: Start difference. First operand has 34 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 0 states have call successors, (0), 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 34 states. [2022-02-20 14:04:15,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:15,056 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-02-20 14:04:15,056 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-02-20 14:04:15,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:04:15,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:04:15,067 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:04:15,067 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:04:15,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 0 states have call successors, (0), 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:15,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-02-20 14:04:15,069 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 16 [2022-02-20 14:04:15,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:04:15,069 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-02-20 14:04:15,069 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:04:15,070 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-02-20 14:04:15,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 14:04:15,070 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:04:15,070 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:04:15,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 14:04:15,271 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:15,271 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:04:15,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:04:15,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1609282676, now seen corresponding path program 2 times [2022-02-20 14:04:15,272 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:04:15,272 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149260674] [2022-02-20 14:04:15,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:04:15,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:04:15,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:04:15,443 INFO L290 TraceCheckUtils]: 0: Hoare triple {437#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(30, 2); {437#true} is VALID [2022-02-20 14:04:15,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {437#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~incr~0#1, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~incr~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {439#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:04:15,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {439#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {440#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:04:15,446 INFO L290 TraceCheckUtils]: 3: Hoare triple {440#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {441#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:04:15,447 INFO L290 TraceCheckUtils]: 4: Hoare triple {441#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {442#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:04:15,447 INFO L290 TraceCheckUtils]: 5: Hoare triple {442#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {443#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:04:15,448 INFO L290 TraceCheckUtils]: 6: Hoare triple {443#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(main_~i~0#1 < 100000); {438#false} is VALID [2022-02-20 14:04:15,449 INFO L290 TraceCheckUtils]: 7: Hoare triple {438#false} main_~i~0#1 := 0; {438#false} is VALID [2022-02-20 14:04:15,449 INFO L290 TraceCheckUtils]: 8: Hoare triple {438#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {438#false} is VALID [2022-02-20 14:04:15,449 INFO L290 TraceCheckUtils]: 9: Hoare triple {438#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {438#false} is VALID [2022-02-20 14:04:15,449 INFO L290 TraceCheckUtils]: 10: Hoare triple {438#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {438#false} is VALID [2022-02-20 14:04:15,449 INFO L290 TraceCheckUtils]: 11: Hoare triple {438#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {438#false} is VALID [2022-02-20 14:04:15,450 INFO L290 TraceCheckUtils]: 12: Hoare triple {438#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {438#false} is VALID [2022-02-20 14:04:15,450 INFO L290 TraceCheckUtils]: 13: Hoare triple {438#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {438#false} is VALID [2022-02-20 14:04:15,450 INFO L290 TraceCheckUtils]: 14: Hoare triple {438#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {438#false} is VALID [2022-02-20 14:04:15,450 INFO L290 TraceCheckUtils]: 15: Hoare triple {438#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {438#false} is VALID [2022-02-20 14:04:15,450 INFO L290 TraceCheckUtils]: 16: Hoare triple {438#false} assume !(main_~i~0#1 < 100000); {438#false} is VALID [2022-02-20 14:04:15,450 INFO L290 TraceCheckUtils]: 17: Hoare triple {438#false} main_~i~0#1 := 0; {438#false} is VALID [2022-02-20 14:04:15,451 INFO L290 TraceCheckUtils]: 18: Hoare triple {438#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {438#false} is VALID [2022-02-20 14:04:15,451 INFO L290 TraceCheckUtils]: 19: Hoare triple {438#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {438#false} is VALID [2022-02-20 14:04:15,451 INFO L290 TraceCheckUtils]: 20: Hoare triple {438#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {438#false} is VALID [2022-02-20 14:04:15,452 INFO L290 TraceCheckUtils]: 21: Hoare triple {438#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {438#false} is VALID [2022-02-20 14:04:15,452 INFO L290 TraceCheckUtils]: 22: Hoare triple {438#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {438#false} is VALID [2022-02-20 14:04:15,452 INFO L290 TraceCheckUtils]: 23: Hoare triple {438#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {438#false} is VALID [2022-02-20 14:04:15,452 INFO L290 TraceCheckUtils]: 24: Hoare triple {438#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {438#false} is VALID [2022-02-20 14:04:15,452 INFO L290 TraceCheckUtils]: 25: Hoare triple {438#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {438#false} is VALID [2022-02-20 14:04:15,453 INFO L290 TraceCheckUtils]: 26: Hoare triple {438#false} assume !(main_~i~0#1 < 100000); {438#false} is VALID [2022-02-20 14:04:15,453 INFO L290 TraceCheckUtils]: 27: Hoare triple {438#false} havoc main_~x~0#1;main_~x~0#1 := 0; {438#false} is VALID [2022-02-20 14:04:15,453 INFO L290 TraceCheckUtils]: 28: Hoare triple {438#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 == 42 + main_~incr~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {438#false} is VALID [2022-02-20 14:04:15,453 INFO L290 TraceCheckUtils]: 29: Hoare triple {438#false} assume 0 == __VERIFIER_assert_~cond#1; {438#false} is VALID [2022-02-20 14:04:15,454 INFO L290 TraceCheckUtils]: 30: Hoare triple {438#false} assume !false; {438#false} is VALID [2022-02-20 14:04:15,454 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-02-20 14:04:15,455 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:04:15,455 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149260674] [2022-02-20 14:04:15,455 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149260674] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:04:15,458 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236959040] [2022-02-20 14:04:15,458 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:04:15,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:04:15,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:04:15,460 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:15,461 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:15,535 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:04:15,535 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:04:15,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:04:15,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:04:15,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:04:15,671 INFO L290 TraceCheckUtils]: 0: Hoare triple {437#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(30, 2); {437#true} is VALID [2022-02-20 14:04:15,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {437#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~incr~0#1, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~incr~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {450#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:04:15,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {450#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {440#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:04:15,673 INFO L290 TraceCheckUtils]: 3: Hoare triple {440#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {441#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:04:15,673 INFO L290 TraceCheckUtils]: 4: Hoare triple {441#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {442#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:04:15,674 INFO L290 TraceCheckUtils]: 5: Hoare triple {442#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {443#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:04:15,674 INFO L290 TraceCheckUtils]: 6: Hoare triple {443#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(main_~i~0#1 < 100000); {438#false} is VALID [2022-02-20 14:04:15,675 INFO L290 TraceCheckUtils]: 7: Hoare triple {438#false} main_~i~0#1 := 0; {438#false} is VALID [2022-02-20 14:04:15,675 INFO L290 TraceCheckUtils]: 8: Hoare triple {438#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {438#false} is VALID [2022-02-20 14:04:15,675 INFO L290 TraceCheckUtils]: 9: Hoare triple {438#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {438#false} is VALID [2022-02-20 14:04:15,675 INFO L290 TraceCheckUtils]: 10: Hoare triple {438#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {438#false} is VALID [2022-02-20 14:04:15,675 INFO L290 TraceCheckUtils]: 11: Hoare triple {438#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {438#false} is VALID [2022-02-20 14:04:15,675 INFO L290 TraceCheckUtils]: 12: Hoare triple {438#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {438#false} is VALID [2022-02-20 14:04:15,676 INFO L290 TraceCheckUtils]: 13: Hoare triple {438#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {438#false} is VALID [2022-02-20 14:04:15,676 INFO L290 TraceCheckUtils]: 14: Hoare triple {438#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {438#false} is VALID [2022-02-20 14:04:15,676 INFO L290 TraceCheckUtils]: 15: Hoare triple {438#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {438#false} is VALID [2022-02-20 14:04:15,676 INFO L290 TraceCheckUtils]: 16: Hoare triple {438#false} assume !(main_~i~0#1 < 100000); {438#false} is VALID [2022-02-20 14:04:15,676 INFO L290 TraceCheckUtils]: 17: Hoare triple {438#false} main_~i~0#1 := 0; {438#false} is VALID [2022-02-20 14:04:15,677 INFO L290 TraceCheckUtils]: 18: Hoare triple {438#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {438#false} is VALID [2022-02-20 14:04:15,677 INFO L290 TraceCheckUtils]: 19: Hoare triple {438#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {438#false} is VALID [2022-02-20 14:04:15,677 INFO L290 TraceCheckUtils]: 20: Hoare triple {438#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {438#false} is VALID [2022-02-20 14:04:15,677 INFO L290 TraceCheckUtils]: 21: Hoare triple {438#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {438#false} is VALID [2022-02-20 14:04:15,677 INFO L290 TraceCheckUtils]: 22: Hoare triple {438#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {438#false} is VALID [2022-02-20 14:04:15,677 INFO L290 TraceCheckUtils]: 23: Hoare triple {438#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {438#false} is VALID [2022-02-20 14:04:15,678 INFO L290 TraceCheckUtils]: 24: Hoare triple {438#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {438#false} is VALID [2022-02-20 14:04:15,678 INFO L290 TraceCheckUtils]: 25: Hoare triple {438#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {438#false} is VALID [2022-02-20 14:04:15,678 INFO L290 TraceCheckUtils]: 26: Hoare triple {438#false} assume !(main_~i~0#1 < 100000); {438#false} is VALID [2022-02-20 14:04:15,678 INFO L290 TraceCheckUtils]: 27: Hoare triple {438#false} havoc main_~x~0#1;main_~x~0#1 := 0; {438#false} is VALID [2022-02-20 14:04:15,678 INFO L290 TraceCheckUtils]: 28: Hoare triple {438#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 == 42 + main_~incr~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {438#false} is VALID [2022-02-20 14:04:15,679 INFO L290 TraceCheckUtils]: 29: Hoare triple {438#false} assume 0 == __VERIFIER_assert_~cond#1; {438#false} is VALID [2022-02-20 14:04:15,679 INFO L290 TraceCheckUtils]: 30: Hoare triple {438#false} assume !false; {438#false} is VALID [2022-02-20 14:04:15,679 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-02-20 14:04:15,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:04:15,802 INFO L290 TraceCheckUtils]: 30: Hoare triple {438#false} assume !false; {438#false} is VALID [2022-02-20 14:04:15,802 INFO L290 TraceCheckUtils]: 29: Hoare triple {438#false} assume 0 == __VERIFIER_assert_~cond#1; {438#false} is VALID [2022-02-20 14:04:15,802 INFO L290 TraceCheckUtils]: 28: Hoare triple {438#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 == 42 + main_~incr~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {438#false} is VALID [2022-02-20 14:04:15,802 INFO L290 TraceCheckUtils]: 27: Hoare triple {438#false} havoc main_~x~0#1;main_~x~0#1 := 0; {438#false} is VALID [2022-02-20 14:04:15,803 INFO L290 TraceCheckUtils]: 26: Hoare triple {438#false} assume !(main_~i~0#1 < 100000); {438#false} is VALID [2022-02-20 14:04:15,803 INFO L290 TraceCheckUtils]: 25: Hoare triple {438#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {438#false} is VALID [2022-02-20 14:04:15,803 INFO L290 TraceCheckUtils]: 24: Hoare triple {438#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {438#false} is VALID [2022-02-20 14:04:15,803 INFO L290 TraceCheckUtils]: 23: Hoare triple {438#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {438#false} is VALID [2022-02-20 14:04:15,803 INFO L290 TraceCheckUtils]: 22: Hoare triple {438#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {438#false} is VALID [2022-02-20 14:04:15,804 INFO L290 TraceCheckUtils]: 21: Hoare triple {438#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {438#false} is VALID [2022-02-20 14:04:15,804 INFO L290 TraceCheckUtils]: 20: Hoare triple {438#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {438#false} is VALID [2022-02-20 14:04:15,804 INFO L290 TraceCheckUtils]: 19: Hoare triple {438#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {438#false} is VALID [2022-02-20 14:04:15,804 INFO L290 TraceCheckUtils]: 18: Hoare triple {438#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {438#false} is VALID [2022-02-20 14:04:15,804 INFO L290 TraceCheckUtils]: 17: Hoare triple {438#false} main_~i~0#1 := 0; {438#false} is VALID [2022-02-20 14:04:15,804 INFO L290 TraceCheckUtils]: 16: Hoare triple {438#false} assume !(main_~i~0#1 < 100000); {438#false} is VALID [2022-02-20 14:04:15,805 INFO L290 TraceCheckUtils]: 15: Hoare triple {438#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {438#false} is VALID [2022-02-20 14:04:15,805 INFO L290 TraceCheckUtils]: 14: Hoare triple {438#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {438#false} is VALID [2022-02-20 14:04:15,805 INFO L290 TraceCheckUtils]: 13: Hoare triple {438#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {438#false} is VALID [2022-02-20 14:04:15,805 INFO L290 TraceCheckUtils]: 12: Hoare triple {438#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {438#false} is VALID [2022-02-20 14:04:15,805 INFO L290 TraceCheckUtils]: 11: Hoare triple {438#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {438#false} is VALID [2022-02-20 14:04:15,806 INFO L290 TraceCheckUtils]: 10: Hoare triple {438#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {438#false} is VALID [2022-02-20 14:04:15,806 INFO L290 TraceCheckUtils]: 9: Hoare triple {438#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {438#false} is VALID [2022-02-20 14:04:15,806 INFO L290 TraceCheckUtils]: 8: Hoare triple {438#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {438#false} is VALID [2022-02-20 14:04:15,806 INFO L290 TraceCheckUtils]: 7: Hoare triple {438#false} main_~i~0#1 := 0; {438#false} is VALID [2022-02-20 14:04:15,807 INFO L290 TraceCheckUtils]: 6: Hoare triple {610#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {438#false} is VALID [2022-02-20 14:04:15,807 INFO L290 TraceCheckUtils]: 5: Hoare triple {614#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {610#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:04:15,808 INFO L290 TraceCheckUtils]: 4: Hoare triple {618#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {614#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:04:15,808 INFO L290 TraceCheckUtils]: 3: Hoare triple {622#(< |ULTIMATE.start_main_~i~0#1| 99997)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {618#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:04:15,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {626#(< |ULTIMATE.start_main_~i~0#1| 99996)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {622#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:04:15,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {437#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~incr~0#1, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~incr~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {626#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:04:15,810 INFO L290 TraceCheckUtils]: 0: Hoare triple {437#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(30, 2); {437#true} is VALID [2022-02-20 14:04:15,810 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-02-20 14:04:15,810 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236959040] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:04:15,810 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:04:15,811 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-02-20 14:04:15,811 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537330852] [2022-02-20 14:04:15,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:04:15,812 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 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 31 [2022-02-20 14:04:15,812 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:04:15,812 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 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:15,828 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:15,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 14:04:15,828 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:04:15,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 14:04:15,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-02-20 14:04:15,829 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 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:16,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:16,025 INFO L93 Difference]: Finished difference Result 91 states and 114 transitions. [2022-02-20 14:04:16,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 14:04:16,025 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 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 31 [2022-02-20 14:04:16,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:04:16,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 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:16,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 100 transitions. [2022-02-20 14:04:16,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 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:16,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 100 transitions. [2022-02-20 14:04:16,029 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 100 transitions. [2022-02-20 14:04:16,115 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:04:16,117 INFO L225 Difference]: With dead ends: 91 [2022-02-20 14:04:16,117 INFO L226 Difference]: Without dead ends: 64 [2022-02-20 14:04:16,118 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-02-20 14:04:16,119 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 36 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:04:16,119 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 46 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:04:16,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-02-20 14:04:16,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-02-20 14:04:16,139 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:04:16,139 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 64 states, 63 states have (on average 1.0634920634920635) internal successors, (67), 63 states have internal predecessors, (67), 0 states have call successors, (0), 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:16,140 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 64 states, 63 states have (on average 1.0634920634920635) internal successors, (67), 63 states have internal predecessors, (67), 0 states have call successors, (0), 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:16,140 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 64 states, 63 states have (on average 1.0634920634920635) internal successors, (67), 63 states have internal predecessors, (67), 0 states have call successors, (0), 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:16,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:16,142 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2022-02-20 14:04:16,142 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2022-02-20 14:04:16,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:04:16,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:04:16,143 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 63 states have (on average 1.0634920634920635) internal successors, (67), 63 states have internal predecessors, (67), 0 states have call successors, (0), 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 64 states. [2022-02-20 14:04:16,143 INFO L87 Difference]: Start difference. First operand has 64 states, 63 states have (on average 1.0634920634920635) internal successors, (67), 63 states have internal predecessors, (67), 0 states have call successors, (0), 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 64 states. [2022-02-20 14:04:16,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:16,145 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2022-02-20 14:04:16,145 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2022-02-20 14:04:16,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:04:16,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:04:16,146 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:04:16,146 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:04:16,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.0634920634920635) internal successors, (67), 63 states have internal predecessors, (67), 0 states have call successors, (0), 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:16,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2022-02-20 14:04:16,147 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 31 [2022-02-20 14:04:16,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:04:16,148 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2022-02-20 14:04:16,148 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 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:16,148 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2022-02-20 14:04:16,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-02-20 14:04:16,149 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:04:16,149 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:04:16,167 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:16,363 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:16,363 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:04:16,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:04:16,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1049188716, now seen corresponding path program 3 times [2022-02-20 14:04:16,364 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:04:16,364 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036703587] [2022-02-20 14:04:16,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:04:16,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:04:16,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:04:16,566 INFO L290 TraceCheckUtils]: 0: Hoare triple {994#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(30, 2); {994#true} is VALID [2022-02-20 14:04:16,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {994#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~incr~0#1, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~incr~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {996#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:04:16,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {996#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {997#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:04:16,568 INFO L290 TraceCheckUtils]: 3: Hoare triple {997#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {998#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:04:16,568 INFO L290 TraceCheckUtils]: 4: Hoare triple {998#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {999#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:04:16,569 INFO L290 TraceCheckUtils]: 5: Hoare triple {999#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1000#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:04:16,569 INFO L290 TraceCheckUtils]: 6: Hoare triple {1000#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1001#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:04:16,570 INFO L290 TraceCheckUtils]: 7: Hoare triple {1001#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1002#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:04:16,570 INFO L290 TraceCheckUtils]: 8: Hoare triple {1002#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1003#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:04:16,571 INFO L290 TraceCheckUtils]: 9: Hoare triple {1003#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1004#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:04:16,572 INFO L290 TraceCheckUtils]: 10: Hoare triple {1004#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1005#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:04:16,572 INFO L290 TraceCheckUtils]: 11: Hoare triple {1005#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1006#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:04:16,573 INFO L290 TraceCheckUtils]: 12: Hoare triple {1006#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !(main_~i~0#1 < 100000); {995#false} is VALID [2022-02-20 14:04:16,573 INFO L290 TraceCheckUtils]: 13: Hoare triple {995#false} main_~i~0#1 := 0; {995#false} is VALID [2022-02-20 14:04:16,573 INFO L290 TraceCheckUtils]: 14: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {995#false} is VALID [2022-02-20 14:04:16,573 INFO L290 TraceCheckUtils]: 15: Hoare triple {995#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {995#false} is VALID [2022-02-20 14:04:16,573 INFO L290 TraceCheckUtils]: 16: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {995#false} is VALID [2022-02-20 14:04:16,573 INFO L290 TraceCheckUtils]: 17: Hoare triple {995#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {995#false} is VALID [2022-02-20 14:04:16,574 INFO L290 TraceCheckUtils]: 18: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {995#false} is VALID [2022-02-20 14:04:16,574 INFO L290 TraceCheckUtils]: 19: Hoare triple {995#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {995#false} is VALID [2022-02-20 14:04:16,574 INFO L290 TraceCheckUtils]: 20: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {995#false} is VALID [2022-02-20 14:04:16,574 INFO L290 TraceCheckUtils]: 21: Hoare triple {995#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {995#false} is VALID [2022-02-20 14:04:16,574 INFO L290 TraceCheckUtils]: 22: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {995#false} is VALID [2022-02-20 14:04:16,575 INFO L290 TraceCheckUtils]: 23: Hoare triple {995#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {995#false} is VALID [2022-02-20 14:04:16,575 INFO L290 TraceCheckUtils]: 24: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {995#false} is VALID [2022-02-20 14:04:16,575 INFO L290 TraceCheckUtils]: 25: Hoare triple {995#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {995#false} is VALID [2022-02-20 14:04:16,575 INFO L290 TraceCheckUtils]: 26: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {995#false} is VALID [2022-02-20 14:04:16,575 INFO L290 TraceCheckUtils]: 27: Hoare triple {995#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {995#false} is VALID [2022-02-20 14:04:16,575 INFO L290 TraceCheckUtils]: 28: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {995#false} is VALID [2022-02-20 14:04:16,576 INFO L290 TraceCheckUtils]: 29: Hoare triple {995#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {995#false} is VALID [2022-02-20 14:04:16,576 INFO L290 TraceCheckUtils]: 30: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {995#false} is VALID [2022-02-20 14:04:16,576 INFO L290 TraceCheckUtils]: 31: Hoare triple {995#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {995#false} is VALID [2022-02-20 14:04:16,576 INFO L290 TraceCheckUtils]: 32: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {995#false} is VALID [2022-02-20 14:04:16,576 INFO L290 TraceCheckUtils]: 33: Hoare triple {995#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {995#false} is VALID [2022-02-20 14:04:16,576 INFO L290 TraceCheckUtils]: 34: Hoare triple {995#false} assume !(main_~i~0#1 < 100000); {995#false} is VALID [2022-02-20 14:04:16,577 INFO L290 TraceCheckUtils]: 35: Hoare triple {995#false} main_~i~0#1 := 0; {995#false} is VALID [2022-02-20 14:04:16,577 INFO L290 TraceCheckUtils]: 36: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {995#false} is VALID [2022-02-20 14:04:16,577 INFO L290 TraceCheckUtils]: 37: Hoare triple {995#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {995#false} is VALID [2022-02-20 14:04:16,577 INFO L290 TraceCheckUtils]: 38: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {995#false} is VALID [2022-02-20 14:04:16,577 INFO L290 TraceCheckUtils]: 39: Hoare triple {995#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {995#false} is VALID [2022-02-20 14:04:16,577 INFO L290 TraceCheckUtils]: 40: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {995#false} is VALID [2022-02-20 14:04:16,578 INFO L290 TraceCheckUtils]: 41: Hoare triple {995#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {995#false} is VALID [2022-02-20 14:04:16,578 INFO L290 TraceCheckUtils]: 42: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {995#false} is VALID [2022-02-20 14:04:16,578 INFO L290 TraceCheckUtils]: 43: Hoare triple {995#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {995#false} is VALID [2022-02-20 14:04:16,578 INFO L290 TraceCheckUtils]: 44: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {995#false} is VALID [2022-02-20 14:04:16,578 INFO L290 TraceCheckUtils]: 45: Hoare triple {995#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {995#false} is VALID [2022-02-20 14:04:16,578 INFO L290 TraceCheckUtils]: 46: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {995#false} is VALID [2022-02-20 14:04:16,579 INFO L290 TraceCheckUtils]: 47: Hoare triple {995#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {995#false} is VALID [2022-02-20 14:04:16,579 INFO L290 TraceCheckUtils]: 48: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {995#false} is VALID [2022-02-20 14:04:16,579 INFO L290 TraceCheckUtils]: 49: Hoare triple {995#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {995#false} is VALID [2022-02-20 14:04:16,579 INFO L290 TraceCheckUtils]: 50: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {995#false} is VALID [2022-02-20 14:04:16,579 INFO L290 TraceCheckUtils]: 51: Hoare triple {995#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {995#false} is VALID [2022-02-20 14:04:16,579 INFO L290 TraceCheckUtils]: 52: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {995#false} is VALID [2022-02-20 14:04:16,580 INFO L290 TraceCheckUtils]: 53: Hoare triple {995#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {995#false} is VALID [2022-02-20 14:04:16,580 INFO L290 TraceCheckUtils]: 54: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {995#false} is VALID [2022-02-20 14:04:16,580 INFO L290 TraceCheckUtils]: 55: Hoare triple {995#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {995#false} is VALID [2022-02-20 14:04:16,580 INFO L290 TraceCheckUtils]: 56: Hoare triple {995#false} assume !(main_~i~0#1 < 100000); {995#false} is VALID [2022-02-20 14:04:16,580 INFO L290 TraceCheckUtils]: 57: Hoare triple {995#false} havoc main_~x~0#1;main_~x~0#1 := 0; {995#false} is VALID [2022-02-20 14:04:16,580 INFO L290 TraceCheckUtils]: 58: Hoare triple {995#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 == 42 + main_~incr~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {995#false} is VALID [2022-02-20 14:04:16,581 INFO L290 TraceCheckUtils]: 59: Hoare triple {995#false} assume 0 == __VERIFIER_assert_~cond#1; {995#false} is VALID [2022-02-20 14:04:16,581 INFO L290 TraceCheckUtils]: 60: Hoare triple {995#false} assume !false; {995#false} is VALID [2022-02-20 14:04:16,581 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2022-02-20 14:04:16,581 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:04:16,582 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036703587] [2022-02-20 14:04:16,582 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036703587] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:04:16,582 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281411528] [2022-02-20 14:04:16,582 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 14:04:16,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:04:16,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:04:16,583 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:16,596 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:16,874 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-02-20 14:04:16,874 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:04:16,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 14:04:16,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:04:16,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:04:17,120 INFO L290 TraceCheckUtils]: 0: Hoare triple {994#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(30, 2); {994#true} is VALID [2022-02-20 14:04:17,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {994#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~incr~0#1, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~incr~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {1013#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:04:17,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {1013#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {997#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:04:17,123 INFO L290 TraceCheckUtils]: 3: Hoare triple {997#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {998#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:04:17,123 INFO L290 TraceCheckUtils]: 4: Hoare triple {998#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {999#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:04:17,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {999#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1000#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:04:17,125 INFO L290 TraceCheckUtils]: 6: Hoare triple {1000#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1001#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:04:17,126 INFO L290 TraceCheckUtils]: 7: Hoare triple {1001#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1002#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:04:17,127 INFO L290 TraceCheckUtils]: 8: Hoare triple {1002#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1003#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:04:17,127 INFO L290 TraceCheckUtils]: 9: Hoare triple {1003#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1004#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:04:17,128 INFO L290 TraceCheckUtils]: 10: Hoare triple {1004#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1005#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:04:17,128 INFO L290 TraceCheckUtils]: 11: Hoare triple {1005#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1006#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:04:17,129 INFO L290 TraceCheckUtils]: 12: Hoare triple {1006#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !(main_~i~0#1 < 100000); {995#false} is VALID [2022-02-20 14:04:17,129 INFO L290 TraceCheckUtils]: 13: Hoare triple {995#false} main_~i~0#1 := 0; {995#false} is VALID [2022-02-20 14:04:17,129 INFO L290 TraceCheckUtils]: 14: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {995#false} is VALID [2022-02-20 14:04:17,129 INFO L290 TraceCheckUtils]: 15: Hoare triple {995#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {995#false} is VALID [2022-02-20 14:04:17,130 INFO L290 TraceCheckUtils]: 16: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {995#false} is VALID [2022-02-20 14:04:17,130 INFO L290 TraceCheckUtils]: 17: Hoare triple {995#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {995#false} is VALID [2022-02-20 14:04:17,130 INFO L290 TraceCheckUtils]: 18: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {995#false} is VALID [2022-02-20 14:04:17,130 INFO L290 TraceCheckUtils]: 19: Hoare triple {995#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {995#false} is VALID [2022-02-20 14:04:17,130 INFO L290 TraceCheckUtils]: 20: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {995#false} is VALID [2022-02-20 14:04:17,131 INFO L290 TraceCheckUtils]: 21: Hoare triple {995#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {995#false} is VALID [2022-02-20 14:04:17,131 INFO L290 TraceCheckUtils]: 22: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {995#false} is VALID [2022-02-20 14:04:17,131 INFO L290 TraceCheckUtils]: 23: Hoare triple {995#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {995#false} is VALID [2022-02-20 14:04:17,131 INFO L290 TraceCheckUtils]: 24: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {995#false} is VALID [2022-02-20 14:04:17,131 INFO L290 TraceCheckUtils]: 25: Hoare triple {995#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {995#false} is VALID [2022-02-20 14:04:17,132 INFO L290 TraceCheckUtils]: 26: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {995#false} is VALID [2022-02-20 14:04:17,132 INFO L290 TraceCheckUtils]: 27: Hoare triple {995#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {995#false} is VALID [2022-02-20 14:04:17,132 INFO L290 TraceCheckUtils]: 28: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {995#false} is VALID [2022-02-20 14:04:17,132 INFO L290 TraceCheckUtils]: 29: Hoare triple {995#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {995#false} is VALID [2022-02-20 14:04:17,132 INFO L290 TraceCheckUtils]: 30: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {995#false} is VALID [2022-02-20 14:04:17,132 INFO L290 TraceCheckUtils]: 31: Hoare triple {995#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {995#false} is VALID [2022-02-20 14:04:17,133 INFO L290 TraceCheckUtils]: 32: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {995#false} is VALID [2022-02-20 14:04:17,133 INFO L290 TraceCheckUtils]: 33: Hoare triple {995#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {995#false} is VALID [2022-02-20 14:04:17,133 INFO L290 TraceCheckUtils]: 34: Hoare triple {995#false} assume !(main_~i~0#1 < 100000); {995#false} is VALID [2022-02-20 14:04:17,133 INFO L290 TraceCheckUtils]: 35: Hoare triple {995#false} main_~i~0#1 := 0; {995#false} is VALID [2022-02-20 14:04:17,133 INFO L290 TraceCheckUtils]: 36: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {995#false} is VALID [2022-02-20 14:04:17,134 INFO L290 TraceCheckUtils]: 37: Hoare triple {995#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {995#false} is VALID [2022-02-20 14:04:17,134 INFO L290 TraceCheckUtils]: 38: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {995#false} is VALID [2022-02-20 14:04:17,134 INFO L290 TraceCheckUtils]: 39: Hoare triple {995#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {995#false} is VALID [2022-02-20 14:04:17,134 INFO L290 TraceCheckUtils]: 40: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {995#false} is VALID [2022-02-20 14:04:17,134 INFO L290 TraceCheckUtils]: 41: Hoare triple {995#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {995#false} is VALID [2022-02-20 14:04:17,135 INFO L290 TraceCheckUtils]: 42: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {995#false} is VALID [2022-02-20 14:04:17,135 INFO L290 TraceCheckUtils]: 43: Hoare triple {995#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {995#false} is VALID [2022-02-20 14:04:17,135 INFO L290 TraceCheckUtils]: 44: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {995#false} is VALID [2022-02-20 14:04:17,135 INFO L290 TraceCheckUtils]: 45: Hoare triple {995#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {995#false} is VALID [2022-02-20 14:04:17,135 INFO L290 TraceCheckUtils]: 46: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {995#false} is VALID [2022-02-20 14:04:17,136 INFO L290 TraceCheckUtils]: 47: Hoare triple {995#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {995#false} is VALID [2022-02-20 14:04:17,136 INFO L290 TraceCheckUtils]: 48: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {995#false} is VALID [2022-02-20 14:04:17,136 INFO L290 TraceCheckUtils]: 49: Hoare triple {995#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {995#false} is VALID [2022-02-20 14:04:17,136 INFO L290 TraceCheckUtils]: 50: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {995#false} is VALID [2022-02-20 14:04:17,136 INFO L290 TraceCheckUtils]: 51: Hoare triple {995#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {995#false} is VALID [2022-02-20 14:04:17,137 INFO L290 TraceCheckUtils]: 52: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {995#false} is VALID [2022-02-20 14:04:17,137 INFO L290 TraceCheckUtils]: 53: Hoare triple {995#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {995#false} is VALID [2022-02-20 14:04:17,137 INFO L290 TraceCheckUtils]: 54: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {995#false} is VALID [2022-02-20 14:04:17,137 INFO L290 TraceCheckUtils]: 55: Hoare triple {995#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {995#false} is VALID [2022-02-20 14:04:17,137 INFO L290 TraceCheckUtils]: 56: Hoare triple {995#false} assume !(main_~i~0#1 < 100000); {995#false} is VALID [2022-02-20 14:04:17,138 INFO L290 TraceCheckUtils]: 57: Hoare triple {995#false} havoc main_~x~0#1;main_~x~0#1 := 0; {995#false} is VALID [2022-02-20 14:04:17,138 INFO L290 TraceCheckUtils]: 58: Hoare triple {995#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 == 42 + main_~incr~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {995#false} is VALID [2022-02-20 14:04:17,138 INFO L290 TraceCheckUtils]: 59: Hoare triple {995#false} assume 0 == __VERIFIER_assert_~cond#1; {995#false} is VALID [2022-02-20 14:04:17,138 INFO L290 TraceCheckUtils]: 60: Hoare triple {995#false} assume !false; {995#false} is VALID [2022-02-20 14:04:17,139 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2022-02-20 14:04:17,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:04:17,549 INFO L290 TraceCheckUtils]: 60: Hoare triple {995#false} assume !false; {995#false} is VALID [2022-02-20 14:04:17,549 INFO L290 TraceCheckUtils]: 59: Hoare triple {995#false} assume 0 == __VERIFIER_assert_~cond#1; {995#false} is VALID [2022-02-20 14:04:17,549 INFO L290 TraceCheckUtils]: 58: Hoare triple {995#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 == 42 + main_~incr~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {995#false} is VALID [2022-02-20 14:04:17,549 INFO L290 TraceCheckUtils]: 57: Hoare triple {995#false} havoc main_~x~0#1;main_~x~0#1 := 0; {995#false} is VALID [2022-02-20 14:04:17,550 INFO L290 TraceCheckUtils]: 56: Hoare triple {995#false} assume !(main_~i~0#1 < 100000); {995#false} is VALID [2022-02-20 14:04:17,550 INFO L290 TraceCheckUtils]: 55: Hoare triple {995#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {995#false} is VALID [2022-02-20 14:04:17,550 INFO L290 TraceCheckUtils]: 54: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {995#false} is VALID [2022-02-20 14:04:17,550 INFO L290 TraceCheckUtils]: 53: Hoare triple {995#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {995#false} is VALID [2022-02-20 14:04:17,550 INFO L290 TraceCheckUtils]: 52: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {995#false} is VALID [2022-02-20 14:04:17,551 INFO L290 TraceCheckUtils]: 51: Hoare triple {995#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {995#false} is VALID [2022-02-20 14:04:17,551 INFO L290 TraceCheckUtils]: 50: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {995#false} is VALID [2022-02-20 14:04:17,552 INFO L290 TraceCheckUtils]: 49: Hoare triple {995#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {995#false} is VALID [2022-02-20 14:04:17,552 INFO L290 TraceCheckUtils]: 48: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {995#false} is VALID [2022-02-20 14:04:17,552 INFO L290 TraceCheckUtils]: 47: Hoare triple {995#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {995#false} is VALID [2022-02-20 14:04:17,552 INFO L290 TraceCheckUtils]: 46: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {995#false} is VALID [2022-02-20 14:04:17,552 INFO L290 TraceCheckUtils]: 45: Hoare triple {995#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {995#false} is VALID [2022-02-20 14:04:17,553 INFO L290 TraceCheckUtils]: 44: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {995#false} is VALID [2022-02-20 14:04:17,553 INFO L290 TraceCheckUtils]: 43: Hoare triple {995#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {995#false} is VALID [2022-02-20 14:04:17,553 INFO L290 TraceCheckUtils]: 42: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {995#false} is VALID [2022-02-20 14:04:17,553 INFO L290 TraceCheckUtils]: 41: Hoare triple {995#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {995#false} is VALID [2022-02-20 14:04:17,553 INFO L290 TraceCheckUtils]: 40: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {995#false} is VALID [2022-02-20 14:04:17,553 INFO L290 TraceCheckUtils]: 39: Hoare triple {995#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {995#false} is VALID [2022-02-20 14:04:17,554 INFO L290 TraceCheckUtils]: 38: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {995#false} is VALID [2022-02-20 14:04:17,554 INFO L290 TraceCheckUtils]: 37: Hoare triple {995#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {995#false} is VALID [2022-02-20 14:04:17,554 INFO L290 TraceCheckUtils]: 36: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {995#false} is VALID [2022-02-20 14:04:17,554 INFO L290 TraceCheckUtils]: 35: Hoare triple {995#false} main_~i~0#1 := 0; {995#false} is VALID [2022-02-20 14:04:17,554 INFO L290 TraceCheckUtils]: 34: Hoare triple {995#false} assume !(main_~i~0#1 < 100000); {995#false} is VALID [2022-02-20 14:04:17,555 INFO L290 TraceCheckUtils]: 33: Hoare triple {995#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {995#false} is VALID [2022-02-20 14:04:17,555 INFO L290 TraceCheckUtils]: 32: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {995#false} is VALID [2022-02-20 14:04:17,555 INFO L290 TraceCheckUtils]: 31: Hoare triple {995#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {995#false} is VALID [2022-02-20 14:04:17,555 INFO L290 TraceCheckUtils]: 30: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {995#false} is VALID [2022-02-20 14:04:17,555 INFO L290 TraceCheckUtils]: 29: Hoare triple {995#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {995#false} is VALID [2022-02-20 14:04:17,558 INFO L290 TraceCheckUtils]: 28: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {995#false} is VALID [2022-02-20 14:04:17,558 INFO L290 TraceCheckUtils]: 27: Hoare triple {995#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {995#false} is VALID [2022-02-20 14:04:17,558 INFO L290 TraceCheckUtils]: 26: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {995#false} is VALID [2022-02-20 14:04:17,558 INFO L290 TraceCheckUtils]: 25: Hoare triple {995#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {995#false} is VALID [2022-02-20 14:04:17,558 INFO L290 TraceCheckUtils]: 24: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {995#false} is VALID [2022-02-20 14:04:17,559 INFO L290 TraceCheckUtils]: 23: Hoare triple {995#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {995#false} is VALID [2022-02-20 14:04:17,559 INFO L290 TraceCheckUtils]: 22: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {995#false} is VALID [2022-02-20 14:04:17,559 INFO L290 TraceCheckUtils]: 21: Hoare triple {995#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {995#false} is VALID [2022-02-20 14:04:17,560 INFO L290 TraceCheckUtils]: 20: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {995#false} is VALID [2022-02-20 14:04:17,560 INFO L290 TraceCheckUtils]: 19: Hoare triple {995#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {995#false} is VALID [2022-02-20 14:04:17,560 INFO L290 TraceCheckUtils]: 18: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {995#false} is VALID [2022-02-20 14:04:17,560 INFO L290 TraceCheckUtils]: 17: Hoare triple {995#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {995#false} is VALID [2022-02-20 14:04:17,561 INFO L290 TraceCheckUtils]: 16: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {995#false} is VALID [2022-02-20 14:04:17,561 INFO L290 TraceCheckUtils]: 15: Hoare triple {995#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {995#false} is VALID [2022-02-20 14:04:17,561 INFO L290 TraceCheckUtils]: 14: Hoare triple {995#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {995#false} is VALID [2022-02-20 14:04:17,561 INFO L290 TraceCheckUtils]: 13: Hoare triple {995#false} main_~i~0#1 := 0; {995#false} is VALID [2022-02-20 14:04:17,562 INFO L290 TraceCheckUtils]: 12: Hoare triple {1335#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {995#false} is VALID [2022-02-20 14:04:17,562 INFO L290 TraceCheckUtils]: 11: Hoare triple {1339#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1335#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:04:17,563 INFO L290 TraceCheckUtils]: 10: Hoare triple {1343#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1339#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:04:17,564 INFO L290 TraceCheckUtils]: 9: Hoare triple {1347#(< |ULTIMATE.start_main_~i~0#1| 99997)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1343#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:04:17,564 INFO L290 TraceCheckUtils]: 8: Hoare triple {1351#(< |ULTIMATE.start_main_~i~0#1| 99996)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1347#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:04:17,565 INFO L290 TraceCheckUtils]: 7: Hoare triple {1355#(< |ULTIMATE.start_main_~i~0#1| 99995)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1351#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:04:17,565 INFO L290 TraceCheckUtils]: 6: Hoare triple {1359#(< |ULTIMATE.start_main_~i~0#1| 99994)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1355#(< |ULTIMATE.start_main_~i~0#1| 99995)} is VALID [2022-02-20 14:04:17,566 INFO L290 TraceCheckUtils]: 5: Hoare triple {1363#(< |ULTIMATE.start_main_~i~0#1| 99993)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1359#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-20 14:04:17,566 INFO L290 TraceCheckUtils]: 4: Hoare triple {1367#(< |ULTIMATE.start_main_~i~0#1| 99992)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1363#(< |ULTIMATE.start_main_~i~0#1| 99993)} is VALID [2022-02-20 14:04:17,567 INFO L290 TraceCheckUtils]: 3: Hoare triple {1371#(< |ULTIMATE.start_main_~i~0#1| 99991)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1367#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-20 14:04:17,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {1375#(< |ULTIMATE.start_main_~i~0#1| 99990)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {1371#(< |ULTIMATE.start_main_~i~0#1| 99991)} is VALID [2022-02-20 14:04:17,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {994#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~incr~0#1, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~incr~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {1375#(< |ULTIMATE.start_main_~i~0#1| 99990)} is VALID [2022-02-20 14:04:17,572 INFO L290 TraceCheckUtils]: 0: Hoare triple {994#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(30, 2); {994#true} is VALID [2022-02-20 14:04:17,573 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2022-02-20 14:04:17,573 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281411528] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:04:17,573 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:04:17,573 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-02-20 14:04:17,573 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295617176] [2022-02-20 14:04:17,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:04:17,574 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.56) internal successors, (39), 25 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2022-02-20 14:04:17,575 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:04:17,575 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.56) internal successors, (39), 25 states have internal predecessors, (39), 0 states have call successors, (0), 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:17,602 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:04:17,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-02-20 14:04:17,602 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:04:17,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-20 14:04:17,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-02-20 14:04:17,604 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand has 25 states, 25 states have (on average 1.56) internal successors, (39), 25 states have internal predecessors, (39), 0 states have call successors, (0), 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:18,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:18,192 INFO L93 Difference]: Finished difference Result 175 states and 216 transitions. [2022-02-20 14:04:18,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-20 14:04:18,192 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.56) internal successors, (39), 25 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2022-02-20 14:04:18,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:04:18,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.56) internal successors, (39), 25 states have internal predecessors, (39), 0 states have call successors, (0), 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:18,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 178 transitions. [2022-02-20 14:04:18,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.56) internal successors, (39), 25 states have internal predecessors, (39), 0 states have call successors, (0), 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:18,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 178 transitions. [2022-02-20 14:04:18,198 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 178 transitions. [2022-02-20 14:04:18,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:04:18,335 INFO L225 Difference]: With dead ends: 175 [2022-02-20 14:04:18,335 INFO L226 Difference]: Without dead ends: 124 [2022-02-20 14:04:18,336 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-02-20 14:04:18,337 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 148 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 14:04:18,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 38 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 14:04:18,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-02-20 14:04:18,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-02-20 14:04:18,384 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:04:18,384 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand has 124 states, 123 states have (on average 1.032520325203252) internal successors, (127), 123 states have internal predecessors, (127), 0 states have call successors, (0), 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:18,385 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand has 124 states, 123 states have (on average 1.032520325203252) internal successors, (127), 123 states have internal predecessors, (127), 0 states have call successors, (0), 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:18,385 INFO L87 Difference]: Start difference. First operand 124 states. Second operand has 124 states, 123 states have (on average 1.032520325203252) internal successors, (127), 123 states have internal predecessors, (127), 0 states have call successors, (0), 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:18,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:18,389 INFO L93 Difference]: Finished difference Result 124 states and 127 transitions. [2022-02-20 14:04:18,389 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 127 transitions. [2022-02-20 14:04:18,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:04:18,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:04:18,390 INFO L74 IsIncluded]: Start isIncluded. First operand has 124 states, 123 states have (on average 1.032520325203252) internal successors, (127), 123 states have internal predecessors, (127), 0 states have call successors, (0), 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 124 states. [2022-02-20 14:04:18,391 INFO L87 Difference]: Start difference. First operand has 124 states, 123 states have (on average 1.032520325203252) internal successors, (127), 123 states have internal predecessors, (127), 0 states have call successors, (0), 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 124 states. [2022-02-20 14:04:18,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:18,394 INFO L93 Difference]: Finished difference Result 124 states and 127 transitions. [2022-02-20 14:04:18,394 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 127 transitions. [2022-02-20 14:04:18,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:04:18,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:04:18,395 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:04:18,395 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:04:18,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 123 states have (on average 1.032520325203252) internal successors, (127), 123 states have internal predecessors, (127), 0 states have call successors, (0), 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:18,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 127 transitions. [2022-02-20 14:04:18,400 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 127 transitions. Word has length 61 [2022-02-20 14:04:18,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:04:18,400 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 127 transitions. [2022-02-20 14:04:18,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.56) internal successors, (39), 25 states have internal predecessors, (39), 0 states have call successors, (0), 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:18,400 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 127 transitions. [2022-02-20 14:04:18,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-02-20 14:04:18,402 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:04:18,403 INFO L514 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:04:18,446 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:18,619 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:18,620 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:04:18,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:04:18,620 INFO L85 PathProgramCache]: Analyzing trace with hash 952921252, now seen corresponding path program 4 times [2022-02-20 14:04:18,620 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:04:18,620 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690082185] [2022-02-20 14:04:18,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:04:18,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:04:18,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:04:19,120 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(30, 2); {2091#true} is VALID [2022-02-20 14:04:19,121 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~nondet1#1, main_#t~mem3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~incr~0#1, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~incr~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {2093#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:04:19,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {2093#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2094#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:04:19,122 INFO L290 TraceCheckUtils]: 3: Hoare triple {2094#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2095#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:04:19,123 INFO L290 TraceCheckUtils]: 4: Hoare triple {2095#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2096#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:04:19,123 INFO L290 TraceCheckUtils]: 5: Hoare triple {2096#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2097#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:04:19,124 INFO L290 TraceCheckUtils]: 6: Hoare triple {2097#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2098#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:04:19,125 INFO L290 TraceCheckUtils]: 7: Hoare triple {2098#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2099#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:04:19,125 INFO L290 TraceCheckUtils]: 8: Hoare triple {2099#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2100#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:04:19,126 INFO L290 TraceCheckUtils]: 9: Hoare triple {2100#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2101#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:04:19,127 INFO L290 TraceCheckUtils]: 10: Hoare triple {2101#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2102#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:04:19,127 INFO L290 TraceCheckUtils]: 11: Hoare triple {2102#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2103#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:04:19,128 INFO L290 TraceCheckUtils]: 12: Hoare triple {2103#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2104#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:04:19,129 INFO L290 TraceCheckUtils]: 13: Hoare triple {2104#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2105#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:04:19,129 INFO L290 TraceCheckUtils]: 14: Hoare triple {2105#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2106#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:04:19,130 INFO L290 TraceCheckUtils]: 15: Hoare triple {2106#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2107#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:04:19,131 INFO L290 TraceCheckUtils]: 16: Hoare triple {2107#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2108#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:04:19,131 INFO L290 TraceCheckUtils]: 17: Hoare triple {2108#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2109#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:04:19,132 INFO L290 TraceCheckUtils]: 18: Hoare triple {2109#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2110#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:04:19,134 INFO L290 TraceCheckUtils]: 19: Hoare triple {2110#(<= |ULTIMATE.start_main_~i~0#1| 17)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2111#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:04:19,135 INFO L290 TraceCheckUtils]: 20: Hoare triple {2111#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2112#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:04:19,135 INFO L290 TraceCheckUtils]: 21: Hoare triple {2112#(<= |ULTIMATE.start_main_~i~0#1| 19)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2113#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:04:19,136 INFO L290 TraceCheckUtils]: 22: Hoare triple {2113#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2114#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:04:19,137 INFO L290 TraceCheckUtils]: 23: Hoare triple {2114#(<= |ULTIMATE.start_main_~i~0#1| 21)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2115#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 14:04:19,137 INFO L290 TraceCheckUtils]: 24: Hoare triple {2115#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !(main_~i~0#1 < 100000); {2092#false} is VALID [2022-02-20 14:04:19,137 INFO L290 TraceCheckUtils]: 25: Hoare triple {2092#false} main_~i~0#1 := 0; {2092#false} is VALID [2022-02-20 14:04:19,138 INFO L290 TraceCheckUtils]: 26: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2092#false} is VALID [2022-02-20 14:04:19,138 INFO L290 TraceCheckUtils]: 27: Hoare triple {2092#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2092#false} is VALID [2022-02-20 14:04:19,138 INFO L290 TraceCheckUtils]: 28: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2092#false} is VALID [2022-02-20 14:04:19,138 INFO L290 TraceCheckUtils]: 29: Hoare triple {2092#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2092#false} is VALID [2022-02-20 14:04:19,138 INFO L290 TraceCheckUtils]: 30: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2092#false} is VALID [2022-02-20 14:04:19,139 INFO L290 TraceCheckUtils]: 31: Hoare triple {2092#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2092#false} is VALID [2022-02-20 14:04:19,139 INFO L290 TraceCheckUtils]: 32: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2092#false} is VALID [2022-02-20 14:04:19,139 INFO L290 TraceCheckUtils]: 33: Hoare triple {2092#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2092#false} is VALID [2022-02-20 14:04:19,139 INFO L290 TraceCheckUtils]: 34: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2092#false} is VALID [2022-02-20 14:04:19,139 INFO L290 TraceCheckUtils]: 35: Hoare triple {2092#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2092#false} is VALID [2022-02-20 14:04:19,140 INFO L290 TraceCheckUtils]: 36: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2092#false} is VALID [2022-02-20 14:04:19,140 INFO L290 TraceCheckUtils]: 37: Hoare triple {2092#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2092#false} is VALID [2022-02-20 14:04:19,140 INFO L290 TraceCheckUtils]: 38: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2092#false} is VALID [2022-02-20 14:04:19,140 INFO L290 TraceCheckUtils]: 39: Hoare triple {2092#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2092#false} is VALID [2022-02-20 14:04:19,140 INFO L290 TraceCheckUtils]: 40: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2092#false} is VALID [2022-02-20 14:04:19,140 INFO L290 TraceCheckUtils]: 41: Hoare triple {2092#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2092#false} is VALID [2022-02-20 14:04:19,141 INFO L290 TraceCheckUtils]: 42: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2092#false} is VALID [2022-02-20 14:04:19,141 INFO L290 TraceCheckUtils]: 43: Hoare triple {2092#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2092#false} is VALID [2022-02-20 14:04:19,141 INFO L290 TraceCheckUtils]: 44: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2092#false} is VALID [2022-02-20 14:04:19,141 INFO L290 TraceCheckUtils]: 45: Hoare triple {2092#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2092#false} is VALID [2022-02-20 14:04:19,141 INFO L290 TraceCheckUtils]: 46: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2092#false} is VALID [2022-02-20 14:04:19,142 INFO L290 TraceCheckUtils]: 47: Hoare triple {2092#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2092#false} is VALID [2022-02-20 14:04:19,142 INFO L290 TraceCheckUtils]: 48: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2092#false} is VALID [2022-02-20 14:04:19,142 INFO L290 TraceCheckUtils]: 49: Hoare triple {2092#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2092#false} is VALID [2022-02-20 14:04:19,142 INFO L290 TraceCheckUtils]: 50: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2092#false} is VALID [2022-02-20 14:04:19,142 INFO L290 TraceCheckUtils]: 51: Hoare triple {2092#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2092#false} is VALID [2022-02-20 14:04:19,142 INFO L290 TraceCheckUtils]: 52: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2092#false} is VALID [2022-02-20 14:04:19,143 INFO L290 TraceCheckUtils]: 53: Hoare triple {2092#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2092#false} is VALID [2022-02-20 14:04:19,143 INFO L290 TraceCheckUtils]: 54: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2092#false} is VALID [2022-02-20 14:04:19,143 INFO L290 TraceCheckUtils]: 55: Hoare triple {2092#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2092#false} is VALID [2022-02-20 14:04:19,143 INFO L290 TraceCheckUtils]: 56: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2092#false} is VALID [2022-02-20 14:04:19,143 INFO L290 TraceCheckUtils]: 57: Hoare triple {2092#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2092#false} is VALID [2022-02-20 14:04:19,144 INFO L290 TraceCheckUtils]: 58: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2092#false} is VALID [2022-02-20 14:04:19,144 INFO L290 TraceCheckUtils]: 59: Hoare triple {2092#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2092#false} is VALID [2022-02-20 14:04:19,144 INFO L290 TraceCheckUtils]: 60: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2092#false} is VALID [2022-02-20 14:04:19,144 INFO L290 TraceCheckUtils]: 61: Hoare triple {2092#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2092#false} is VALID [2022-02-20 14:04:19,144 INFO L290 TraceCheckUtils]: 62: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2092#false} is VALID [2022-02-20 14:04:19,144 INFO L290 TraceCheckUtils]: 63: Hoare triple {2092#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2092#false} is VALID [2022-02-20 14:04:19,145 INFO L290 TraceCheckUtils]: 64: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2092#false} is VALID [2022-02-20 14:04:19,145 INFO L290 TraceCheckUtils]: 65: Hoare triple {2092#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2092#false} is VALID [2022-02-20 14:04:19,145 INFO L290 TraceCheckUtils]: 66: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2092#false} is VALID [2022-02-20 14:04:19,145 INFO L290 TraceCheckUtils]: 67: Hoare triple {2092#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2092#false} is VALID [2022-02-20 14:04:19,145 INFO L290 TraceCheckUtils]: 68: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2092#false} is VALID [2022-02-20 14:04:19,146 INFO L290 TraceCheckUtils]: 69: Hoare triple {2092#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2092#false} is VALID [2022-02-20 14:04:19,146 INFO L290 TraceCheckUtils]: 70: Hoare triple {2092#false} assume !(main_~i~0#1 < 100000); {2092#false} is VALID [2022-02-20 14:04:19,146 INFO L290 TraceCheckUtils]: 71: Hoare triple {2092#false} main_~i~0#1 := 0; {2092#false} is VALID [2022-02-20 14:04:19,146 INFO L290 TraceCheckUtils]: 72: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:19,146 INFO L290 TraceCheckUtils]: 73: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:19,146 INFO L290 TraceCheckUtils]: 74: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:19,147 INFO L290 TraceCheckUtils]: 75: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:19,147 INFO L290 TraceCheckUtils]: 76: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:19,167 INFO L290 TraceCheckUtils]: 77: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:19,167 INFO L290 TraceCheckUtils]: 78: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:19,167 INFO L290 TraceCheckUtils]: 79: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:19,167 INFO L290 TraceCheckUtils]: 80: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:19,167 INFO L290 TraceCheckUtils]: 81: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:19,168 INFO L290 TraceCheckUtils]: 82: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:19,168 INFO L290 TraceCheckUtils]: 83: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:19,168 INFO L290 TraceCheckUtils]: 84: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:19,168 INFO L290 TraceCheckUtils]: 85: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:19,168 INFO L290 TraceCheckUtils]: 86: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:19,168 INFO L290 TraceCheckUtils]: 87: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:19,169 INFO L290 TraceCheckUtils]: 88: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:19,169 INFO L290 TraceCheckUtils]: 89: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:19,169 INFO L290 TraceCheckUtils]: 90: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:19,169 INFO L290 TraceCheckUtils]: 91: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:19,169 INFO L290 TraceCheckUtils]: 92: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:19,170 INFO L290 TraceCheckUtils]: 93: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:19,170 INFO L290 TraceCheckUtils]: 94: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:19,170 INFO L290 TraceCheckUtils]: 95: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:19,170 INFO L290 TraceCheckUtils]: 96: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:19,170 INFO L290 TraceCheckUtils]: 97: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:19,171 INFO L290 TraceCheckUtils]: 98: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:19,171 INFO L290 TraceCheckUtils]: 99: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:19,171 INFO L290 TraceCheckUtils]: 100: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:19,171 INFO L290 TraceCheckUtils]: 101: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:19,171 INFO L290 TraceCheckUtils]: 102: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:19,172 INFO L290 TraceCheckUtils]: 103: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:19,172 INFO L290 TraceCheckUtils]: 104: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:19,172 INFO L290 TraceCheckUtils]: 105: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:19,172 INFO L290 TraceCheckUtils]: 106: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:19,172 INFO L290 TraceCheckUtils]: 107: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:19,172 INFO L290 TraceCheckUtils]: 108: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:19,173 INFO L290 TraceCheckUtils]: 109: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:19,173 INFO L290 TraceCheckUtils]: 110: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:19,173 INFO L290 TraceCheckUtils]: 111: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:19,173 INFO L290 TraceCheckUtils]: 112: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:19,173 INFO L290 TraceCheckUtils]: 113: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:19,174 INFO L290 TraceCheckUtils]: 114: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:19,174 INFO L290 TraceCheckUtils]: 115: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:19,174 INFO L290 TraceCheckUtils]: 116: Hoare triple {2092#false} assume !(main_~i~0#1 < 100000); {2092#false} is VALID [2022-02-20 14:04:19,174 INFO L290 TraceCheckUtils]: 117: Hoare triple {2092#false} havoc main_~x~0#1;main_~x~0#1 := 0; {2092#false} is VALID [2022-02-20 14:04:19,174 INFO L290 TraceCheckUtils]: 118: Hoare triple {2092#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 == 42 + main_~incr~0#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:19,174 INFO L290 TraceCheckUtils]: 119: Hoare triple {2092#false} assume 0 == __VERIFIER_assert_~cond#1; {2092#false} is VALID [2022-02-20 14:04:19,175 INFO L290 TraceCheckUtils]: 120: Hoare triple {2092#false} assume !false; {2092#false} is VALID [2022-02-20 14:04:19,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2022-02-20 14:04:19,176 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:04:19,176 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690082185] [2022-02-20 14:04:19,176 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690082185] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:04:19,176 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943591352] [2022-02-20 14:04:19,177 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 14:04:19,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:04:19,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:04:19,178 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:19,186 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:19,345 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 14:04:19,346 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:04:19,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-20 14:04:19,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:04:19,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:04:19,798 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(30, 2); {2091#true} is VALID [2022-02-20 14:04:19,799 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~nondet1#1, main_#t~mem3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~incr~0#1, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~incr~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {2091#true} is VALID [2022-02-20 14:04:19,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2091#true} is VALID [2022-02-20 14:04:19,799 INFO L290 TraceCheckUtils]: 3: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2091#true} is VALID [2022-02-20 14:04:19,799 INFO L290 TraceCheckUtils]: 4: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2091#true} is VALID [2022-02-20 14:04:19,799 INFO L290 TraceCheckUtils]: 5: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2091#true} is VALID [2022-02-20 14:04:19,799 INFO L290 TraceCheckUtils]: 6: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2091#true} is VALID [2022-02-20 14:04:19,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2091#true} is VALID [2022-02-20 14:04:19,799 INFO L290 TraceCheckUtils]: 8: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2091#true} is VALID [2022-02-20 14:04:19,799 INFO L290 TraceCheckUtils]: 9: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2091#true} is VALID [2022-02-20 14:04:19,799 INFO L290 TraceCheckUtils]: 10: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2091#true} is VALID [2022-02-20 14:04:19,799 INFO L290 TraceCheckUtils]: 11: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2091#true} is VALID [2022-02-20 14:04:19,799 INFO L290 TraceCheckUtils]: 12: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2091#true} is VALID [2022-02-20 14:04:19,799 INFO L290 TraceCheckUtils]: 13: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2091#true} is VALID [2022-02-20 14:04:19,799 INFO L290 TraceCheckUtils]: 14: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2091#true} is VALID [2022-02-20 14:04:19,800 INFO L290 TraceCheckUtils]: 15: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2091#true} is VALID [2022-02-20 14:04:19,800 INFO L290 TraceCheckUtils]: 16: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2091#true} is VALID [2022-02-20 14:04:19,800 INFO L290 TraceCheckUtils]: 17: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2091#true} is VALID [2022-02-20 14:04:19,800 INFO L290 TraceCheckUtils]: 18: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2091#true} is VALID [2022-02-20 14:04:19,800 INFO L290 TraceCheckUtils]: 19: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2091#true} is VALID [2022-02-20 14:04:19,800 INFO L290 TraceCheckUtils]: 20: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2091#true} is VALID [2022-02-20 14:04:19,800 INFO L290 TraceCheckUtils]: 21: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2091#true} is VALID [2022-02-20 14:04:19,800 INFO L290 TraceCheckUtils]: 22: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2091#true} is VALID [2022-02-20 14:04:19,800 INFO L290 TraceCheckUtils]: 23: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2091#true} is VALID [2022-02-20 14:04:19,800 INFO L290 TraceCheckUtils]: 24: Hoare triple {2091#true} assume !(main_~i~0#1 < 100000); {2091#true} is VALID [2022-02-20 14:04:19,801 INFO L290 TraceCheckUtils]: 25: Hoare triple {2091#true} main_~i~0#1 := 0; {2194#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:04:19,801 INFO L290 TraceCheckUtils]: 26: Hoare triple {2194#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2194#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:04:19,801 INFO L290 TraceCheckUtils]: 27: Hoare triple {2194#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2094#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:04:19,802 INFO L290 TraceCheckUtils]: 28: Hoare triple {2094#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2094#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:04:19,802 INFO L290 TraceCheckUtils]: 29: Hoare triple {2094#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2095#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:04:19,802 INFO L290 TraceCheckUtils]: 30: Hoare triple {2095#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2095#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:04:19,803 INFO L290 TraceCheckUtils]: 31: Hoare triple {2095#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2096#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:04:19,803 INFO L290 TraceCheckUtils]: 32: Hoare triple {2096#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2096#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:04:19,803 INFO L290 TraceCheckUtils]: 33: Hoare triple {2096#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2097#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:04:19,804 INFO L290 TraceCheckUtils]: 34: Hoare triple {2097#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2097#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:04:19,804 INFO L290 TraceCheckUtils]: 35: Hoare triple {2097#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2098#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:04:19,804 INFO L290 TraceCheckUtils]: 36: Hoare triple {2098#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2098#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:04:19,805 INFO L290 TraceCheckUtils]: 37: Hoare triple {2098#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2099#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:04:19,805 INFO L290 TraceCheckUtils]: 38: Hoare triple {2099#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2099#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:04:19,806 INFO L290 TraceCheckUtils]: 39: Hoare triple {2099#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2100#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:04:19,806 INFO L290 TraceCheckUtils]: 40: Hoare triple {2100#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2100#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:04:19,806 INFO L290 TraceCheckUtils]: 41: Hoare triple {2100#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2101#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:04:19,807 INFO L290 TraceCheckUtils]: 42: Hoare triple {2101#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2101#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:04:19,807 INFO L290 TraceCheckUtils]: 43: Hoare triple {2101#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2102#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:04:19,807 INFO L290 TraceCheckUtils]: 44: Hoare triple {2102#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2102#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:04:19,808 INFO L290 TraceCheckUtils]: 45: Hoare triple {2102#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2103#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:04:19,808 INFO L290 TraceCheckUtils]: 46: Hoare triple {2103#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2103#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:04:19,808 INFO L290 TraceCheckUtils]: 47: Hoare triple {2103#(<= |ULTIMATE.start_main_~i~0#1| 10)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2104#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:04:19,809 INFO L290 TraceCheckUtils]: 48: Hoare triple {2104#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2104#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:04:19,810 INFO L290 TraceCheckUtils]: 49: Hoare triple {2104#(<= |ULTIMATE.start_main_~i~0#1| 11)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2105#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:04:19,810 INFO L290 TraceCheckUtils]: 50: Hoare triple {2105#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2105#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:04:19,812 INFO L290 TraceCheckUtils]: 51: Hoare triple {2105#(<= |ULTIMATE.start_main_~i~0#1| 12)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2106#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:04:19,817 INFO L290 TraceCheckUtils]: 52: Hoare triple {2106#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2106#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:04:19,818 INFO L290 TraceCheckUtils]: 53: Hoare triple {2106#(<= |ULTIMATE.start_main_~i~0#1| 13)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2107#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:04:19,818 INFO L290 TraceCheckUtils]: 54: Hoare triple {2107#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2107#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:04:19,819 INFO L290 TraceCheckUtils]: 55: Hoare triple {2107#(<= |ULTIMATE.start_main_~i~0#1| 14)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2108#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:04:19,819 INFO L290 TraceCheckUtils]: 56: Hoare triple {2108#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2108#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:04:19,819 INFO L290 TraceCheckUtils]: 57: Hoare triple {2108#(<= |ULTIMATE.start_main_~i~0#1| 15)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2109#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:04:19,820 INFO L290 TraceCheckUtils]: 58: Hoare triple {2109#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2109#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:04:19,820 INFO L290 TraceCheckUtils]: 59: Hoare triple {2109#(<= |ULTIMATE.start_main_~i~0#1| 16)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2110#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:04:19,820 INFO L290 TraceCheckUtils]: 60: Hoare triple {2110#(<= |ULTIMATE.start_main_~i~0#1| 17)} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2110#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:04:19,821 INFO L290 TraceCheckUtils]: 61: Hoare triple {2110#(<= |ULTIMATE.start_main_~i~0#1| 17)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2111#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:04:19,821 INFO L290 TraceCheckUtils]: 62: Hoare triple {2111#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2111#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:04:19,821 INFO L290 TraceCheckUtils]: 63: Hoare triple {2111#(<= |ULTIMATE.start_main_~i~0#1| 18)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2112#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:04:19,822 INFO L290 TraceCheckUtils]: 64: Hoare triple {2112#(<= |ULTIMATE.start_main_~i~0#1| 19)} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2112#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:04:19,822 INFO L290 TraceCheckUtils]: 65: Hoare triple {2112#(<= |ULTIMATE.start_main_~i~0#1| 19)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2113#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:04:19,822 INFO L290 TraceCheckUtils]: 66: Hoare triple {2113#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2113#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:04:19,823 INFO L290 TraceCheckUtils]: 67: Hoare triple {2113#(<= |ULTIMATE.start_main_~i~0#1| 20)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2114#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:04:19,823 INFO L290 TraceCheckUtils]: 68: Hoare triple {2114#(<= |ULTIMATE.start_main_~i~0#1| 21)} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2114#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:04:19,823 INFO L290 TraceCheckUtils]: 69: Hoare triple {2114#(<= |ULTIMATE.start_main_~i~0#1| 21)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2115#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 14:04:19,824 INFO L290 TraceCheckUtils]: 70: Hoare triple {2115#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !(main_~i~0#1 < 100000); {2092#false} is VALID [2022-02-20 14:04:19,824 INFO L290 TraceCheckUtils]: 71: Hoare triple {2092#false} main_~i~0#1 := 0; {2092#false} is VALID [2022-02-20 14:04:19,824 INFO L290 TraceCheckUtils]: 72: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:19,824 INFO L290 TraceCheckUtils]: 73: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:19,824 INFO L290 TraceCheckUtils]: 74: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:19,824 INFO L290 TraceCheckUtils]: 75: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:19,824 INFO L290 TraceCheckUtils]: 76: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:19,824 INFO L290 TraceCheckUtils]: 77: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:19,824 INFO L290 TraceCheckUtils]: 78: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:19,824 INFO L290 TraceCheckUtils]: 79: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:19,824 INFO L290 TraceCheckUtils]: 80: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:19,825 INFO L290 TraceCheckUtils]: 81: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:19,825 INFO L290 TraceCheckUtils]: 82: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:19,825 INFO L290 TraceCheckUtils]: 83: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:19,825 INFO L290 TraceCheckUtils]: 84: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:19,825 INFO L290 TraceCheckUtils]: 85: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:19,825 INFO L290 TraceCheckUtils]: 86: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:19,825 INFO L290 TraceCheckUtils]: 87: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:19,825 INFO L290 TraceCheckUtils]: 88: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:19,825 INFO L290 TraceCheckUtils]: 89: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:19,825 INFO L290 TraceCheckUtils]: 90: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:19,825 INFO L290 TraceCheckUtils]: 91: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:19,825 INFO L290 TraceCheckUtils]: 92: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:19,825 INFO L290 TraceCheckUtils]: 93: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:19,825 INFO L290 TraceCheckUtils]: 94: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:19,825 INFO L290 TraceCheckUtils]: 95: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:19,825 INFO L290 TraceCheckUtils]: 96: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:19,826 INFO L290 TraceCheckUtils]: 97: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:19,826 INFO L290 TraceCheckUtils]: 98: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:19,826 INFO L290 TraceCheckUtils]: 99: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:19,826 INFO L290 TraceCheckUtils]: 100: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:19,826 INFO L290 TraceCheckUtils]: 101: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:19,826 INFO L290 TraceCheckUtils]: 102: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:19,826 INFO L290 TraceCheckUtils]: 103: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:19,826 INFO L290 TraceCheckUtils]: 104: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:19,826 INFO L290 TraceCheckUtils]: 105: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:19,826 INFO L290 TraceCheckUtils]: 106: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:19,826 INFO L290 TraceCheckUtils]: 107: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:19,826 INFO L290 TraceCheckUtils]: 108: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:19,826 INFO L290 TraceCheckUtils]: 109: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:19,826 INFO L290 TraceCheckUtils]: 110: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:19,826 INFO L290 TraceCheckUtils]: 111: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:19,827 INFO L290 TraceCheckUtils]: 112: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:19,827 INFO L290 TraceCheckUtils]: 113: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:19,827 INFO L290 TraceCheckUtils]: 114: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:19,827 INFO L290 TraceCheckUtils]: 115: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:19,827 INFO L290 TraceCheckUtils]: 116: Hoare triple {2092#false} assume !(main_~i~0#1 < 100000); {2092#false} is VALID [2022-02-20 14:04:19,827 INFO L290 TraceCheckUtils]: 117: Hoare triple {2092#false} havoc main_~x~0#1;main_~x~0#1 := 0; {2092#false} is VALID [2022-02-20 14:04:19,827 INFO L290 TraceCheckUtils]: 118: Hoare triple {2092#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 == 42 + main_~incr~0#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:19,827 INFO L290 TraceCheckUtils]: 119: Hoare triple {2092#false} assume 0 == __VERIFIER_assert_~cond#1; {2092#false} is VALID [2022-02-20 14:04:19,827 INFO L290 TraceCheckUtils]: 120: Hoare triple {2092#false} assume !false; {2092#false} is VALID [2022-02-20 14:04:19,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2022-02-20 14:04:19,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:04:20,753 INFO L290 TraceCheckUtils]: 120: Hoare triple {2092#false} assume !false; {2092#false} is VALID [2022-02-20 14:04:20,753 INFO L290 TraceCheckUtils]: 119: Hoare triple {2092#false} assume 0 == __VERIFIER_assert_~cond#1; {2092#false} is VALID [2022-02-20 14:04:20,753 INFO L290 TraceCheckUtils]: 118: Hoare triple {2092#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 == 42 + main_~incr~0#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:20,753 INFO L290 TraceCheckUtils]: 117: Hoare triple {2092#false} havoc main_~x~0#1;main_~x~0#1 := 0; {2092#false} is VALID [2022-02-20 14:04:20,753 INFO L290 TraceCheckUtils]: 116: Hoare triple {2092#false} assume !(main_~i~0#1 < 100000); {2092#false} is VALID [2022-02-20 14:04:20,754 INFO L290 TraceCheckUtils]: 115: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:20,754 INFO L290 TraceCheckUtils]: 114: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:20,754 INFO L290 TraceCheckUtils]: 113: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:20,754 INFO L290 TraceCheckUtils]: 112: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:20,754 INFO L290 TraceCheckUtils]: 111: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:20,754 INFO L290 TraceCheckUtils]: 110: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:20,754 INFO L290 TraceCheckUtils]: 109: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:20,755 INFO L290 TraceCheckUtils]: 108: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:20,755 INFO L290 TraceCheckUtils]: 107: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:20,755 INFO L290 TraceCheckUtils]: 106: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:20,755 INFO L290 TraceCheckUtils]: 105: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:20,755 INFO L290 TraceCheckUtils]: 104: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:20,755 INFO L290 TraceCheckUtils]: 103: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:20,756 INFO L290 TraceCheckUtils]: 102: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:20,756 INFO L290 TraceCheckUtils]: 101: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:20,756 INFO L290 TraceCheckUtils]: 100: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:20,756 INFO L290 TraceCheckUtils]: 99: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:20,756 INFO L290 TraceCheckUtils]: 98: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:20,756 INFO L290 TraceCheckUtils]: 97: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:20,756 INFO L290 TraceCheckUtils]: 96: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:20,757 INFO L290 TraceCheckUtils]: 95: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:20,757 INFO L290 TraceCheckUtils]: 94: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:20,757 INFO L290 TraceCheckUtils]: 93: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:20,757 INFO L290 TraceCheckUtils]: 92: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:20,757 INFO L290 TraceCheckUtils]: 91: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:20,757 INFO L290 TraceCheckUtils]: 90: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:20,758 INFO L290 TraceCheckUtils]: 89: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:20,758 INFO L290 TraceCheckUtils]: 88: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:20,758 INFO L290 TraceCheckUtils]: 87: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:20,758 INFO L290 TraceCheckUtils]: 86: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:20,758 INFO L290 TraceCheckUtils]: 85: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:20,758 INFO L290 TraceCheckUtils]: 84: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:20,759 INFO L290 TraceCheckUtils]: 83: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:20,759 INFO L290 TraceCheckUtils]: 82: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:20,759 INFO L290 TraceCheckUtils]: 81: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:20,759 INFO L290 TraceCheckUtils]: 80: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:20,759 INFO L290 TraceCheckUtils]: 79: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:20,759 INFO L290 TraceCheckUtils]: 78: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:20,759 INFO L290 TraceCheckUtils]: 77: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:20,760 INFO L290 TraceCheckUtils]: 76: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:20,760 INFO L290 TraceCheckUtils]: 75: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:20,760 INFO L290 TraceCheckUtils]: 74: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:20,760 INFO L290 TraceCheckUtils]: 73: Hoare triple {2092#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2092#false} is VALID [2022-02-20 14:04:20,760 INFO L290 TraceCheckUtils]: 72: Hoare triple {2092#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {2092#false} is VALID [2022-02-20 14:04:20,760 INFO L290 TraceCheckUtils]: 71: Hoare triple {2092#false} main_~i~0#1 := 0; {2092#false} is VALID [2022-02-20 14:04:20,761 INFO L290 TraceCheckUtils]: 70: Hoare triple {2630#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {2092#false} is VALID [2022-02-20 14:04:20,761 INFO L290 TraceCheckUtils]: 69: Hoare triple {2634#(< |ULTIMATE.start_main_~i~0#1| 99999)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2630#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:04:20,762 INFO L290 TraceCheckUtils]: 68: Hoare triple {2634#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2634#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:04:20,762 INFO L290 TraceCheckUtils]: 67: Hoare triple {2641#(< |ULTIMATE.start_main_~i~0#1| 99998)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2634#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:04:20,763 INFO L290 TraceCheckUtils]: 66: Hoare triple {2641#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2641#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:04:20,763 INFO L290 TraceCheckUtils]: 65: Hoare triple {2648#(< |ULTIMATE.start_main_~i~0#1| 99997)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2641#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:04:20,763 INFO L290 TraceCheckUtils]: 64: Hoare triple {2648#(< |ULTIMATE.start_main_~i~0#1| 99997)} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2648#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:04:20,764 INFO L290 TraceCheckUtils]: 63: Hoare triple {2655#(< |ULTIMATE.start_main_~i~0#1| 99996)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2648#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:04:20,764 INFO L290 TraceCheckUtils]: 62: Hoare triple {2655#(< |ULTIMATE.start_main_~i~0#1| 99996)} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2655#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:04:20,765 INFO L290 TraceCheckUtils]: 61: Hoare triple {2662#(< |ULTIMATE.start_main_~i~0#1| 99995)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2655#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:04:20,765 INFO L290 TraceCheckUtils]: 60: Hoare triple {2662#(< |ULTIMATE.start_main_~i~0#1| 99995)} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2662#(< |ULTIMATE.start_main_~i~0#1| 99995)} is VALID [2022-02-20 14:04:20,765 INFO L290 TraceCheckUtils]: 59: Hoare triple {2669#(< |ULTIMATE.start_main_~i~0#1| 99994)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2662#(< |ULTIMATE.start_main_~i~0#1| 99995)} is VALID [2022-02-20 14:04:20,766 INFO L290 TraceCheckUtils]: 58: Hoare triple {2669#(< |ULTIMATE.start_main_~i~0#1| 99994)} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2669#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-20 14:04:20,766 INFO L290 TraceCheckUtils]: 57: Hoare triple {2676#(< |ULTIMATE.start_main_~i~0#1| 99993)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2669#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-20 14:04:20,767 INFO L290 TraceCheckUtils]: 56: Hoare triple {2676#(< |ULTIMATE.start_main_~i~0#1| 99993)} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2676#(< |ULTIMATE.start_main_~i~0#1| 99993)} is VALID [2022-02-20 14:04:20,767 INFO L290 TraceCheckUtils]: 55: Hoare triple {2683#(< |ULTIMATE.start_main_~i~0#1| 99992)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2676#(< |ULTIMATE.start_main_~i~0#1| 99993)} is VALID [2022-02-20 14:04:20,767 INFO L290 TraceCheckUtils]: 54: Hoare triple {2683#(< |ULTIMATE.start_main_~i~0#1| 99992)} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2683#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-20 14:04:20,768 INFO L290 TraceCheckUtils]: 53: Hoare triple {2690#(< |ULTIMATE.start_main_~i~0#1| 99991)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2683#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-20 14:04:20,768 INFO L290 TraceCheckUtils]: 52: Hoare triple {2690#(< |ULTIMATE.start_main_~i~0#1| 99991)} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2690#(< |ULTIMATE.start_main_~i~0#1| 99991)} is VALID [2022-02-20 14:04:20,768 INFO L290 TraceCheckUtils]: 51: Hoare triple {2697#(< |ULTIMATE.start_main_~i~0#1| 99990)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2690#(< |ULTIMATE.start_main_~i~0#1| 99991)} is VALID [2022-02-20 14:04:20,769 INFO L290 TraceCheckUtils]: 50: Hoare triple {2697#(< |ULTIMATE.start_main_~i~0#1| 99990)} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2697#(< |ULTIMATE.start_main_~i~0#1| 99990)} is VALID [2022-02-20 14:04:20,769 INFO L290 TraceCheckUtils]: 49: Hoare triple {2704#(< |ULTIMATE.start_main_~i~0#1| 99989)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2697#(< |ULTIMATE.start_main_~i~0#1| 99990)} is VALID [2022-02-20 14:04:20,770 INFO L290 TraceCheckUtils]: 48: Hoare triple {2704#(< |ULTIMATE.start_main_~i~0#1| 99989)} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2704#(< |ULTIMATE.start_main_~i~0#1| 99989)} is VALID [2022-02-20 14:04:20,770 INFO L290 TraceCheckUtils]: 47: Hoare triple {2711#(< |ULTIMATE.start_main_~i~0#1| 99988)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2704#(< |ULTIMATE.start_main_~i~0#1| 99989)} is VALID [2022-02-20 14:04:20,770 INFO L290 TraceCheckUtils]: 46: Hoare triple {2711#(< |ULTIMATE.start_main_~i~0#1| 99988)} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2711#(< |ULTIMATE.start_main_~i~0#1| 99988)} is VALID [2022-02-20 14:04:20,771 INFO L290 TraceCheckUtils]: 45: Hoare triple {2718#(< |ULTIMATE.start_main_~i~0#1| 99987)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2711#(< |ULTIMATE.start_main_~i~0#1| 99988)} is VALID [2022-02-20 14:04:20,771 INFO L290 TraceCheckUtils]: 44: Hoare triple {2718#(< |ULTIMATE.start_main_~i~0#1| 99987)} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2718#(< |ULTIMATE.start_main_~i~0#1| 99987)} is VALID [2022-02-20 14:04:20,772 INFO L290 TraceCheckUtils]: 43: Hoare triple {2725#(< |ULTIMATE.start_main_~i~0#1| 99986)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2718#(< |ULTIMATE.start_main_~i~0#1| 99987)} is VALID [2022-02-20 14:04:20,772 INFO L290 TraceCheckUtils]: 42: Hoare triple {2725#(< |ULTIMATE.start_main_~i~0#1| 99986)} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2725#(< |ULTIMATE.start_main_~i~0#1| 99986)} is VALID [2022-02-20 14:04:20,772 INFO L290 TraceCheckUtils]: 41: Hoare triple {2732#(< |ULTIMATE.start_main_~i~0#1| 99985)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2725#(< |ULTIMATE.start_main_~i~0#1| 99986)} is VALID [2022-02-20 14:04:20,773 INFO L290 TraceCheckUtils]: 40: Hoare triple {2732#(< |ULTIMATE.start_main_~i~0#1| 99985)} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2732#(< |ULTIMATE.start_main_~i~0#1| 99985)} is VALID [2022-02-20 14:04:20,773 INFO L290 TraceCheckUtils]: 39: Hoare triple {2739#(< |ULTIMATE.start_main_~i~0#1| 99984)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2732#(< |ULTIMATE.start_main_~i~0#1| 99985)} is VALID [2022-02-20 14:04:20,773 INFO L290 TraceCheckUtils]: 38: Hoare triple {2739#(< |ULTIMATE.start_main_~i~0#1| 99984)} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2739#(< |ULTIMATE.start_main_~i~0#1| 99984)} is VALID [2022-02-20 14:04:20,774 INFO L290 TraceCheckUtils]: 37: Hoare triple {2746#(< |ULTIMATE.start_main_~i~0#1| 99983)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2739#(< |ULTIMATE.start_main_~i~0#1| 99984)} is VALID [2022-02-20 14:04:20,774 INFO L290 TraceCheckUtils]: 36: Hoare triple {2746#(< |ULTIMATE.start_main_~i~0#1| 99983)} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2746#(< |ULTIMATE.start_main_~i~0#1| 99983)} is VALID [2022-02-20 14:04:20,775 INFO L290 TraceCheckUtils]: 35: Hoare triple {2753#(< |ULTIMATE.start_main_~i~0#1| 99982)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2746#(< |ULTIMATE.start_main_~i~0#1| 99983)} is VALID [2022-02-20 14:04:20,775 INFO L290 TraceCheckUtils]: 34: Hoare triple {2753#(< |ULTIMATE.start_main_~i~0#1| 99982)} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2753#(< |ULTIMATE.start_main_~i~0#1| 99982)} is VALID [2022-02-20 14:04:20,776 INFO L290 TraceCheckUtils]: 33: Hoare triple {2760#(< |ULTIMATE.start_main_~i~0#1| 99981)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2753#(< |ULTIMATE.start_main_~i~0#1| 99982)} is VALID [2022-02-20 14:04:20,776 INFO L290 TraceCheckUtils]: 32: Hoare triple {2760#(< |ULTIMATE.start_main_~i~0#1| 99981)} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2760#(< |ULTIMATE.start_main_~i~0#1| 99981)} is VALID [2022-02-20 14:04:20,776 INFO L290 TraceCheckUtils]: 31: Hoare triple {2767#(< |ULTIMATE.start_main_~i~0#1| 99980)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2760#(< |ULTIMATE.start_main_~i~0#1| 99981)} is VALID [2022-02-20 14:04:20,777 INFO L290 TraceCheckUtils]: 30: Hoare triple {2767#(< |ULTIMATE.start_main_~i~0#1| 99980)} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2767#(< |ULTIMATE.start_main_~i~0#1| 99980)} is VALID [2022-02-20 14:04:20,777 INFO L290 TraceCheckUtils]: 29: Hoare triple {2774#(< |ULTIMATE.start_main_~i~0#1| 99979)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2767#(< |ULTIMATE.start_main_~i~0#1| 99980)} is VALID [2022-02-20 14:04:20,778 INFO L290 TraceCheckUtils]: 28: Hoare triple {2774#(< |ULTIMATE.start_main_~i~0#1| 99979)} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2774#(< |ULTIMATE.start_main_~i~0#1| 99979)} is VALID [2022-02-20 14:04:20,778 INFO L290 TraceCheckUtils]: 27: Hoare triple {2781#(< |ULTIMATE.start_main_~i~0#1| 99978)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2774#(< |ULTIMATE.start_main_~i~0#1| 99979)} is VALID [2022-02-20 14:04:20,778 INFO L290 TraceCheckUtils]: 26: Hoare triple {2781#(< |ULTIMATE.start_main_~i~0#1| 99978)} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {2781#(< |ULTIMATE.start_main_~i~0#1| 99978)} is VALID [2022-02-20 14:04:20,779 INFO L290 TraceCheckUtils]: 25: Hoare triple {2091#true} main_~i~0#1 := 0; {2781#(< |ULTIMATE.start_main_~i~0#1| 99978)} is VALID [2022-02-20 14:04:20,779 INFO L290 TraceCheckUtils]: 24: Hoare triple {2091#true} assume !(main_~i~0#1 < 100000); {2091#true} is VALID [2022-02-20 14:04:20,779 INFO L290 TraceCheckUtils]: 23: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2091#true} is VALID [2022-02-20 14:04:20,779 INFO L290 TraceCheckUtils]: 22: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2091#true} is VALID [2022-02-20 14:04:20,779 INFO L290 TraceCheckUtils]: 21: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2091#true} is VALID [2022-02-20 14:04:20,780 INFO L290 TraceCheckUtils]: 20: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2091#true} is VALID [2022-02-20 14:04:20,780 INFO L290 TraceCheckUtils]: 19: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2091#true} is VALID [2022-02-20 14:04:20,780 INFO L290 TraceCheckUtils]: 18: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2091#true} is VALID [2022-02-20 14:04:20,781 INFO L290 TraceCheckUtils]: 17: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2091#true} is VALID [2022-02-20 14:04:20,781 INFO L290 TraceCheckUtils]: 16: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2091#true} is VALID [2022-02-20 14:04:20,781 INFO L290 TraceCheckUtils]: 15: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2091#true} is VALID [2022-02-20 14:04:20,781 INFO L290 TraceCheckUtils]: 14: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2091#true} is VALID [2022-02-20 14:04:20,781 INFO L290 TraceCheckUtils]: 13: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2091#true} is VALID [2022-02-20 14:04:20,781 INFO L290 TraceCheckUtils]: 12: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2091#true} is VALID [2022-02-20 14:04:20,782 INFO L290 TraceCheckUtils]: 11: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2091#true} is VALID [2022-02-20 14:04:20,782 INFO L290 TraceCheckUtils]: 10: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2091#true} is VALID [2022-02-20 14:04:20,782 INFO L290 TraceCheckUtils]: 9: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2091#true} is VALID [2022-02-20 14:04:20,782 INFO L290 TraceCheckUtils]: 8: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2091#true} is VALID [2022-02-20 14:04:20,782 INFO L290 TraceCheckUtils]: 7: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2091#true} is VALID [2022-02-20 14:04:20,782 INFO L290 TraceCheckUtils]: 6: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2091#true} is VALID [2022-02-20 14:04:20,782 INFO L290 TraceCheckUtils]: 5: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2091#true} is VALID [2022-02-20 14:04:20,783 INFO L290 TraceCheckUtils]: 4: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2091#true} is VALID [2022-02-20 14:04:20,783 INFO L290 TraceCheckUtils]: 3: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2091#true} is VALID [2022-02-20 14:04:20,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {2091#true} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {2091#true} is VALID [2022-02-20 14:04:20,783 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~nondet1#1, main_#t~mem3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~incr~0#1, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~incr~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {2091#true} is VALID [2022-02-20 14:04:20,783 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(30, 2); {2091#true} is VALID [2022-02-20 14:04:20,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2022-02-20 14:04:20,784 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943591352] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:04:20,785 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:04:20,785 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2022-02-20 14:04:20,785 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417457583] [2022-02-20 14:04:20,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:04:20,786 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.693877551020408) internal successors, (132), 49 states have internal predecessors, (132), 0 states have call successors, (0), 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 121 [2022-02-20 14:04:20,787 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:04:20,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 49 states, 49 states have (on average 2.693877551020408) internal successors, (132), 49 states have internal predecessors, (132), 0 states have call successors, (0), 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:20,878 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:04:20,879 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-02-20 14:04:20,879 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:04:20,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-02-20 14:04:20,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-02-20 14:04:20,881 INFO L87 Difference]: Start difference. First operand 124 states and 127 transitions. Second operand has 49 states, 49 states have (on average 2.693877551020408) internal successors, (132), 49 states have internal predecessors, (132), 0 states have call successors, (0), 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:21,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:21,715 INFO L93 Difference]: Finished difference Result 343 states and 420 transitions. [2022-02-20 14:04:21,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-02-20 14:04:21,716 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.693877551020408) internal successors, (132), 49 states have internal predecessors, (132), 0 states have call successors, (0), 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 121 [2022-02-20 14:04:21,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:04:21,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 2.693877551020408) internal successors, (132), 49 states have internal predecessors, (132), 0 states have call successors, (0), 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:21,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 334 transitions. [2022-02-20 14:04:21,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 2.693877551020408) internal successors, (132), 49 states have internal predecessors, (132), 0 states have call successors, (0), 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:21,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 334 transitions. [2022-02-20 14:04:21,725 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 334 transitions. [2022-02-20 14:04:21,948 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 334 edges. 334 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:04:21,964 INFO L225 Difference]: With dead ends: 343 [2022-02-20 14:04:21,964 INFO L226 Difference]: Without dead ends: 244 [2022-02-20 14:04:21,966 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-02-20 14:04:21,968 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 195 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 305 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 305 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 14:04:21,968 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 46 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [305 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 14:04:21,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-02-20 14:04:22,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2022-02-20 14:04:22,066 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:04:22,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 244 states. Second operand has 244 states, 243 states have (on average 1.0164609053497942) internal successors, (247), 243 states have internal predecessors, (247), 0 states have call successors, (0), 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:22,068 INFO L74 IsIncluded]: Start isIncluded. First operand 244 states. Second operand has 244 states, 243 states have (on average 1.0164609053497942) internal successors, (247), 243 states have internal predecessors, (247), 0 states have call successors, (0), 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:22,068 INFO L87 Difference]: Start difference. First operand 244 states. Second operand has 244 states, 243 states have (on average 1.0164609053497942) internal successors, (247), 243 states have internal predecessors, (247), 0 states have call successors, (0), 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:22,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:22,075 INFO L93 Difference]: Finished difference Result 244 states and 247 transitions. [2022-02-20 14:04:22,075 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 247 transitions. [2022-02-20 14:04:22,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:04:22,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:04:22,077 INFO L74 IsIncluded]: Start isIncluded. First operand has 244 states, 243 states have (on average 1.0164609053497942) internal successors, (247), 243 states have internal predecessors, (247), 0 states have call successors, (0), 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 244 states. [2022-02-20 14:04:22,077 INFO L87 Difference]: Start difference. First operand has 244 states, 243 states have (on average 1.0164609053497942) internal successors, (247), 243 states have internal predecessors, (247), 0 states have call successors, (0), 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 244 states. [2022-02-20 14:04:22,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:04:22,084 INFO L93 Difference]: Finished difference Result 244 states and 247 transitions. [2022-02-20 14:04:22,084 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 247 transitions. [2022-02-20 14:04:22,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:04:22,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:04:22,085 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:04:22,085 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:04:22,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 1.0164609053497942) internal successors, (247), 243 states have internal predecessors, (247), 0 states have call successors, (0), 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:22,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 247 transitions. [2022-02-20 14:04:22,093 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 247 transitions. Word has length 121 [2022-02-20 14:04:22,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:04:22,099 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 247 transitions. [2022-02-20 14:04:22,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.693877551020408) internal successors, (132), 49 states have internal predecessors, (132), 0 states have call successors, (0), 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:22,100 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 247 transitions. [2022-02-20 14:04:22,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2022-02-20 14:04:22,107 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:04:22,108 INFO L514 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:04:22,133 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:22,321 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:22,321 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:04:22,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:04:22,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1689532612, now seen corresponding path program 5 times [2022-02-20 14:04:22,322 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:04:22,322 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816395604] [2022-02-20 14:04:22,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:04:22,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:04:22,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:04:23,510 INFO L290 TraceCheckUtils]: 0: Hoare triple {4268#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(30, 2); {4268#true} is VALID [2022-02-20 14:04:23,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {4268#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post6#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~incr~0#1, main_~i~0#1, main_~x~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~incr~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {4270#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:04:23,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {4270#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4271#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:04:23,512 INFO L290 TraceCheckUtils]: 3: Hoare triple {4271#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4272#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:04:23,513 INFO L290 TraceCheckUtils]: 4: Hoare triple {4272#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4273#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:04:23,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {4273#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4274#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:04:23,514 INFO L290 TraceCheckUtils]: 6: Hoare triple {4274#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4275#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:04:23,515 INFO L290 TraceCheckUtils]: 7: Hoare triple {4275#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4276#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:04:23,515 INFO L290 TraceCheckUtils]: 8: Hoare triple {4276#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4277#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:04:23,516 INFO L290 TraceCheckUtils]: 9: Hoare triple {4277#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4278#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:04:23,517 INFO L290 TraceCheckUtils]: 10: Hoare triple {4278#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4279#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:04:23,517 INFO L290 TraceCheckUtils]: 11: Hoare triple {4279#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4280#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:04:23,518 INFO L290 TraceCheckUtils]: 12: Hoare triple {4280#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4281#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:04:23,518 INFO L290 TraceCheckUtils]: 13: Hoare triple {4281#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4282#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:04:23,519 INFO L290 TraceCheckUtils]: 14: Hoare triple {4282#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4283#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:04:23,520 INFO L290 TraceCheckUtils]: 15: Hoare triple {4283#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4284#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:04:23,520 INFO L290 TraceCheckUtils]: 16: Hoare triple {4284#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4285#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:04:23,521 INFO L290 TraceCheckUtils]: 17: Hoare triple {4285#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4286#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:04:23,522 INFO L290 TraceCheckUtils]: 18: Hoare triple {4286#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4287#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:04:23,522 INFO L290 TraceCheckUtils]: 19: Hoare triple {4287#(<= |ULTIMATE.start_main_~i~0#1| 17)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4288#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:04:23,523 INFO L290 TraceCheckUtils]: 20: Hoare triple {4288#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4289#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:04:23,523 INFO L290 TraceCheckUtils]: 21: Hoare triple {4289#(<= |ULTIMATE.start_main_~i~0#1| 19)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4290#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:04:23,524 INFO L290 TraceCheckUtils]: 22: Hoare triple {4290#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4291#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:04:23,525 INFO L290 TraceCheckUtils]: 23: Hoare triple {4291#(<= |ULTIMATE.start_main_~i~0#1| 21)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4292#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 14:04:23,525 INFO L290 TraceCheckUtils]: 24: Hoare triple {4292#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4293#(<= |ULTIMATE.start_main_~i~0#1| 23)} is VALID [2022-02-20 14:04:23,526 INFO L290 TraceCheckUtils]: 25: Hoare triple {4293#(<= |ULTIMATE.start_main_~i~0#1| 23)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4294#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-20 14:04:23,526 INFO L290 TraceCheckUtils]: 26: Hoare triple {4294#(<= |ULTIMATE.start_main_~i~0#1| 24)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4295#(<= |ULTIMATE.start_main_~i~0#1| 25)} is VALID [2022-02-20 14:04:23,527 INFO L290 TraceCheckUtils]: 27: Hoare triple {4295#(<= |ULTIMATE.start_main_~i~0#1| 25)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4296#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-20 14:04:23,528 INFO L290 TraceCheckUtils]: 28: Hoare triple {4296#(<= |ULTIMATE.start_main_~i~0#1| 26)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4297#(<= |ULTIMATE.start_main_~i~0#1| 27)} is VALID [2022-02-20 14:04:23,528 INFO L290 TraceCheckUtils]: 29: Hoare triple {4297#(<= |ULTIMATE.start_main_~i~0#1| 27)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4298#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-20 14:04:23,529 INFO L290 TraceCheckUtils]: 30: Hoare triple {4298#(<= |ULTIMATE.start_main_~i~0#1| 28)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4299#(<= |ULTIMATE.start_main_~i~0#1| 29)} is VALID [2022-02-20 14:04:23,530 INFO L290 TraceCheckUtils]: 31: Hoare triple {4299#(<= |ULTIMATE.start_main_~i~0#1| 29)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4300#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-20 14:04:23,530 INFO L290 TraceCheckUtils]: 32: Hoare triple {4300#(<= |ULTIMATE.start_main_~i~0#1| 30)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4301#(<= |ULTIMATE.start_main_~i~0#1| 31)} is VALID [2022-02-20 14:04:23,531 INFO L290 TraceCheckUtils]: 33: Hoare triple {4301#(<= |ULTIMATE.start_main_~i~0#1| 31)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4302#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-20 14:04:23,531 INFO L290 TraceCheckUtils]: 34: Hoare triple {4302#(<= |ULTIMATE.start_main_~i~0#1| 32)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4303#(<= |ULTIMATE.start_main_~i~0#1| 33)} is VALID [2022-02-20 14:04:23,532 INFO L290 TraceCheckUtils]: 35: Hoare triple {4303#(<= |ULTIMATE.start_main_~i~0#1| 33)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4304#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-20 14:04:23,533 INFO L290 TraceCheckUtils]: 36: Hoare triple {4304#(<= |ULTIMATE.start_main_~i~0#1| 34)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4305#(<= |ULTIMATE.start_main_~i~0#1| 35)} is VALID [2022-02-20 14:04:23,533 INFO L290 TraceCheckUtils]: 37: Hoare triple {4305#(<= |ULTIMATE.start_main_~i~0#1| 35)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4306#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-20 14:04:23,534 INFO L290 TraceCheckUtils]: 38: Hoare triple {4306#(<= |ULTIMATE.start_main_~i~0#1| 36)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4307#(<= |ULTIMATE.start_main_~i~0#1| 37)} is VALID [2022-02-20 14:04:23,534 INFO L290 TraceCheckUtils]: 39: Hoare triple {4307#(<= |ULTIMATE.start_main_~i~0#1| 37)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4308#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-20 14:04:23,535 INFO L290 TraceCheckUtils]: 40: Hoare triple {4308#(<= |ULTIMATE.start_main_~i~0#1| 38)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4309#(<= |ULTIMATE.start_main_~i~0#1| 39)} is VALID [2022-02-20 14:04:23,536 INFO L290 TraceCheckUtils]: 41: Hoare triple {4309#(<= |ULTIMATE.start_main_~i~0#1| 39)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4310#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-20 14:04:23,536 INFO L290 TraceCheckUtils]: 42: Hoare triple {4310#(<= |ULTIMATE.start_main_~i~0#1| 40)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4311#(<= |ULTIMATE.start_main_~i~0#1| 41)} is VALID [2022-02-20 14:04:23,537 INFO L290 TraceCheckUtils]: 43: Hoare triple {4311#(<= |ULTIMATE.start_main_~i~0#1| 41)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4312#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-20 14:04:23,538 INFO L290 TraceCheckUtils]: 44: Hoare triple {4312#(<= |ULTIMATE.start_main_~i~0#1| 42)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4313#(<= |ULTIMATE.start_main_~i~0#1| 43)} is VALID [2022-02-20 14:04:23,538 INFO L290 TraceCheckUtils]: 45: Hoare triple {4313#(<= |ULTIMATE.start_main_~i~0#1| 43)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4314#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-20 14:04:23,539 INFO L290 TraceCheckUtils]: 46: Hoare triple {4314#(<= |ULTIMATE.start_main_~i~0#1| 44)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4315#(<= |ULTIMATE.start_main_~i~0#1| 45)} is VALID [2022-02-20 14:04:23,539 INFO L290 TraceCheckUtils]: 47: Hoare triple {4315#(<= |ULTIMATE.start_main_~i~0#1| 45)} assume !!(main_~i~0#1 < 100000);call write~int(42, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := 1 + main_~i~0#1; {4316#(<= |ULTIMATE.start_main_~i~0#1| 46)} is VALID [2022-02-20 14:04:23,540 INFO L290 TraceCheckUtils]: 48: Hoare triple {4316#(<= |ULTIMATE.start_main_~i~0#1| 46)} assume !(main_~i~0#1 < 100000); {4269#false} is VALID [2022-02-20 14:04:23,540 INFO L290 TraceCheckUtils]: 49: Hoare triple {4269#false} main_~i~0#1 := 0; {4269#false} is VALID [2022-02-20 14:04:23,540 INFO L290 TraceCheckUtils]: 50: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {4269#false} is VALID [2022-02-20 14:04:23,540 INFO L290 TraceCheckUtils]: 51: Hoare triple {4269#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4269#false} is VALID [2022-02-20 14:04:23,540 INFO L290 TraceCheckUtils]: 52: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {4269#false} is VALID [2022-02-20 14:04:23,540 INFO L290 TraceCheckUtils]: 53: Hoare triple {4269#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4269#false} is VALID [2022-02-20 14:04:23,540 INFO L290 TraceCheckUtils]: 54: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {4269#false} is VALID [2022-02-20 14:04:23,540 INFO L290 TraceCheckUtils]: 55: Hoare triple {4269#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4269#false} is VALID [2022-02-20 14:04:23,541 INFO L290 TraceCheckUtils]: 56: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {4269#false} is VALID [2022-02-20 14:04:23,541 INFO L290 TraceCheckUtils]: 57: Hoare triple {4269#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4269#false} is VALID [2022-02-20 14:04:23,541 INFO L290 TraceCheckUtils]: 58: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {4269#false} is VALID [2022-02-20 14:04:23,541 INFO L290 TraceCheckUtils]: 59: Hoare triple {4269#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4269#false} is VALID [2022-02-20 14:04:23,541 INFO L290 TraceCheckUtils]: 60: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {4269#false} is VALID [2022-02-20 14:04:23,541 INFO L290 TraceCheckUtils]: 61: Hoare triple {4269#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4269#false} is VALID [2022-02-20 14:04:23,541 INFO L290 TraceCheckUtils]: 62: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {4269#false} is VALID [2022-02-20 14:04:23,541 INFO L290 TraceCheckUtils]: 63: Hoare triple {4269#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4269#false} is VALID [2022-02-20 14:04:23,542 INFO L290 TraceCheckUtils]: 64: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {4269#false} is VALID [2022-02-20 14:04:23,542 INFO L290 TraceCheckUtils]: 65: Hoare triple {4269#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4269#false} is VALID [2022-02-20 14:04:23,542 INFO L290 TraceCheckUtils]: 66: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {4269#false} is VALID [2022-02-20 14:04:23,542 INFO L290 TraceCheckUtils]: 67: Hoare triple {4269#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4269#false} is VALID [2022-02-20 14:04:23,542 INFO L290 TraceCheckUtils]: 68: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {4269#false} is VALID [2022-02-20 14:04:23,542 INFO L290 TraceCheckUtils]: 69: Hoare triple {4269#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4269#false} is VALID [2022-02-20 14:04:23,542 INFO L290 TraceCheckUtils]: 70: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {4269#false} is VALID [2022-02-20 14:04:23,542 INFO L290 TraceCheckUtils]: 71: Hoare triple {4269#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4269#false} is VALID [2022-02-20 14:04:23,542 INFO L290 TraceCheckUtils]: 72: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {4269#false} is VALID [2022-02-20 14:04:23,542 INFO L290 TraceCheckUtils]: 73: Hoare triple {4269#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4269#false} is VALID [2022-02-20 14:04:23,542 INFO L290 TraceCheckUtils]: 74: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {4269#false} is VALID [2022-02-20 14:04:23,543 INFO L290 TraceCheckUtils]: 75: Hoare triple {4269#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4269#false} is VALID [2022-02-20 14:04:23,543 INFO L290 TraceCheckUtils]: 76: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {4269#false} is VALID [2022-02-20 14:04:23,543 INFO L290 TraceCheckUtils]: 77: Hoare triple {4269#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4269#false} is VALID [2022-02-20 14:04:23,543 INFO L290 TraceCheckUtils]: 78: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {4269#false} is VALID [2022-02-20 14:04:23,543 INFO L290 TraceCheckUtils]: 79: Hoare triple {4269#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4269#false} is VALID [2022-02-20 14:04:23,543 INFO L290 TraceCheckUtils]: 80: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {4269#false} is VALID [2022-02-20 14:04:23,543 INFO L290 TraceCheckUtils]: 81: Hoare triple {4269#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4269#false} is VALID [2022-02-20 14:04:23,543 INFO L290 TraceCheckUtils]: 82: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {4269#false} is VALID [2022-02-20 14:04:23,544 INFO L290 TraceCheckUtils]: 83: Hoare triple {4269#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4269#false} is VALID [2022-02-20 14:04:23,544 INFO L290 TraceCheckUtils]: 84: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {4269#false} is VALID [2022-02-20 14:04:23,544 INFO L290 TraceCheckUtils]: 85: Hoare triple {4269#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4269#false} is VALID [2022-02-20 14:04:23,544 INFO L290 TraceCheckUtils]: 86: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {4269#false} is VALID [2022-02-20 14:04:23,544 INFO L290 TraceCheckUtils]: 87: Hoare triple {4269#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4269#false} is VALID [2022-02-20 14:04:23,544 INFO L290 TraceCheckUtils]: 88: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {4269#false} is VALID [2022-02-20 14:04:23,544 INFO L290 TraceCheckUtils]: 89: Hoare triple {4269#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4269#false} is VALID [2022-02-20 14:04:23,544 INFO L290 TraceCheckUtils]: 90: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {4269#false} is VALID [2022-02-20 14:04:23,544 INFO L290 TraceCheckUtils]: 91: Hoare triple {4269#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4269#false} is VALID [2022-02-20 14:04:23,544 INFO L290 TraceCheckUtils]: 92: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {4269#false} is VALID [2022-02-20 14:04:23,545 INFO L290 TraceCheckUtils]: 93: Hoare triple {4269#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4269#false} is VALID [2022-02-20 14:04:23,545 INFO L290 TraceCheckUtils]: 94: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {4269#false} is VALID [2022-02-20 14:04:23,545 INFO L290 TraceCheckUtils]: 95: Hoare triple {4269#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4269#false} is VALID [2022-02-20 14:04:23,545 INFO L290 TraceCheckUtils]: 96: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {4269#false} is VALID [2022-02-20 14:04:23,545 INFO L290 TraceCheckUtils]: 97: Hoare triple {4269#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4269#false} is VALID [2022-02-20 14:04:23,545 INFO L290 TraceCheckUtils]: 98: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {4269#false} is VALID [2022-02-20 14:04:23,545 INFO L290 TraceCheckUtils]: 99: Hoare triple {4269#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4269#false} is VALID [2022-02-20 14:04:23,545 INFO L290 TraceCheckUtils]: 100: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {4269#false} is VALID [2022-02-20 14:04:23,545 INFO L290 TraceCheckUtils]: 101: Hoare triple {4269#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4269#false} is VALID [2022-02-20 14:04:23,546 INFO L290 TraceCheckUtils]: 102: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {4269#false} is VALID [2022-02-20 14:04:23,546 INFO L290 TraceCheckUtils]: 103: Hoare triple {4269#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4269#false} is VALID [2022-02-20 14:04:23,546 INFO L290 TraceCheckUtils]: 104: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {4269#false} is VALID [2022-02-20 14:04:23,546 INFO L290 TraceCheckUtils]: 105: Hoare triple {4269#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4269#false} is VALID [2022-02-20 14:04:23,546 INFO L290 TraceCheckUtils]: 106: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {4269#false} is VALID [2022-02-20 14:04:23,546 INFO L290 TraceCheckUtils]: 107: Hoare triple {4269#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4269#false} is VALID [2022-02-20 14:04:23,546 INFO L290 TraceCheckUtils]: 108: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {4269#false} is VALID [2022-02-20 14:04:23,546 INFO L290 TraceCheckUtils]: 109: Hoare triple {4269#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4269#false} is VALID [2022-02-20 14:04:23,546 INFO L290 TraceCheckUtils]: 110: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {4269#false} is VALID [2022-02-20 14:04:23,546 INFO L290 TraceCheckUtils]: 111: Hoare triple {4269#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4269#false} is VALID [2022-02-20 14:04:23,546 INFO L290 TraceCheckUtils]: 112: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {4269#false} is VALID [2022-02-20 14:04:23,546 INFO L290 TraceCheckUtils]: 113: Hoare triple {4269#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4269#false} is VALID [2022-02-20 14:04:23,547 INFO L290 TraceCheckUtils]: 114: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {4269#false} is VALID [2022-02-20 14:04:23,547 INFO L290 TraceCheckUtils]: 115: Hoare triple {4269#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4269#false} is VALID [2022-02-20 14:04:23,547 INFO L290 TraceCheckUtils]: 116: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {4269#false} is VALID [2022-02-20 14:04:23,547 INFO L290 TraceCheckUtils]: 117: Hoare triple {4269#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4269#false} is VALID [2022-02-20 14:04:23,547 INFO L290 TraceCheckUtils]: 118: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {4269#false} is VALID [2022-02-20 14:04:23,547 INFO L290 TraceCheckUtils]: 119: Hoare triple {4269#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4269#false} is VALID [2022-02-20 14:04:23,547 INFO L290 TraceCheckUtils]: 120: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {4269#false} is VALID [2022-02-20 14:04:23,547 INFO L290 TraceCheckUtils]: 121: Hoare triple {4269#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4269#false} is VALID [2022-02-20 14:04:23,547 INFO L290 TraceCheckUtils]: 122: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {4269#false} is VALID [2022-02-20 14:04:23,547 INFO L290 TraceCheckUtils]: 123: Hoare triple {4269#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4269#false} is VALID [2022-02-20 14:04:23,548 INFO L290 TraceCheckUtils]: 124: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {4269#false} is VALID [2022-02-20 14:04:23,548 INFO L290 TraceCheckUtils]: 125: Hoare triple {4269#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4269#false} is VALID [2022-02-20 14:04:23,548 INFO L290 TraceCheckUtils]: 126: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {4269#false} is VALID [2022-02-20 14:04:23,548 INFO L290 TraceCheckUtils]: 127: Hoare triple {4269#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4269#false} is VALID [2022-02-20 14:04:23,548 INFO L290 TraceCheckUtils]: 128: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {4269#false} is VALID [2022-02-20 14:04:23,548 INFO L290 TraceCheckUtils]: 129: Hoare triple {4269#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4269#false} is VALID [2022-02-20 14:04:23,548 INFO L290 TraceCheckUtils]: 130: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {4269#false} is VALID [2022-02-20 14:04:23,548 INFO L290 TraceCheckUtils]: 131: Hoare triple {4269#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4269#false} is VALID [2022-02-20 14:04:23,548 INFO L290 TraceCheckUtils]: 132: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {4269#false} is VALID [2022-02-20 14:04:23,548 INFO L290 TraceCheckUtils]: 133: Hoare triple {4269#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4269#false} is VALID [2022-02-20 14:04:23,548 INFO L290 TraceCheckUtils]: 134: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {4269#false} is VALID [2022-02-20 14:04:23,548 INFO L290 TraceCheckUtils]: 135: Hoare triple {4269#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4269#false} is VALID [2022-02-20 14:04:23,549 INFO L290 TraceCheckUtils]: 136: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {4269#false} is VALID [2022-02-20 14:04:23,549 INFO L290 TraceCheckUtils]: 137: Hoare triple {4269#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4269#false} is VALID [2022-02-20 14:04:23,549 INFO L290 TraceCheckUtils]: 138: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {4269#false} is VALID [2022-02-20 14:04:23,549 INFO L290 TraceCheckUtils]: 139: Hoare triple {4269#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4269#false} is VALID [2022-02-20 14:04:23,549 INFO L290 TraceCheckUtils]: 140: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem3#1; {4269#false} is VALID [2022-02-20 14:04:23,549 INFO L290 TraceCheckUtils]: 141: Hoare triple {4269#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4269#false} is VALID [2022-02-20 14:04:23,549 INFO L290 TraceCheckUtils]: 142: Hoare triple {4269#false} assume !(main_~i~0#1 < 100000); {4269#false} is VALID [2022-02-20 14:04:23,549 INFO L290 TraceCheckUtils]: 143: Hoare triple {4269#false} main_~i~0#1 := 0; {4269#false} is VALID [2022-02-20 14:04:23,549 INFO L290 TraceCheckUtils]: 144: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {4269#false} is VALID [2022-02-20 14:04:23,549 INFO L290 TraceCheckUtils]: 145: Hoare triple {4269#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4269#false} is VALID [2022-02-20 14:04:23,549 INFO L290 TraceCheckUtils]: 146: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {4269#false} is VALID [2022-02-20 14:04:23,550 INFO L290 TraceCheckUtils]: 147: Hoare triple {4269#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4269#false} is VALID [2022-02-20 14:04:23,550 INFO L290 TraceCheckUtils]: 148: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {4269#false} is VALID [2022-02-20 14:04:23,550 INFO L290 TraceCheckUtils]: 149: Hoare triple {4269#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4269#false} is VALID [2022-02-20 14:04:23,550 INFO L290 TraceCheckUtils]: 150: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {4269#false} is VALID [2022-02-20 14:04:23,550 INFO L290 TraceCheckUtils]: 151: Hoare triple {4269#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4269#false} is VALID [2022-02-20 14:04:23,550 INFO L290 TraceCheckUtils]: 152: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {4269#false} is VALID [2022-02-20 14:04:23,550 INFO L290 TraceCheckUtils]: 153: Hoare triple {4269#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4269#false} is VALID [2022-02-20 14:04:23,550 INFO L290 TraceCheckUtils]: 154: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {4269#false} is VALID [2022-02-20 14:04:23,550 INFO L290 TraceCheckUtils]: 155: Hoare triple {4269#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4269#false} is VALID [2022-02-20 14:04:23,550 INFO L290 TraceCheckUtils]: 156: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {4269#false} is VALID [2022-02-20 14:04:23,551 INFO L290 TraceCheckUtils]: 157: Hoare triple {4269#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4269#false} is VALID [2022-02-20 14:04:23,551 INFO L290 TraceCheckUtils]: 158: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {4269#false} is VALID [2022-02-20 14:04:23,551 INFO L290 TraceCheckUtils]: 159: Hoare triple {4269#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4269#false} is VALID [2022-02-20 14:04:23,551 INFO L290 TraceCheckUtils]: 160: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {4269#false} is VALID [2022-02-20 14:04:23,551 INFO L290 TraceCheckUtils]: 161: Hoare triple {4269#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4269#false} is VALID [2022-02-20 14:04:23,551 INFO L290 TraceCheckUtils]: 162: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {4269#false} is VALID [2022-02-20 14:04:23,551 INFO L290 TraceCheckUtils]: 163: Hoare triple {4269#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4269#false} is VALID [2022-02-20 14:04:23,551 INFO L290 TraceCheckUtils]: 164: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {4269#false} is VALID [2022-02-20 14:04:23,551 INFO L290 TraceCheckUtils]: 165: Hoare triple {4269#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4269#false} is VALID [2022-02-20 14:04:23,551 INFO L290 TraceCheckUtils]: 166: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {4269#false} is VALID [2022-02-20 14:04:23,551 INFO L290 TraceCheckUtils]: 167: Hoare triple {4269#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4269#false} is VALID [2022-02-20 14:04:23,552 INFO L290 TraceCheckUtils]: 168: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {4269#false} is VALID [2022-02-20 14:04:23,552 INFO L290 TraceCheckUtils]: 169: Hoare triple {4269#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4269#false} is VALID [2022-02-20 14:04:23,552 INFO L290 TraceCheckUtils]: 170: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {4269#false} is VALID [2022-02-20 14:04:23,552 INFO L290 TraceCheckUtils]: 171: Hoare triple {4269#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4269#false} is VALID [2022-02-20 14:04:23,552 INFO L290 TraceCheckUtils]: 172: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {4269#false} is VALID [2022-02-20 14:04:23,552 INFO L290 TraceCheckUtils]: 173: Hoare triple {4269#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4269#false} is VALID [2022-02-20 14:04:23,552 INFO L290 TraceCheckUtils]: 174: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {4269#false} is VALID [2022-02-20 14:04:23,552 INFO L290 TraceCheckUtils]: 175: Hoare triple {4269#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4269#false} is VALID [2022-02-20 14:04:23,552 INFO L290 TraceCheckUtils]: 176: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {4269#false} is VALID [2022-02-20 14:04:23,552 INFO L290 TraceCheckUtils]: 177: Hoare triple {4269#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4269#false} is VALID [2022-02-20 14:04:23,552 INFO L290 TraceCheckUtils]: 178: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {4269#false} is VALID [2022-02-20 14:04:23,553 INFO L290 TraceCheckUtils]: 179: Hoare triple {4269#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4269#false} is VALID [2022-02-20 14:04:23,553 INFO L290 TraceCheckUtils]: 180: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {4269#false} is VALID [2022-02-20 14:04:23,553 INFO L290 TraceCheckUtils]: 181: Hoare triple {4269#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4269#false} is VALID [2022-02-20 14:04:23,553 INFO L290 TraceCheckUtils]: 182: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {4269#false} is VALID [2022-02-20 14:04:23,553 INFO L290 TraceCheckUtils]: 183: Hoare triple {4269#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4269#false} is VALID [2022-02-20 14:04:23,553 INFO L290 TraceCheckUtils]: 184: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {4269#false} is VALID [2022-02-20 14:04:23,553 INFO L290 TraceCheckUtils]: 185: Hoare triple {4269#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4269#false} is VALID [2022-02-20 14:04:23,553 INFO L290 TraceCheckUtils]: 186: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {4269#false} is VALID [2022-02-20 14:04:23,553 INFO L290 TraceCheckUtils]: 187: Hoare triple {4269#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4269#false} is VALID [2022-02-20 14:04:23,553 INFO L290 TraceCheckUtils]: 188: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {4269#false} is VALID [2022-02-20 14:04:23,553 INFO L290 TraceCheckUtils]: 189: Hoare triple {4269#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4269#false} is VALID [2022-02-20 14:04:23,554 INFO L290 TraceCheckUtils]: 190: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {4269#false} is VALID [2022-02-20 14:04:23,554 INFO L290 TraceCheckUtils]: 191: Hoare triple {4269#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4269#false} is VALID [2022-02-20 14:04:23,554 INFO L290 TraceCheckUtils]: 192: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {4269#false} is VALID [2022-02-20 14:04:23,554 INFO L290 TraceCheckUtils]: 193: Hoare triple {4269#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4269#false} is VALID [2022-02-20 14:04:23,554 INFO L290 TraceCheckUtils]: 194: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {4269#false} is VALID [2022-02-20 14:04:23,554 INFO L290 TraceCheckUtils]: 195: Hoare triple {4269#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4269#false} is VALID [2022-02-20 14:04:23,554 INFO L290 TraceCheckUtils]: 196: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {4269#false} is VALID [2022-02-20 14:04:23,554 INFO L290 TraceCheckUtils]: 197: Hoare triple {4269#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4269#false} is VALID [2022-02-20 14:04:23,554 INFO L290 TraceCheckUtils]: 198: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {4269#false} is VALID [2022-02-20 14:04:23,554 INFO L290 TraceCheckUtils]: 199: Hoare triple {4269#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4269#false} is VALID [2022-02-20 14:04:23,554 INFO L290 TraceCheckUtils]: 200: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {4269#false} is VALID [2022-02-20 14:04:23,555 INFO L290 TraceCheckUtils]: 201: Hoare triple {4269#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4269#false} is VALID [2022-02-20 14:04:23,555 INFO L290 TraceCheckUtils]: 202: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {4269#false} is VALID [2022-02-20 14:04:23,555 INFO L290 TraceCheckUtils]: 203: Hoare triple {4269#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4269#false} is VALID [2022-02-20 14:04:23,555 INFO L290 TraceCheckUtils]: 204: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {4269#false} is VALID [2022-02-20 14:04:23,555 INFO L290 TraceCheckUtils]: 205: Hoare triple {4269#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4269#false} is VALID [2022-02-20 14:04:23,555 INFO L290 TraceCheckUtils]: 206: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {4269#false} is VALID [2022-02-20 14:04:23,555 INFO L290 TraceCheckUtils]: 207: Hoare triple {4269#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4269#false} is VALID [2022-02-20 14:04:23,555 INFO L290 TraceCheckUtils]: 208: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {4269#false} is VALID [2022-02-20 14:04:23,555 INFO L290 TraceCheckUtils]: 209: Hoare triple {4269#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4269#false} is VALID [2022-02-20 14:04:23,555 INFO L290 TraceCheckUtils]: 210: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {4269#false} is VALID [2022-02-20 14:04:23,555 INFO L290 TraceCheckUtils]: 211: Hoare triple {4269#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4269#false} is VALID [2022-02-20 14:04:23,556 INFO L290 TraceCheckUtils]: 212: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {4269#false} is VALID [2022-02-20 14:04:23,556 INFO L290 TraceCheckUtils]: 213: Hoare triple {4269#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4269#false} is VALID [2022-02-20 14:04:23,556 INFO L290 TraceCheckUtils]: 214: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {4269#false} is VALID [2022-02-20 14:04:23,556 INFO L290 TraceCheckUtils]: 215: Hoare triple {4269#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4269#false} is VALID [2022-02-20 14:04:23,556 INFO L290 TraceCheckUtils]: 216: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {4269#false} is VALID [2022-02-20 14:04:23,556 INFO L290 TraceCheckUtils]: 217: Hoare triple {4269#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4269#false} is VALID [2022-02-20 14:04:23,556 INFO L290 TraceCheckUtils]: 218: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {4269#false} is VALID [2022-02-20 14:04:23,556 INFO L290 TraceCheckUtils]: 219: Hoare triple {4269#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4269#false} is VALID [2022-02-20 14:04:23,556 INFO L290 TraceCheckUtils]: 220: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {4269#false} is VALID [2022-02-20 14:04:23,556 INFO L290 TraceCheckUtils]: 221: Hoare triple {4269#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4269#false} is VALID [2022-02-20 14:04:23,556 INFO L290 TraceCheckUtils]: 222: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {4269#false} is VALID [2022-02-20 14:04:23,556 INFO L290 TraceCheckUtils]: 223: Hoare triple {4269#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4269#false} is VALID [2022-02-20 14:04:23,557 INFO L290 TraceCheckUtils]: 224: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {4269#false} is VALID [2022-02-20 14:04:23,557 INFO L290 TraceCheckUtils]: 225: Hoare triple {4269#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4269#false} is VALID [2022-02-20 14:04:23,557 INFO L290 TraceCheckUtils]: 226: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {4269#false} is VALID [2022-02-20 14:04:23,557 INFO L290 TraceCheckUtils]: 227: Hoare triple {4269#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4269#false} is VALID [2022-02-20 14:04:23,557 INFO L290 TraceCheckUtils]: 228: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {4269#false} is VALID [2022-02-20 14:04:23,557 INFO L290 TraceCheckUtils]: 229: Hoare triple {4269#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4269#false} is VALID [2022-02-20 14:04:23,557 INFO L290 TraceCheckUtils]: 230: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {4269#false} is VALID [2022-02-20 14:04:23,557 INFO L290 TraceCheckUtils]: 231: Hoare triple {4269#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4269#false} is VALID [2022-02-20 14:04:23,557 INFO L290 TraceCheckUtils]: 232: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {4269#false} is VALID [2022-02-20 14:04:23,557 INFO L290 TraceCheckUtils]: 233: Hoare triple {4269#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4269#false} is VALID [2022-02-20 14:04:23,557 INFO L290 TraceCheckUtils]: 234: Hoare triple {4269#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem5#1 + main_~incr~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem5#1; {4269#false} is VALID [2022-02-20 14:04:23,557 INFO L290 TraceCheckUtils]: 235: Hoare triple {4269#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4269#false} is VALID [2022-02-20 14:04:23,558 INFO L290 TraceCheckUtils]: 236: Hoare triple {4269#false} assume !(main_~i~0#1 < 100000); {4269#false} is VALID [2022-02-20 14:04:23,558 INFO L290 TraceCheckUtils]: 237: Hoare triple {4269#false} havoc main_~x~0#1;main_~x~0#1 := 0; {4269#false} is VALID [2022-02-20 14:04:23,558 INFO L290 TraceCheckUtils]: 238: Hoare triple {4269#false} assume !!(main_~x~0#1 < 100000);call main_#t~mem7#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~x~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 == 42 + main_~incr~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {4269#false} is VALID [2022-02-20 14:04:23,558 INFO L290 TraceCheckUtils]: 239: Hoare triple {4269#false} assume 0 == __VERIFIER_assert_~cond#1; {4269#false} is VALID [2022-02-20 14:04:23,558 INFO L290 TraceCheckUtils]: 240: Hoare triple {4269#false} assume !false; {4269#false} is VALID [2022-02-20 14:04:23,560 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 4232 trivial. 0 not checked. [2022-02-20 14:04:23,560 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:04:23,560 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816395604] [2022-02-20 14:04:23,560 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816395604] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:04:23,560 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245313383] [2022-02-20 14:04:23,560 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-20 14:04:23,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:04:23,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:04:23,576 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:23,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process