./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-examples/standard_partition_ground-1.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_partition_ground-1.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 6c4a57140d9977d38b2a20d40c88df51a4fcb7b14a0fb7c51e0b4e36cddf9998 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:06:46,445 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:06:46,447 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:06:46,473 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:06:46,479 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:06:46,481 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:06:46,483 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:06:46,487 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:06:46,488 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:06:46,491 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:06:46,491 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:06:46,492 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:06:46,493 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:06:46,496 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:06:46,498 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:06:46,499 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:06:46,500 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:06:46,500 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:06:46,502 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:06:46,503 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:06:46,504 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:06:46,510 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:06:46,511 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:06:46,512 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:06:46,514 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:06:46,518 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:06:46,518 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:06:46,519 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:06:46,520 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:06:46,521 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:06:46,521 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:06:46,522 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:06:46,523 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:06:46,524 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:06:46,525 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:06:46,526 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:06:46,527 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:06:46,531 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:06:46,531 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:06:46,532 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:06:46,533 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:06:46,534 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:06:46,566 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:06:46,567 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:06:46,567 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:06:46,567 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:06:46,568 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:06:46,568 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:06:46,569 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:06:46,569 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:06:46,569 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:06:46,570 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:06:46,571 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:06:46,571 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:06:46,571 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:06:46,571 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:06:46,571 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:06:46,572 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:06:46,572 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:06:46,572 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:06:46,572 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:06:46,572 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:06:46,573 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:06:46,573 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:06:46,573 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:06:46,573 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:06:46,573 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:06:46,574 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:06:46,574 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:06:46,574 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:06:46,574 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:06:46,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:06:46,575 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:06:46,575 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:06:46,575 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:06:46,575 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 -> 6c4a57140d9977d38b2a20d40c88df51a4fcb7b14a0fb7c51e0b4e36cddf9998 [2022-02-20 14:06:46,841 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:06:46,865 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:06:46,867 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:06:46,868 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:06:46,869 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:06:46,870 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/standard_partition_ground-1.i [2022-02-20 14:06:46,925 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/986d881e3/11ac4ff4d7b84faf9c585f9955fb9edd/FLAG96ea0da48 [2022-02-20 14:06:47,371 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:06:47,371 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/standard_partition_ground-1.i [2022-02-20 14:06:47,380 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/986d881e3/11ac4ff4d7b84faf9c585f9955fb9edd/FLAG96ea0da48 [2022-02-20 14:06:47,762 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/986d881e3/11ac4ff4d7b84faf9c585f9955fb9edd [2022-02-20 14:06:47,763 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:06:47,764 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:06:47,766 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:06:47,766 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:06:47,771 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:06:47,772 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:06:47" (1/1) ... [2022-02-20 14:06:47,773 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1699a34b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:06:47, skipping insertion in model container [2022-02-20 14:06:47,773 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:06:47" (1/1) ... [2022-02-20 14:06:47,780 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:06:47,790 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:06:47,950 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_partition_ground-1.i[860,873] [2022-02-20 14:06:47,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:06:47,989 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:06:48,004 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_partition_ground-1.i[860,873] [2022-02-20 14:06:48,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:06:48,036 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:06:48,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:06:48 WrapperNode [2022-02-20 14:06:48,037 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:06:48,038 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:06:48,038 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:06:48,039 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:06:48,044 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:06:48" (1/1) ... [2022-02-20 14:06:48,057 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:06:48" (1/1) ... [2022-02-20 14:06:48,086 INFO L137 Inliner]: procedures = 16, calls = 26, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 82 [2022-02-20 14:06:48,087 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:06:48,088 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:06:48,088 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:06:48,088 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:06:48,095 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:06:48" (1/1) ... [2022-02-20 14:06:48,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:06:48" (1/1) ... [2022-02-20 14:06:48,099 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:06:48" (1/1) ... [2022-02-20 14:06:48,100 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:06:48" (1/1) ... [2022-02-20 14:06:48,113 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:06:48" (1/1) ... [2022-02-20 14:06:48,116 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:06:48" (1/1) ... [2022-02-20 14:06:48,124 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:06:48" (1/1) ... [2022-02-20 14:06:48,128 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:06:48,129 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:06:48,129 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:06:48,130 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:06:48,131 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:06:48" (1/1) ... [2022-02-20 14:06:48,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:06:48,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:06:48,160 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:06:48,188 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:06:48,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:06:48,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:06:48,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:06:48,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:06:48,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:06:48,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:06:48,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:06:48,211 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 14:06:48,211 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 14:06:48,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:06:48,274 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:06:48,275 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:06:48,493 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:06:48,500 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:06:48,500 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-20 14:06:48,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:06:48 BoogieIcfgContainer [2022-02-20 14:06:48,502 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:06:48,503 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:06:48,504 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:06:48,506 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:06:48,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:06:47" (1/3) ... [2022-02-20 14:06:48,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3178d0a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:06:48, skipping insertion in model container [2022-02-20 14:06:48,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:06:48" (2/3) ... [2022-02-20 14:06:48,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3178d0a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:06:48, skipping insertion in model container [2022-02-20 14:06:48,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:06:48" (3/3) ... [2022-02-20 14:06:48,509 INFO L111 eAbstractionObserver]: Analyzing ICFG standard_partition_ground-1.i [2022-02-20 14:06:48,513 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:06:48,514 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:06:48,557 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:06:48,564 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:06:48,564 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:06:48,589 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 24 states have (on average 1.5) internal successors, (36), 25 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:06:48,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 14:06:48,593 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:06:48,594 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:06:48,595 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:06:48,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:06:48,600 INFO L85 PathProgramCache]: Analyzing trace with hash 25564738, now seen corresponding path program 1 times [2022-02-20 14:06:48,608 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:06:48,609 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513220720] [2022-02-20 14:06:48,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:06:48,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:06:48,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:06:48,854 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#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); {32#true} is VALID [2022-02-20 14:06:48,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~#bb~0#1.base, main_~#bb~0#1.offset, main_~#cc~0#1.base, main_~#cc~0#1.offset, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;main_~b~0#1 := 0;main_~c~0#1 := 0;call main_~#bb~0#1.base, main_~#bb~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#cc~0#1.base, main_~#cc~0#1.offset := #Ultimate.allocOnStack(400000); {32#true} is VALID [2022-02-20 14:06:48,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume !true; {33#false} is VALID [2022-02-20 14:06:48,857 INFO L290 TraceCheckUtils]: 3: Hoare triple {33#false} main_~a~0#1 := 0; {33#false} is VALID [2022-02-20 14:06:48,857 INFO L290 TraceCheckUtils]: 4: Hoare triple {33#false} assume !true; {33#false} is VALID [2022-02-20 14:06:48,857 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#false} havoc main_~x~0#1;main_~x~0#1 := 0; {33#false} is VALID [2022-02-20 14:06:48,858 INFO L290 TraceCheckUtils]: 6: Hoare triple {33#false} assume !!(main_~x~0#1 < main_~b~0#1);call main_#t~mem7#1 := read~int(main_~#bb~0#1.base, main_~#bb~0#1.offset + 4 * main_~x~0#1, 4); {33#false} is VALID [2022-02-20 14:06:48,858 INFO L272 TraceCheckUtils]: 7: Hoare triple {33#false} call __VERIFIER_assert((if main_#t~mem7#1 >= 0 then 1 else 0)); {33#false} is VALID [2022-02-20 14:06:48,858 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-02-20 14:06:48,860 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-02-20 14:06:48,860 INFO L290 TraceCheckUtils]: 10: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-02-20 14:06:48,861 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:06:48,862 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:06:48,862 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513220720] [2022-02-20 14:06:48,863 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513220720] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:06:48,863 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:06:48,863 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 14:06:48,865 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28138387] [2022-02-20 14:06:48,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:06:48,872 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:06:48,873 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:06:48,876 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:06:48,902 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:06:48,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 14:06:48,903 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:06:48,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 14:06:48,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:06:48,928 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.5) internal successors, (36), 25 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:06:48,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:06:48,997 INFO L93 Difference]: Finished difference Result 53 states and 74 transitions. [2022-02-20 14:06:48,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 14:06:48,998 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:06:48,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:06:48,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:06:49,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 74 transitions. [2022-02-20 14:06:49,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:06:49,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 74 transitions. [2022-02-20 14:06:49,019 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 74 transitions. [2022-02-20 14:06:49,103 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:06:49,110 INFO L225 Difference]: With dead ends: 53 [2022-02-20 14:06:49,110 INFO L226 Difference]: Without dead ends: 25 [2022-02-20 14:06:49,113 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:06:49,116 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:06:49,117 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:06:49,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-02-20 14:06:49,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-02-20 14:06:49,154 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:06:49,155 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:06:49,156 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:06:49,157 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:06:49,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:06:49,162 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-02-20 14:06:49,162 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-02-20 14:06:49,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:06:49,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:06:49,164 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 25 states. [2022-02-20 14:06:49,165 INFO L87 Difference]: Start difference. First operand has 25 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 25 states. [2022-02-20 14:06:49,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:06:49,170 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-02-20 14:06:49,170 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-02-20 14:06:49,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:06:49,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:06:49,172 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:06:49,172 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:06:49,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:06:49,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2022-02-20 14:06:49,178 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 11 [2022-02-20 14:06:49,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:06:49,178 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2022-02-20 14:06:49,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:06:49,179 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-02-20 14:06:49,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 14:06:49,180 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:06:49,181 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:06:49,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:06:49,181 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:06:49,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:06:49,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1555088748, now seen corresponding path program 1 times [2022-02-20 14:06:49,182 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:06:49,182 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257382666] [2022-02-20 14:06:49,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:06:49,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:06:49,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:06:49,248 INFO L290 TraceCheckUtils]: 0: Hoare triple {186#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); {186#true} is VALID [2022-02-20 14:06:49,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {186#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~#bb~0#1.base, main_~#bb~0#1.offset, main_~#cc~0#1.base, main_~#cc~0#1.offset, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;main_~b~0#1 := 0;main_~c~0#1 := 0;call main_~#bb~0#1.base, main_~#bb~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#cc~0#1.base, main_~#cc~0#1.offset := #Ultimate.allocOnStack(400000); {188#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:06:49,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {188#(= |ULTIMATE.start_main_~a~0#1| 0)} assume !(main_~a~0#1 < 100000); {187#false} is VALID [2022-02-20 14:06:49,250 INFO L290 TraceCheckUtils]: 3: Hoare triple {187#false} main_~a~0#1 := 0; {187#false} is VALID [2022-02-20 14:06:49,250 INFO L290 TraceCheckUtils]: 4: Hoare triple {187#false} assume !(main_~a~0#1 < 100000); {187#false} is VALID [2022-02-20 14:06:49,250 INFO L290 TraceCheckUtils]: 5: Hoare triple {187#false} havoc main_~x~0#1;main_~x~0#1 := 0; {187#false} is VALID [2022-02-20 14:06:49,251 INFO L290 TraceCheckUtils]: 6: Hoare triple {187#false} assume !!(main_~x~0#1 < main_~b~0#1);call main_#t~mem7#1 := read~int(main_~#bb~0#1.base, main_~#bb~0#1.offset + 4 * main_~x~0#1, 4); {187#false} is VALID [2022-02-20 14:06:49,251 INFO L272 TraceCheckUtils]: 7: Hoare triple {187#false} call __VERIFIER_assert((if main_#t~mem7#1 >= 0 then 1 else 0)); {187#false} is VALID [2022-02-20 14:06:49,251 INFO L290 TraceCheckUtils]: 8: Hoare triple {187#false} ~cond := #in~cond; {187#false} is VALID [2022-02-20 14:06:49,251 INFO L290 TraceCheckUtils]: 9: Hoare triple {187#false} assume 0 == ~cond; {187#false} is VALID [2022-02-20 14:06:49,252 INFO L290 TraceCheckUtils]: 10: Hoare triple {187#false} assume !false; {187#false} is VALID [2022-02-20 14:06:49,253 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:06:49,253 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:06:49,253 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257382666] [2022-02-20 14:06:49,253 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257382666] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:06:49,254 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:06:49,254 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:06:49,254 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920071241] [2022-02-20 14:06:49,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:06:49,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:06:49,256 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:06:49,256 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:06:49,266 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:06:49,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:06:49,267 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:06:49,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:06:49,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:06:49,268 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:06:49,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:06:49,325 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2022-02-20 14:06:49,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:06:49,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:06:49,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:06:49,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:06:49,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-02-20 14:06:49,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:06:49,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-02-20 14:06:49,331 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 65 transitions. [2022-02-20 14:06:49,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:06:49,386 INFO L225 Difference]: With dead ends: 51 [2022-02-20 14:06:49,387 INFO L226 Difference]: Without dead ends: 31 [2022-02-20 14:06:49,387 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:06:49,388 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:06:49,389 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 46 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:06:49,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-02-20 14:06:49,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2022-02-20 14:06:49,396 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:06:49,397 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 27 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:06:49,398 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 27 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:06:49,399 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 27 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:06:49,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:06:49,403 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2022-02-20 14:06:49,403 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-02-20 14:06:49,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:06:49,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:06:49,404 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 31 states. [2022-02-20 14:06:49,404 INFO L87 Difference]: Start difference. First operand has 27 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 31 states. [2022-02-20 14:06:49,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:06:49,407 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2022-02-20 14:06:49,407 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-02-20 14:06:49,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:06:49,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:06:49,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:06:49,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:06:49,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:06:49,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2022-02-20 14:06:49,411 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 11 [2022-02-20 14:06:49,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:06:49,412 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-02-20 14:06:49,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:06:49,412 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-02-20 14:06:49,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 14:06:49,412 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:06:49,412 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:06:49,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 14:06:49,413 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:06:49,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:06:49,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1378811952, now seen corresponding path program 1 times [2022-02-20 14:06:49,414 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:06:49,414 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523389954] [2022-02-20 14:06:49,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:06:49,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:06:49,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:06:49,486 INFO L290 TraceCheckUtils]: 0: Hoare triple {355#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); {355#true} is VALID [2022-02-20 14:06:49,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {355#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~#bb~0#1.base, main_~#bb~0#1.offset, main_~#cc~0#1.base, main_~#cc~0#1.offset, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;main_~b~0#1 := 0;main_~c~0#1 := 0;call main_~#bb~0#1.base, main_~#bb~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#cc~0#1.base, main_~#cc~0#1.offset := #Ultimate.allocOnStack(400000); {357#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:06:49,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {357#(= |ULTIMATE.start_main_~a~0#1| 0)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {357#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:06:49,487 INFO L290 TraceCheckUtils]: 3: Hoare triple {357#(= |ULTIMATE.start_main_~a~0#1| 0)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {357#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:06:49,488 INFO L290 TraceCheckUtils]: 4: Hoare triple {357#(= |ULTIMATE.start_main_~a~0#1| 0)} main_~a~0#1 := 1 + main_~a~0#1; {358#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:06:49,488 INFO L290 TraceCheckUtils]: 5: Hoare triple {358#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !(main_~a~0#1 < 100000); {356#false} is VALID [2022-02-20 14:06:49,489 INFO L290 TraceCheckUtils]: 6: Hoare triple {356#false} main_~a~0#1 := 0; {356#false} is VALID [2022-02-20 14:06:49,489 INFO L290 TraceCheckUtils]: 7: Hoare triple {356#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {356#false} is VALID [2022-02-20 14:06:49,489 INFO L290 TraceCheckUtils]: 8: Hoare triple {356#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {356#false} is VALID [2022-02-20 14:06:49,489 INFO L290 TraceCheckUtils]: 9: Hoare triple {356#false} main_~a~0#1 := 1 + main_~a~0#1; {356#false} is VALID [2022-02-20 14:06:49,489 INFO L290 TraceCheckUtils]: 10: Hoare triple {356#false} assume !(main_~a~0#1 < 100000); {356#false} is VALID [2022-02-20 14:06:49,490 INFO L290 TraceCheckUtils]: 11: Hoare triple {356#false} havoc main_~x~0#1;main_~x~0#1 := 0; {356#false} is VALID [2022-02-20 14:06:49,490 INFO L290 TraceCheckUtils]: 12: Hoare triple {356#false} assume !!(main_~x~0#1 < main_~b~0#1);call main_#t~mem7#1 := read~int(main_~#bb~0#1.base, main_~#bb~0#1.offset + 4 * main_~x~0#1, 4); {356#false} is VALID [2022-02-20 14:06:49,490 INFO L272 TraceCheckUtils]: 13: Hoare triple {356#false} call __VERIFIER_assert((if main_#t~mem7#1 >= 0 then 1 else 0)); {356#false} is VALID [2022-02-20 14:06:49,490 INFO L290 TraceCheckUtils]: 14: Hoare triple {356#false} ~cond := #in~cond; {356#false} is VALID [2022-02-20 14:06:49,490 INFO L290 TraceCheckUtils]: 15: Hoare triple {356#false} assume 0 == ~cond; {356#false} is VALID [2022-02-20 14:06:49,491 INFO L290 TraceCheckUtils]: 16: Hoare triple {356#false} assume !false; {356#false} is VALID [2022-02-20 14:06:49,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:06:49,496 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:06:49,496 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523389954] [2022-02-20 14:06:49,496 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523389954] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:06:49,496 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663991341] [2022-02-20 14:06:49,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:06:49,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:06:49,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:06:49,499 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:06:49,500 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:06:49,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:06:49,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 14:06:49,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:06:49,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:06:49,667 INFO L290 TraceCheckUtils]: 0: Hoare triple {355#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); {355#true} is VALID [2022-02-20 14:06:49,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {355#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~#bb~0#1.base, main_~#bb~0#1.offset, main_~#cc~0#1.base, main_~#cc~0#1.offset, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;main_~b~0#1 := 0;main_~c~0#1 := 0;call main_~#bb~0#1.base, main_~#bb~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#cc~0#1.base, main_~#cc~0#1.offset := #Ultimate.allocOnStack(400000); {365#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:06:49,669 INFO L290 TraceCheckUtils]: 2: Hoare triple {365#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {365#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:06:49,670 INFO L290 TraceCheckUtils]: 3: Hoare triple {365#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {365#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:06:49,671 INFO L290 TraceCheckUtils]: 4: Hoare triple {365#(<= |ULTIMATE.start_main_~a~0#1| 0)} main_~a~0#1 := 1 + main_~a~0#1; {358#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:06:49,674 INFO L290 TraceCheckUtils]: 5: Hoare triple {358#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !(main_~a~0#1 < 100000); {356#false} is VALID [2022-02-20 14:06:49,674 INFO L290 TraceCheckUtils]: 6: Hoare triple {356#false} main_~a~0#1 := 0; {356#false} is VALID [2022-02-20 14:06:49,674 INFO L290 TraceCheckUtils]: 7: Hoare triple {356#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {356#false} is VALID [2022-02-20 14:06:49,675 INFO L290 TraceCheckUtils]: 8: Hoare triple {356#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {356#false} is VALID [2022-02-20 14:06:49,675 INFO L290 TraceCheckUtils]: 9: Hoare triple {356#false} main_~a~0#1 := 1 + main_~a~0#1; {356#false} is VALID [2022-02-20 14:06:49,675 INFO L290 TraceCheckUtils]: 10: Hoare triple {356#false} assume !(main_~a~0#1 < 100000); {356#false} is VALID [2022-02-20 14:06:49,675 INFO L290 TraceCheckUtils]: 11: Hoare triple {356#false} havoc main_~x~0#1;main_~x~0#1 := 0; {356#false} is VALID [2022-02-20 14:06:49,676 INFO L290 TraceCheckUtils]: 12: Hoare triple {356#false} assume !!(main_~x~0#1 < main_~b~0#1);call main_#t~mem7#1 := read~int(main_~#bb~0#1.base, main_~#bb~0#1.offset + 4 * main_~x~0#1, 4); {356#false} is VALID [2022-02-20 14:06:49,676 INFO L272 TraceCheckUtils]: 13: Hoare triple {356#false} call __VERIFIER_assert((if main_#t~mem7#1 >= 0 then 1 else 0)); {356#false} is VALID [2022-02-20 14:06:49,676 INFO L290 TraceCheckUtils]: 14: Hoare triple {356#false} ~cond := #in~cond; {356#false} is VALID [2022-02-20 14:06:49,677 INFO L290 TraceCheckUtils]: 15: Hoare triple {356#false} assume 0 == ~cond; {356#false} is VALID [2022-02-20 14:06:49,677 INFO L290 TraceCheckUtils]: 16: Hoare triple {356#false} assume !false; {356#false} is VALID [2022-02-20 14:06:49,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:06:49,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:06:49,768 INFO L290 TraceCheckUtils]: 16: Hoare triple {356#false} assume !false; {356#false} is VALID [2022-02-20 14:06:49,769 INFO L290 TraceCheckUtils]: 15: Hoare triple {356#false} assume 0 == ~cond; {356#false} is VALID [2022-02-20 14:06:49,769 INFO L290 TraceCheckUtils]: 14: Hoare triple {356#false} ~cond := #in~cond; {356#false} is VALID [2022-02-20 14:06:49,769 INFO L272 TraceCheckUtils]: 13: Hoare triple {356#false} call __VERIFIER_assert((if main_#t~mem7#1 >= 0 then 1 else 0)); {356#false} is VALID [2022-02-20 14:06:49,770 INFO L290 TraceCheckUtils]: 12: Hoare triple {356#false} assume !!(main_~x~0#1 < main_~b~0#1);call main_#t~mem7#1 := read~int(main_~#bb~0#1.base, main_~#bb~0#1.offset + 4 * main_~x~0#1, 4); {356#false} is VALID [2022-02-20 14:06:49,770 INFO L290 TraceCheckUtils]: 11: Hoare triple {356#false} havoc main_~x~0#1;main_~x~0#1 := 0; {356#false} is VALID [2022-02-20 14:06:49,770 INFO L290 TraceCheckUtils]: 10: Hoare triple {356#false} assume !(main_~a~0#1 < 100000); {356#false} is VALID [2022-02-20 14:06:49,770 INFO L290 TraceCheckUtils]: 9: Hoare triple {356#false} main_~a~0#1 := 1 + main_~a~0#1; {356#false} is VALID [2022-02-20 14:06:49,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {356#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {356#false} is VALID [2022-02-20 14:06:49,771 INFO L290 TraceCheckUtils]: 7: Hoare triple {356#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {356#false} is VALID [2022-02-20 14:06:49,771 INFO L290 TraceCheckUtils]: 6: Hoare triple {356#false} main_~a~0#1 := 0; {356#false} is VALID [2022-02-20 14:06:49,771 INFO L290 TraceCheckUtils]: 5: Hoare triple {444#(< |ULTIMATE.start_main_~a~0#1| 100000)} assume !(main_~a~0#1 < 100000); {356#false} is VALID [2022-02-20 14:06:49,772 INFO L290 TraceCheckUtils]: 4: Hoare triple {448#(< |ULTIMATE.start_main_~a~0#1| 99999)} main_~a~0#1 := 1 + main_~a~0#1; {444#(< |ULTIMATE.start_main_~a~0#1| 100000)} is VALID [2022-02-20 14:06:49,773 INFO L290 TraceCheckUtils]: 3: Hoare triple {448#(< |ULTIMATE.start_main_~a~0#1| 99999)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {448#(< |ULTIMATE.start_main_~a~0#1| 99999)} is VALID [2022-02-20 14:06:49,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {448#(< |ULTIMATE.start_main_~a~0#1| 99999)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {448#(< |ULTIMATE.start_main_~a~0#1| 99999)} is VALID [2022-02-20 14:06:49,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {355#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~#bb~0#1.base, main_~#bb~0#1.offset, main_~#cc~0#1.base, main_~#cc~0#1.offset, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;main_~b~0#1 := 0;main_~c~0#1 := 0;call main_~#bb~0#1.base, main_~#bb~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#cc~0#1.base, main_~#cc~0#1.offset := #Ultimate.allocOnStack(400000); {448#(< |ULTIMATE.start_main_~a~0#1| 99999)} is VALID [2022-02-20 14:06:49,774 INFO L290 TraceCheckUtils]: 0: Hoare triple {355#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); {355#true} is VALID [2022-02-20 14:06:49,775 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:06:49,775 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663991341] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:06:49,775 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:06:49,775 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-02-20 14:06:49,776 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060768730] [2022-02-20 14:06:49,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:06:49,777 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 14:06:49,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:06:49,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:06:49,801 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:06:49,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 14:06:49,802 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:06:49,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 14:06:49,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:06:49,803 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:06:49,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:06:49,963 INFO L93 Difference]: Finished difference Result 66 states and 88 transitions. [2022-02-20 14:06:49,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 14:06:49,964 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 14:06:49,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:06:49,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:06:49,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-02-20 14:06:49,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:06:49,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-02-20 14:06:49,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 87 transitions. [2022-02-20 14:06:50,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:06:50,056 INFO L225 Difference]: With dead ends: 66 [2022-02-20 14:06:50,056 INFO L226 Difference]: Without dead ends: 45 [2022-02-20 14:06:50,057 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 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:06:50,058 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 44 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:06:50,058 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 69 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:06:50,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-02-20 14:06:50,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-02-20 14:06:50,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:06:50,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:06:50,067 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:06:50,068 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:06:50,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:06:50,070 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2022-02-20 14:06:50,070 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2022-02-20 14:06:50,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:06:50,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:06:50,071 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 45 states. [2022-02-20 14:06:50,071 INFO L87 Difference]: Start difference. First operand has 45 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 45 states. [2022-02-20 14:06:50,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:06:50,073 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2022-02-20 14:06:50,073 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2022-02-20 14:06:50,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:06:50,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:06:50,074 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:06:50,074 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:06:50,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:06:50,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2022-02-20 14:06:50,076 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 17 [2022-02-20 14:06:50,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:06:50,076 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2022-02-20 14:06:50,077 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:06:50,077 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2022-02-20 14:06:50,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 14:06:50,078 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:06:50,078 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:06:50,105 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:06:50,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:06:50,292 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:06:50,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:06:50,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1056905748, now seen corresponding path program 2 times [2022-02-20 14:06:50,292 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:06:50,293 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486341247] [2022-02-20 14:06:50,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:06:50,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:06:50,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:06:50,434 INFO L290 TraceCheckUtils]: 0: Hoare triple {698#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); {698#true} is VALID [2022-02-20 14:06:50,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {698#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~#bb~0#1.base, main_~#bb~0#1.offset, main_~#cc~0#1.base, main_~#cc~0#1.offset, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;main_~b~0#1 := 0;main_~c~0#1 := 0;call main_~#bb~0#1.base, main_~#bb~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#cc~0#1.base, main_~#cc~0#1.offset := #Ultimate.allocOnStack(400000); {700#(= |ULTIMATE.start_main_~b~0#1| 0)} is VALID [2022-02-20 14:06:50,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {700#(= |ULTIMATE.start_main_~b~0#1| 0)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {700#(= |ULTIMATE.start_main_~b~0#1| 0)} is VALID [2022-02-20 14:06:50,438 INFO L290 TraceCheckUtils]: 3: Hoare triple {700#(= |ULTIMATE.start_main_~b~0#1| 0)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {700#(= |ULTIMATE.start_main_~b~0#1| 0)} is VALID [2022-02-20 14:06:50,439 INFO L290 TraceCheckUtils]: 4: Hoare triple {700#(= |ULTIMATE.start_main_~b~0#1| 0)} main_~a~0#1 := 1 + main_~a~0#1; {700#(= |ULTIMATE.start_main_~b~0#1| 0)} is VALID [2022-02-20 14:06:50,439 INFO L290 TraceCheckUtils]: 5: Hoare triple {700#(= |ULTIMATE.start_main_~b~0#1| 0)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {700#(= |ULTIMATE.start_main_~b~0#1| 0)} is VALID [2022-02-20 14:06:50,440 INFO L290 TraceCheckUtils]: 6: Hoare triple {700#(= |ULTIMATE.start_main_~b~0#1| 0)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {700#(= |ULTIMATE.start_main_~b~0#1| 0)} is VALID [2022-02-20 14:06:50,440 INFO L290 TraceCheckUtils]: 7: Hoare triple {700#(= |ULTIMATE.start_main_~b~0#1| 0)} main_~a~0#1 := 1 + main_~a~0#1; {700#(= |ULTIMATE.start_main_~b~0#1| 0)} is VALID [2022-02-20 14:06:50,441 INFO L290 TraceCheckUtils]: 8: Hoare triple {700#(= |ULTIMATE.start_main_~b~0#1| 0)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {700#(= |ULTIMATE.start_main_~b~0#1| 0)} is VALID [2022-02-20 14:06:50,441 INFO L290 TraceCheckUtils]: 9: Hoare triple {700#(= |ULTIMATE.start_main_~b~0#1| 0)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {700#(= |ULTIMATE.start_main_~b~0#1| 0)} is VALID [2022-02-20 14:06:50,442 INFO L290 TraceCheckUtils]: 10: Hoare triple {700#(= |ULTIMATE.start_main_~b~0#1| 0)} main_~a~0#1 := 1 + main_~a~0#1; {700#(= |ULTIMATE.start_main_~b~0#1| 0)} is VALID [2022-02-20 14:06:50,442 INFO L290 TraceCheckUtils]: 11: Hoare triple {700#(= |ULTIMATE.start_main_~b~0#1| 0)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {700#(= |ULTIMATE.start_main_~b~0#1| 0)} is VALID [2022-02-20 14:06:50,443 INFO L290 TraceCheckUtils]: 12: Hoare triple {700#(= |ULTIMATE.start_main_~b~0#1| 0)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {700#(= |ULTIMATE.start_main_~b~0#1| 0)} is VALID [2022-02-20 14:06:50,443 INFO L290 TraceCheckUtils]: 13: Hoare triple {700#(= |ULTIMATE.start_main_~b~0#1| 0)} main_~a~0#1 := 1 + main_~a~0#1; {700#(= |ULTIMATE.start_main_~b~0#1| 0)} is VALID [2022-02-20 14:06:50,444 INFO L290 TraceCheckUtils]: 14: Hoare triple {700#(= |ULTIMATE.start_main_~b~0#1| 0)} assume !(main_~a~0#1 < 100000); {700#(= |ULTIMATE.start_main_~b~0#1| 0)} is VALID [2022-02-20 14:06:50,444 INFO L290 TraceCheckUtils]: 15: Hoare triple {700#(= |ULTIMATE.start_main_~b~0#1| 0)} main_~a~0#1 := 0; {700#(= |ULTIMATE.start_main_~b~0#1| 0)} is VALID [2022-02-20 14:06:50,444 INFO L290 TraceCheckUtils]: 16: Hoare triple {700#(= |ULTIMATE.start_main_~b~0#1| 0)} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {700#(= |ULTIMATE.start_main_~b~0#1| 0)} is VALID [2022-02-20 14:06:50,445 INFO L290 TraceCheckUtils]: 17: Hoare triple {700#(= |ULTIMATE.start_main_~b~0#1| 0)} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {700#(= |ULTIMATE.start_main_~b~0#1| 0)} is VALID [2022-02-20 14:06:50,445 INFO L290 TraceCheckUtils]: 18: Hoare triple {700#(= |ULTIMATE.start_main_~b~0#1| 0)} main_~a~0#1 := 1 + main_~a~0#1; {700#(= |ULTIMATE.start_main_~b~0#1| 0)} is VALID [2022-02-20 14:06:50,446 INFO L290 TraceCheckUtils]: 19: Hoare triple {700#(= |ULTIMATE.start_main_~b~0#1| 0)} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {700#(= |ULTIMATE.start_main_~b~0#1| 0)} is VALID [2022-02-20 14:06:50,446 INFO L290 TraceCheckUtils]: 20: Hoare triple {700#(= |ULTIMATE.start_main_~b~0#1| 0)} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {700#(= |ULTIMATE.start_main_~b~0#1| 0)} is VALID [2022-02-20 14:06:50,447 INFO L290 TraceCheckUtils]: 21: Hoare triple {700#(= |ULTIMATE.start_main_~b~0#1| 0)} main_~a~0#1 := 1 + main_~a~0#1; {700#(= |ULTIMATE.start_main_~b~0#1| 0)} is VALID [2022-02-20 14:06:50,447 INFO L290 TraceCheckUtils]: 22: Hoare triple {700#(= |ULTIMATE.start_main_~b~0#1| 0)} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {700#(= |ULTIMATE.start_main_~b~0#1| 0)} is VALID [2022-02-20 14:06:50,448 INFO L290 TraceCheckUtils]: 23: Hoare triple {700#(= |ULTIMATE.start_main_~b~0#1| 0)} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {700#(= |ULTIMATE.start_main_~b~0#1| 0)} is VALID [2022-02-20 14:06:50,448 INFO L290 TraceCheckUtils]: 24: Hoare triple {700#(= |ULTIMATE.start_main_~b~0#1| 0)} main_~a~0#1 := 1 + main_~a~0#1; {700#(= |ULTIMATE.start_main_~b~0#1| 0)} is VALID [2022-02-20 14:06:50,449 INFO L290 TraceCheckUtils]: 25: Hoare triple {700#(= |ULTIMATE.start_main_~b~0#1| 0)} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {700#(= |ULTIMATE.start_main_~b~0#1| 0)} is VALID [2022-02-20 14:06:50,450 INFO L290 TraceCheckUtils]: 26: Hoare triple {700#(= |ULTIMATE.start_main_~b~0#1| 0)} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {700#(= |ULTIMATE.start_main_~b~0#1| 0)} is VALID [2022-02-20 14:06:50,451 INFO L290 TraceCheckUtils]: 27: Hoare triple {700#(= |ULTIMATE.start_main_~b~0#1| 0)} main_~a~0#1 := 1 + main_~a~0#1; {700#(= |ULTIMATE.start_main_~b~0#1| 0)} is VALID [2022-02-20 14:06:50,453 INFO L290 TraceCheckUtils]: 28: Hoare triple {700#(= |ULTIMATE.start_main_~b~0#1| 0)} assume !(main_~a~0#1 < 100000); {700#(= |ULTIMATE.start_main_~b~0#1| 0)} is VALID [2022-02-20 14:06:50,453 INFO L290 TraceCheckUtils]: 29: Hoare triple {700#(= |ULTIMATE.start_main_~b~0#1| 0)} havoc main_~x~0#1;main_~x~0#1 := 0; {701#(and (= |ULTIMATE.start_main_~b~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 14:06:50,454 INFO L290 TraceCheckUtils]: 30: Hoare triple {701#(and (= |ULTIMATE.start_main_~b~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !!(main_~x~0#1 < main_~b~0#1);call main_#t~mem7#1 := read~int(main_~#bb~0#1.base, main_~#bb~0#1.offset + 4 * main_~x~0#1, 4); {699#false} is VALID [2022-02-20 14:06:50,454 INFO L272 TraceCheckUtils]: 31: Hoare triple {699#false} call __VERIFIER_assert((if main_#t~mem7#1 >= 0 then 1 else 0)); {699#false} is VALID [2022-02-20 14:06:50,454 INFO L290 TraceCheckUtils]: 32: Hoare triple {699#false} ~cond := #in~cond; {699#false} is VALID [2022-02-20 14:06:50,455 INFO L290 TraceCheckUtils]: 33: Hoare triple {699#false} assume 0 == ~cond; {699#false} is VALID [2022-02-20 14:06:50,455 INFO L290 TraceCheckUtils]: 34: Hoare triple {699#false} assume !false; {699#false} is VALID [2022-02-20 14:06:50,455 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-02-20 14:06:50,456 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:06:50,456 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486341247] [2022-02-20 14:06:50,456 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486341247] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:06:50,456 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:06:50,456 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 14:06:50,456 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245395754] [2022-02-20 14:06:50,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:06:50,457 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-02-20 14:06:50,457 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:06:50,458 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:06:50,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:06:50,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:06:50,475 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:06:50,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:06:50,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:06:50,476 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:06:50,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:06:50,591 INFO L93 Difference]: Finished difference Result 96 states and 122 transitions. [2022-02-20 14:06:50,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 14:06:50,592 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-02-20 14:06:50,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:06:50,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:06:50,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2022-02-20 14:06:50,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:06:50,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2022-02-20 14:06:50,601 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 73 transitions. [2022-02-20 14:06:50,661 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:06:50,664 INFO L225 Difference]: With dead ends: 96 [2022-02-20 14:06:50,665 INFO L226 Difference]: Without dead ends: 81 [2022-02-20 14:06:50,665 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:06:50,666 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 8 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:06:50,666 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 81 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:06:50,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-02-20 14:06:50,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 72. [2022-02-20 14:06:50,681 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:06:50,682 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 72 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 68 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:06:50,682 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 72 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 68 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:06:50,682 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 72 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 68 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:06:50,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:06:50,685 INFO L93 Difference]: Finished difference Result 81 states and 104 transitions. [2022-02-20 14:06:50,685 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 104 transitions. [2022-02-20 14:06:50,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:06:50,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:06:50,686 INFO L74 IsIncluded]: Start isIncluded. First operand has 72 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 68 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 81 states. [2022-02-20 14:06:50,687 INFO L87 Difference]: Start difference. First operand has 72 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 68 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 81 states. [2022-02-20 14:06:50,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:06:50,690 INFO L93 Difference]: Finished difference Result 81 states and 104 transitions. [2022-02-20 14:06:50,690 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 104 transitions. [2022-02-20 14:06:50,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:06:50,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:06:50,691 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:06:50,691 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:06:50,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 68 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:06:50,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 93 transitions. [2022-02-20 14:06:50,693 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 93 transitions. Word has length 35 [2022-02-20 14:06:50,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:06:50,694 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 93 transitions. [2022-02-20 14:06:50,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:06:50,694 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 93 transitions. [2022-02-20 14:06:50,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 14:06:50,695 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:06:50,700 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:06:50,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 14:06:50,701 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:06:50,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:06:50,702 INFO L85 PathProgramCache]: Analyzing trace with hash 748532586, now seen corresponding path program 1 times [2022-02-20 14:06:50,702 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:06:50,703 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927228962] [2022-02-20 14:06:50,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:06:50,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:06:50,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:06:50,817 INFO L290 TraceCheckUtils]: 0: Hoare triple {1093#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); {1093#true} is VALID [2022-02-20 14:06:50,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {1093#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~#bb~0#1.base, main_~#bb~0#1.offset, main_~#cc~0#1.base, main_~#cc~0#1.offset, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;main_~b~0#1 := 0;main_~c~0#1 := 0;call main_~#bb~0#1.base, main_~#bb~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#cc~0#1.base, main_~#cc~0#1.offset := #Ultimate.allocOnStack(400000); {1095#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:06:50,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {1095#(= |ULTIMATE.start_main_~a~0#1| 0)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {1095#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:06:50,819 INFO L290 TraceCheckUtils]: 3: Hoare triple {1095#(= |ULTIMATE.start_main_~a~0#1| 0)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {1095#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:06:50,820 INFO L290 TraceCheckUtils]: 4: Hoare triple {1095#(= |ULTIMATE.start_main_~a~0#1| 0)} main_~a~0#1 := 1 + main_~a~0#1; {1096#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:06:50,820 INFO L290 TraceCheckUtils]: 5: Hoare triple {1096#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {1096#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:06:50,821 INFO L290 TraceCheckUtils]: 6: Hoare triple {1096#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {1096#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:06:50,822 INFO L290 TraceCheckUtils]: 7: Hoare triple {1096#(<= |ULTIMATE.start_main_~a~0#1| 1)} main_~a~0#1 := 1 + main_~a~0#1; {1097#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:06:50,822 INFO L290 TraceCheckUtils]: 8: Hoare triple {1097#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {1097#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:06:50,830 INFO L290 TraceCheckUtils]: 9: Hoare triple {1097#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {1097#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:06:50,831 INFO L290 TraceCheckUtils]: 10: Hoare triple {1097#(<= |ULTIMATE.start_main_~a~0#1| 2)} main_~a~0#1 := 1 + main_~a~0#1; {1098#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:06:50,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {1098#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {1098#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:06:50,832 INFO L290 TraceCheckUtils]: 12: Hoare triple {1098#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume main_#t~mem2#1 >= 0;havoc main_#t~mem2#1;call main_#t~mem3#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem3#1, main_~#bb~0#1.base, main_~#bb~0#1.offset + 4 * main_~b~0#1, 4);havoc main_#t~mem3#1;main_~b~0#1 := 1 + main_~b~0#1; {1098#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:06:50,833 INFO L290 TraceCheckUtils]: 13: Hoare triple {1098#(<= |ULTIMATE.start_main_~a~0#1| 3)} main_~a~0#1 := 1 + main_~a~0#1; {1099#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:06:50,833 INFO L290 TraceCheckUtils]: 14: Hoare triple {1099#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume !(main_~a~0#1 < 100000); {1094#false} is VALID [2022-02-20 14:06:50,833 INFO L290 TraceCheckUtils]: 15: Hoare triple {1094#false} main_~a~0#1 := 0; {1094#false} is VALID [2022-02-20 14:06:50,834 INFO L290 TraceCheckUtils]: 16: Hoare triple {1094#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {1094#false} is VALID [2022-02-20 14:06:50,834 INFO L290 TraceCheckUtils]: 17: Hoare triple {1094#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {1094#false} is VALID [2022-02-20 14:06:50,834 INFO L290 TraceCheckUtils]: 18: Hoare triple {1094#false} main_~a~0#1 := 1 + main_~a~0#1; {1094#false} is VALID [2022-02-20 14:06:50,834 INFO L290 TraceCheckUtils]: 19: Hoare triple {1094#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {1094#false} is VALID [2022-02-20 14:06:50,834 INFO L290 TraceCheckUtils]: 20: Hoare triple {1094#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {1094#false} is VALID [2022-02-20 14:06:50,834 INFO L290 TraceCheckUtils]: 21: Hoare triple {1094#false} main_~a~0#1 := 1 + main_~a~0#1; {1094#false} is VALID [2022-02-20 14:06:50,834 INFO L290 TraceCheckUtils]: 22: Hoare triple {1094#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {1094#false} is VALID [2022-02-20 14:06:50,835 INFO L290 TraceCheckUtils]: 23: Hoare triple {1094#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {1094#false} is VALID [2022-02-20 14:06:50,835 INFO L290 TraceCheckUtils]: 24: Hoare triple {1094#false} main_~a~0#1 := 1 + main_~a~0#1; {1094#false} is VALID [2022-02-20 14:06:50,835 INFO L290 TraceCheckUtils]: 25: Hoare triple {1094#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {1094#false} is VALID [2022-02-20 14:06:50,835 INFO L290 TraceCheckUtils]: 26: Hoare triple {1094#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {1094#false} is VALID [2022-02-20 14:06:50,835 INFO L290 TraceCheckUtils]: 27: Hoare triple {1094#false} main_~a~0#1 := 1 + main_~a~0#1; {1094#false} is VALID [2022-02-20 14:06:50,835 INFO L290 TraceCheckUtils]: 28: Hoare triple {1094#false} assume !(main_~a~0#1 < 100000); {1094#false} is VALID [2022-02-20 14:06:50,835 INFO L290 TraceCheckUtils]: 29: Hoare triple {1094#false} havoc main_~x~0#1;main_~x~0#1 := 0; {1094#false} is VALID [2022-02-20 14:06:50,835 INFO L290 TraceCheckUtils]: 30: Hoare triple {1094#false} assume !!(main_~x~0#1 < main_~b~0#1);call main_#t~mem7#1 := read~int(main_~#bb~0#1.base, main_~#bb~0#1.offset + 4 * main_~x~0#1, 4); {1094#false} is VALID [2022-02-20 14:06:50,836 INFO L272 TraceCheckUtils]: 31: Hoare triple {1094#false} call __VERIFIER_assert((if main_#t~mem7#1 >= 0 then 1 else 0)); {1094#false} is VALID [2022-02-20 14:06:50,836 INFO L290 TraceCheckUtils]: 32: Hoare triple {1094#false} ~cond := #in~cond; {1094#false} is VALID [2022-02-20 14:06:50,836 INFO L290 TraceCheckUtils]: 33: Hoare triple {1094#false} assume 0 == ~cond; {1094#false} is VALID [2022-02-20 14:06:50,836 INFO L290 TraceCheckUtils]: 34: Hoare triple {1094#false} assume !false; {1094#false} is VALID [2022-02-20 14:06:50,836 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-02-20 14:06:50,836 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:06:50,836 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927228962] [2022-02-20 14:06:50,837 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927228962] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:06:50,837 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772854373] [2022-02-20 14:06:50,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:06:50,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:06:50,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:06:50,839 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:06:50,850 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:06:50,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:06:50,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:06:50,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:06:50,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:06:51,109 INFO L290 TraceCheckUtils]: 0: Hoare triple {1093#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); {1093#true} is VALID [2022-02-20 14:06:51,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {1093#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~#bb~0#1.base, main_~#bb~0#1.offset, main_~#cc~0#1.base, main_~#cc~0#1.offset, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;main_~b~0#1 := 0;main_~c~0#1 := 0;call main_~#bb~0#1.base, main_~#bb~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#cc~0#1.base, main_~#cc~0#1.offset := #Ultimate.allocOnStack(400000); {1106#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:06:51,111 INFO L290 TraceCheckUtils]: 2: Hoare triple {1106#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {1106#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:06:51,111 INFO L290 TraceCheckUtils]: 3: Hoare triple {1106#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {1106#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:06:51,112 INFO L290 TraceCheckUtils]: 4: Hoare triple {1106#(<= |ULTIMATE.start_main_~a~0#1| 0)} main_~a~0#1 := 1 + main_~a~0#1; {1096#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:06:51,112 INFO L290 TraceCheckUtils]: 5: Hoare triple {1096#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {1096#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:06:51,113 INFO L290 TraceCheckUtils]: 6: Hoare triple {1096#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {1096#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:06:51,114 INFO L290 TraceCheckUtils]: 7: Hoare triple {1096#(<= |ULTIMATE.start_main_~a~0#1| 1)} main_~a~0#1 := 1 + main_~a~0#1; {1097#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:06:51,115 INFO L290 TraceCheckUtils]: 8: Hoare triple {1097#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {1097#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:06:51,115 INFO L290 TraceCheckUtils]: 9: Hoare triple {1097#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {1097#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:06:51,116 INFO L290 TraceCheckUtils]: 10: Hoare triple {1097#(<= |ULTIMATE.start_main_~a~0#1| 2)} main_~a~0#1 := 1 + main_~a~0#1; {1098#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:06:51,116 INFO L290 TraceCheckUtils]: 11: Hoare triple {1098#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {1098#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:06:51,117 INFO L290 TraceCheckUtils]: 12: Hoare triple {1098#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume main_#t~mem2#1 >= 0;havoc main_#t~mem2#1;call main_#t~mem3#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem3#1, main_~#bb~0#1.base, main_~#bb~0#1.offset + 4 * main_~b~0#1, 4);havoc main_#t~mem3#1;main_~b~0#1 := 1 + main_~b~0#1; {1098#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:06:51,118 INFO L290 TraceCheckUtils]: 13: Hoare triple {1098#(<= |ULTIMATE.start_main_~a~0#1| 3)} main_~a~0#1 := 1 + main_~a~0#1; {1099#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:06:51,118 INFO L290 TraceCheckUtils]: 14: Hoare triple {1099#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume !(main_~a~0#1 < 100000); {1094#false} is VALID [2022-02-20 14:06:51,118 INFO L290 TraceCheckUtils]: 15: Hoare triple {1094#false} main_~a~0#1 := 0; {1094#false} is VALID [2022-02-20 14:06:51,119 INFO L290 TraceCheckUtils]: 16: Hoare triple {1094#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {1094#false} is VALID [2022-02-20 14:06:51,119 INFO L290 TraceCheckUtils]: 17: Hoare triple {1094#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {1094#false} is VALID [2022-02-20 14:06:51,119 INFO L290 TraceCheckUtils]: 18: Hoare triple {1094#false} main_~a~0#1 := 1 + main_~a~0#1; {1094#false} is VALID [2022-02-20 14:06:51,119 INFO L290 TraceCheckUtils]: 19: Hoare triple {1094#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {1094#false} is VALID [2022-02-20 14:06:51,119 INFO L290 TraceCheckUtils]: 20: Hoare triple {1094#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {1094#false} is VALID [2022-02-20 14:06:51,119 INFO L290 TraceCheckUtils]: 21: Hoare triple {1094#false} main_~a~0#1 := 1 + main_~a~0#1; {1094#false} is VALID [2022-02-20 14:06:51,120 INFO L290 TraceCheckUtils]: 22: Hoare triple {1094#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {1094#false} is VALID [2022-02-20 14:06:51,120 INFO L290 TraceCheckUtils]: 23: Hoare triple {1094#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {1094#false} is VALID [2022-02-20 14:06:51,120 INFO L290 TraceCheckUtils]: 24: Hoare triple {1094#false} main_~a~0#1 := 1 + main_~a~0#1; {1094#false} is VALID [2022-02-20 14:06:51,120 INFO L290 TraceCheckUtils]: 25: Hoare triple {1094#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {1094#false} is VALID [2022-02-20 14:06:51,120 INFO L290 TraceCheckUtils]: 26: Hoare triple {1094#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {1094#false} is VALID [2022-02-20 14:06:51,121 INFO L290 TraceCheckUtils]: 27: Hoare triple {1094#false} main_~a~0#1 := 1 + main_~a~0#1; {1094#false} is VALID [2022-02-20 14:06:51,121 INFO L290 TraceCheckUtils]: 28: Hoare triple {1094#false} assume !(main_~a~0#1 < 100000); {1094#false} is VALID [2022-02-20 14:06:51,121 INFO L290 TraceCheckUtils]: 29: Hoare triple {1094#false} havoc main_~x~0#1;main_~x~0#1 := 0; {1094#false} is VALID [2022-02-20 14:06:51,121 INFO L290 TraceCheckUtils]: 30: Hoare triple {1094#false} assume !!(main_~x~0#1 < main_~b~0#1);call main_#t~mem7#1 := read~int(main_~#bb~0#1.base, main_~#bb~0#1.offset + 4 * main_~x~0#1, 4); {1094#false} is VALID [2022-02-20 14:06:51,121 INFO L272 TraceCheckUtils]: 31: Hoare triple {1094#false} call __VERIFIER_assert((if main_#t~mem7#1 >= 0 then 1 else 0)); {1094#false} is VALID [2022-02-20 14:06:51,122 INFO L290 TraceCheckUtils]: 32: Hoare triple {1094#false} ~cond := #in~cond; {1094#false} is VALID [2022-02-20 14:06:51,122 INFO L290 TraceCheckUtils]: 33: Hoare triple {1094#false} assume 0 == ~cond; {1094#false} is VALID [2022-02-20 14:06:51,122 INFO L290 TraceCheckUtils]: 34: Hoare triple {1094#false} assume !false; {1094#false} is VALID [2022-02-20 14:06:51,122 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-02-20 14:06:51,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:06:51,326 INFO L290 TraceCheckUtils]: 34: Hoare triple {1094#false} assume !false; {1094#false} is VALID [2022-02-20 14:06:51,327 INFO L290 TraceCheckUtils]: 33: Hoare triple {1094#false} assume 0 == ~cond; {1094#false} is VALID [2022-02-20 14:06:51,327 INFO L290 TraceCheckUtils]: 32: Hoare triple {1094#false} ~cond := #in~cond; {1094#false} is VALID [2022-02-20 14:06:51,327 INFO L272 TraceCheckUtils]: 31: Hoare triple {1094#false} call __VERIFIER_assert((if main_#t~mem7#1 >= 0 then 1 else 0)); {1094#false} is VALID [2022-02-20 14:06:51,327 INFO L290 TraceCheckUtils]: 30: Hoare triple {1094#false} assume !!(main_~x~0#1 < main_~b~0#1);call main_#t~mem7#1 := read~int(main_~#bb~0#1.base, main_~#bb~0#1.offset + 4 * main_~x~0#1, 4); {1094#false} is VALID [2022-02-20 14:06:51,327 INFO L290 TraceCheckUtils]: 29: Hoare triple {1094#false} havoc main_~x~0#1;main_~x~0#1 := 0; {1094#false} is VALID [2022-02-20 14:06:51,327 INFO L290 TraceCheckUtils]: 28: Hoare triple {1094#false} assume !(main_~a~0#1 < 100000); {1094#false} is VALID [2022-02-20 14:06:51,327 INFO L290 TraceCheckUtils]: 27: Hoare triple {1094#false} main_~a~0#1 := 1 + main_~a~0#1; {1094#false} is VALID [2022-02-20 14:06:51,328 INFO L290 TraceCheckUtils]: 26: Hoare triple {1094#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {1094#false} is VALID [2022-02-20 14:06:51,328 INFO L290 TraceCheckUtils]: 25: Hoare triple {1094#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {1094#false} is VALID [2022-02-20 14:06:51,328 INFO L290 TraceCheckUtils]: 24: Hoare triple {1094#false} main_~a~0#1 := 1 + main_~a~0#1; {1094#false} is VALID [2022-02-20 14:06:51,328 INFO L290 TraceCheckUtils]: 23: Hoare triple {1094#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {1094#false} is VALID [2022-02-20 14:06:51,328 INFO L290 TraceCheckUtils]: 22: Hoare triple {1094#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {1094#false} is VALID [2022-02-20 14:06:51,328 INFO L290 TraceCheckUtils]: 21: Hoare triple {1094#false} main_~a~0#1 := 1 + main_~a~0#1; {1094#false} is VALID [2022-02-20 14:06:51,328 INFO L290 TraceCheckUtils]: 20: Hoare triple {1094#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {1094#false} is VALID [2022-02-20 14:06:51,328 INFO L290 TraceCheckUtils]: 19: Hoare triple {1094#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {1094#false} is VALID [2022-02-20 14:06:51,329 INFO L290 TraceCheckUtils]: 18: Hoare triple {1094#false} main_~a~0#1 := 1 + main_~a~0#1; {1094#false} is VALID [2022-02-20 14:06:51,329 INFO L290 TraceCheckUtils]: 17: Hoare triple {1094#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {1094#false} is VALID [2022-02-20 14:06:51,329 INFO L290 TraceCheckUtils]: 16: Hoare triple {1094#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {1094#false} is VALID [2022-02-20 14:06:51,329 INFO L290 TraceCheckUtils]: 15: Hoare triple {1094#false} main_~a~0#1 := 0; {1094#false} is VALID [2022-02-20 14:06:51,329 INFO L290 TraceCheckUtils]: 14: Hoare triple {1266#(< |ULTIMATE.start_main_~a~0#1| 100000)} assume !(main_~a~0#1 < 100000); {1094#false} is VALID [2022-02-20 14:06:51,330 INFO L290 TraceCheckUtils]: 13: Hoare triple {1270#(< |ULTIMATE.start_main_~a~0#1| 99999)} main_~a~0#1 := 1 + main_~a~0#1; {1266#(< |ULTIMATE.start_main_~a~0#1| 100000)} is VALID [2022-02-20 14:06:51,330 INFO L290 TraceCheckUtils]: 12: Hoare triple {1270#(< |ULTIMATE.start_main_~a~0#1| 99999)} assume main_#t~mem2#1 >= 0;havoc main_#t~mem2#1;call main_#t~mem3#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem3#1, main_~#bb~0#1.base, main_~#bb~0#1.offset + 4 * main_~b~0#1, 4);havoc main_#t~mem3#1;main_~b~0#1 := 1 + main_~b~0#1; {1270#(< |ULTIMATE.start_main_~a~0#1| 99999)} is VALID [2022-02-20 14:06:51,331 INFO L290 TraceCheckUtils]: 11: Hoare triple {1270#(< |ULTIMATE.start_main_~a~0#1| 99999)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {1270#(< |ULTIMATE.start_main_~a~0#1| 99999)} is VALID [2022-02-20 14:06:51,331 INFO L290 TraceCheckUtils]: 10: Hoare triple {1280#(< |ULTIMATE.start_main_~a~0#1| 99998)} main_~a~0#1 := 1 + main_~a~0#1; {1270#(< |ULTIMATE.start_main_~a~0#1| 99999)} is VALID [2022-02-20 14:06:51,332 INFO L290 TraceCheckUtils]: 9: Hoare triple {1280#(< |ULTIMATE.start_main_~a~0#1| 99998)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {1280#(< |ULTIMATE.start_main_~a~0#1| 99998)} is VALID [2022-02-20 14:06:51,333 INFO L290 TraceCheckUtils]: 8: Hoare triple {1280#(< |ULTIMATE.start_main_~a~0#1| 99998)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {1280#(< |ULTIMATE.start_main_~a~0#1| 99998)} is VALID [2022-02-20 14:06:51,333 INFO L290 TraceCheckUtils]: 7: Hoare triple {1290#(< |ULTIMATE.start_main_~a~0#1| 99997)} main_~a~0#1 := 1 + main_~a~0#1; {1280#(< |ULTIMATE.start_main_~a~0#1| 99998)} is VALID [2022-02-20 14:06:51,333 INFO L290 TraceCheckUtils]: 6: Hoare triple {1290#(< |ULTIMATE.start_main_~a~0#1| 99997)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {1290#(< |ULTIMATE.start_main_~a~0#1| 99997)} is VALID [2022-02-20 14:06:51,334 INFO L290 TraceCheckUtils]: 5: Hoare triple {1290#(< |ULTIMATE.start_main_~a~0#1| 99997)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {1290#(< |ULTIMATE.start_main_~a~0#1| 99997)} is VALID [2022-02-20 14:06:51,334 INFO L290 TraceCheckUtils]: 4: Hoare triple {1300#(< |ULTIMATE.start_main_~a~0#1| 99996)} main_~a~0#1 := 1 + main_~a~0#1; {1290#(< |ULTIMATE.start_main_~a~0#1| 99997)} is VALID [2022-02-20 14:06:51,335 INFO L290 TraceCheckUtils]: 3: Hoare triple {1300#(< |ULTIMATE.start_main_~a~0#1| 99996)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {1300#(< |ULTIMATE.start_main_~a~0#1| 99996)} is VALID [2022-02-20 14:06:51,335 INFO L290 TraceCheckUtils]: 2: Hoare triple {1300#(< |ULTIMATE.start_main_~a~0#1| 99996)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {1300#(< |ULTIMATE.start_main_~a~0#1| 99996)} is VALID [2022-02-20 14:06:51,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {1093#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~#bb~0#1.base, main_~#bb~0#1.offset, main_~#cc~0#1.base, main_~#cc~0#1.offset, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;main_~b~0#1 := 0;main_~c~0#1 := 0;call main_~#bb~0#1.base, main_~#bb~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#cc~0#1.base, main_~#cc~0#1.offset := #Ultimate.allocOnStack(400000); {1300#(< |ULTIMATE.start_main_~a~0#1| 99996)} is VALID [2022-02-20 14:06:51,336 INFO L290 TraceCheckUtils]: 0: Hoare triple {1093#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); {1093#true} is VALID [2022-02-20 14:06:51,336 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-02-20 14:06:51,337 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772854373] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:06:51,337 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:06:51,337 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-02-20 14:06:51,337 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653905221] [2022-02-20 14:06:51,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:06:51,338 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-02-20 14:06:51,338 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:06:51,338 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:06:51,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:06:51,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 14:06:51,377 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:06:51,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 14:06:51,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-02-20 14:06:51,378 INFO L87 Difference]: Start difference. First operand 72 states and 93 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:06:51,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:06:51,691 INFO L93 Difference]: Finished difference Result 190 states and 271 transitions. [2022-02-20 14:06:51,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 14:06:51,691 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-02-20 14:06:51,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:06:51,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:06:51,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 141 transitions. [2022-02-20 14:06:51,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:06:51,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 141 transitions. [2022-02-20 14:06:51,697 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 141 transitions. [2022-02-20 14:06:51,810 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:06:51,816 INFO L225 Difference]: With dead ends: 190 [2022-02-20 14:06:51,816 INFO L226 Difference]: Without dead ends: 144 [2022-02-20 14:06:51,817 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-02-20 14:06:51,818 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 130 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:06:51,818 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 81 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:06:51,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-02-20 14:06:51,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2022-02-20 14:06:51,848 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:06:51,849 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand has 144 states, 140 states have (on average 1.3214285714285714) internal successors, (185), 140 states have internal predecessors, (185), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:06:51,849 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand has 144 states, 140 states have (on average 1.3214285714285714) internal successors, (185), 140 states have internal predecessors, (185), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:06:51,850 INFO L87 Difference]: Start difference. First operand 144 states. Second operand has 144 states, 140 states have (on average 1.3214285714285714) internal successors, (185), 140 states have internal predecessors, (185), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:06:51,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:06:51,855 INFO L93 Difference]: Finished difference Result 144 states and 189 transitions. [2022-02-20 14:06:51,855 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 189 transitions. [2022-02-20 14:06:51,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:06:51,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:06:51,856 INFO L74 IsIncluded]: Start isIncluded. First operand has 144 states, 140 states have (on average 1.3214285714285714) internal successors, (185), 140 states have internal predecessors, (185), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 144 states. [2022-02-20 14:06:51,857 INFO L87 Difference]: Start difference. First operand has 144 states, 140 states have (on average 1.3214285714285714) internal successors, (185), 140 states have internal predecessors, (185), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 144 states. [2022-02-20 14:06:51,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:06:51,861 INFO L93 Difference]: Finished difference Result 144 states and 189 transitions. [2022-02-20 14:06:51,861 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 189 transitions. [2022-02-20 14:06:51,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:06:51,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:06:51,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:06:51,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:06:51,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 140 states have (on average 1.3214285714285714) internal successors, (185), 140 states have internal predecessors, (185), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:06:51,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 189 transitions. [2022-02-20 14:06:51,867 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 189 transitions. Word has length 35 [2022-02-20 14:06:51,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:06:51,867 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 189 transitions. [2022-02-20 14:06:51,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:06:51,868 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 189 transitions. [2022-02-20 14:06:51,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-02-20 14:06:51,869 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:06:51,869 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:06:51,895 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:06:52,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:06:52,088 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:06:52,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:06:52,088 INFO L85 PathProgramCache]: Analyzing trace with hash -737484630, now seen corresponding path program 2 times [2022-02-20 14:06:52,088 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:06:52,088 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378326710] [2022-02-20 14:06:52,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:06:52,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:06:52,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:06:52,281 INFO L290 TraceCheckUtils]: 0: Hoare triple {2048#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); {2048#true} is VALID [2022-02-20 14:06:52,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {2048#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~#bb~0#1.base, main_~#bb~0#1.offset, main_~#cc~0#1.base, main_~#cc~0#1.offset, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;main_~b~0#1 := 0;main_~c~0#1 := 0;call main_~#bb~0#1.base, main_~#bb~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#cc~0#1.base, main_~#cc~0#1.offset := #Ultimate.allocOnStack(400000); {2050#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:06:52,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {2050#(= |ULTIMATE.start_main_~a~0#1| 0)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2050#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:06:52,282 INFO L290 TraceCheckUtils]: 3: Hoare triple {2050#(= |ULTIMATE.start_main_~a~0#1| 0)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {2050#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:06:52,283 INFO L290 TraceCheckUtils]: 4: Hoare triple {2050#(= |ULTIMATE.start_main_~a~0#1| 0)} main_~a~0#1 := 1 + main_~a~0#1; {2051#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:06:52,283 INFO L290 TraceCheckUtils]: 5: Hoare triple {2051#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2051#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:06:52,284 INFO L290 TraceCheckUtils]: 6: Hoare triple {2051#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {2051#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:06:52,284 INFO L290 TraceCheckUtils]: 7: Hoare triple {2051#(<= |ULTIMATE.start_main_~a~0#1| 1)} main_~a~0#1 := 1 + main_~a~0#1; {2052#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:06:52,284 INFO L290 TraceCheckUtils]: 8: Hoare triple {2052#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2052#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:06:52,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {2052#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {2052#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:06:52,285 INFO L290 TraceCheckUtils]: 10: Hoare triple {2052#(<= |ULTIMATE.start_main_~a~0#1| 2)} main_~a~0#1 := 1 + main_~a~0#1; {2053#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:06:52,286 INFO L290 TraceCheckUtils]: 11: Hoare triple {2053#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2053#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:06:52,286 INFO L290 TraceCheckUtils]: 12: Hoare triple {2053#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {2053#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:06:52,287 INFO L290 TraceCheckUtils]: 13: Hoare triple {2053#(<= |ULTIMATE.start_main_~a~0#1| 3)} main_~a~0#1 := 1 + main_~a~0#1; {2054#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:06:52,287 INFO L290 TraceCheckUtils]: 14: Hoare triple {2054#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2054#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:06:52,287 INFO L290 TraceCheckUtils]: 15: Hoare triple {2054#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {2054#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:06:52,288 INFO L290 TraceCheckUtils]: 16: Hoare triple {2054#(<= |ULTIMATE.start_main_~a~0#1| 4)} main_~a~0#1 := 1 + main_~a~0#1; {2055#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-20 14:06:52,288 INFO L290 TraceCheckUtils]: 17: Hoare triple {2055#(<= |ULTIMATE.start_main_~a~0#1| 5)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2055#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-20 14:06:52,289 INFO L290 TraceCheckUtils]: 18: Hoare triple {2055#(<= |ULTIMATE.start_main_~a~0#1| 5)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {2055#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-20 14:06:52,289 INFO L290 TraceCheckUtils]: 19: Hoare triple {2055#(<= |ULTIMATE.start_main_~a~0#1| 5)} main_~a~0#1 := 1 + main_~a~0#1; {2056#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-20 14:06:52,289 INFO L290 TraceCheckUtils]: 20: Hoare triple {2056#(<= |ULTIMATE.start_main_~a~0#1| 6)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2056#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-20 14:06:52,290 INFO L290 TraceCheckUtils]: 21: Hoare triple {2056#(<= |ULTIMATE.start_main_~a~0#1| 6)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {2056#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-20 14:06:52,290 INFO L290 TraceCheckUtils]: 22: Hoare triple {2056#(<= |ULTIMATE.start_main_~a~0#1| 6)} main_~a~0#1 := 1 + main_~a~0#1; {2057#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-20 14:06:52,291 INFO L290 TraceCheckUtils]: 23: Hoare triple {2057#(<= |ULTIMATE.start_main_~a~0#1| 7)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2057#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-20 14:06:52,291 INFO L290 TraceCheckUtils]: 24: Hoare triple {2057#(<= |ULTIMATE.start_main_~a~0#1| 7)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {2057#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-20 14:06:52,292 INFO L290 TraceCheckUtils]: 25: Hoare triple {2057#(<= |ULTIMATE.start_main_~a~0#1| 7)} main_~a~0#1 := 1 + main_~a~0#1; {2058#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-20 14:06:52,292 INFO L290 TraceCheckUtils]: 26: Hoare triple {2058#(<= |ULTIMATE.start_main_~a~0#1| 8)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2058#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-20 14:06:52,298 INFO L290 TraceCheckUtils]: 27: Hoare triple {2058#(<= |ULTIMATE.start_main_~a~0#1| 8)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {2058#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-20 14:06:52,299 INFO L290 TraceCheckUtils]: 28: Hoare triple {2058#(<= |ULTIMATE.start_main_~a~0#1| 8)} main_~a~0#1 := 1 + main_~a~0#1; {2059#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-20 14:06:52,299 INFO L290 TraceCheckUtils]: 29: Hoare triple {2059#(<= |ULTIMATE.start_main_~a~0#1| 9)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2059#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-20 14:06:52,299 INFO L290 TraceCheckUtils]: 30: Hoare triple {2059#(<= |ULTIMATE.start_main_~a~0#1| 9)} assume main_#t~mem2#1 >= 0;havoc main_#t~mem2#1;call main_#t~mem3#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem3#1, main_~#bb~0#1.base, main_~#bb~0#1.offset + 4 * main_~b~0#1, 4);havoc main_#t~mem3#1;main_~b~0#1 := 1 + main_~b~0#1; {2059#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-20 14:06:52,300 INFO L290 TraceCheckUtils]: 31: Hoare triple {2059#(<= |ULTIMATE.start_main_~a~0#1| 9)} main_~a~0#1 := 1 + main_~a~0#1; {2060#(<= |ULTIMATE.start_main_~a~0#1| 10)} is VALID [2022-02-20 14:06:52,300 INFO L290 TraceCheckUtils]: 32: Hoare triple {2060#(<= |ULTIMATE.start_main_~a~0#1| 10)} assume !(main_~a~0#1 < 100000); {2049#false} is VALID [2022-02-20 14:06:52,301 INFO L290 TraceCheckUtils]: 33: Hoare triple {2049#false} main_~a~0#1 := 0; {2049#false} is VALID [2022-02-20 14:06:52,301 INFO L290 TraceCheckUtils]: 34: Hoare triple {2049#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2049#false} is VALID [2022-02-20 14:06:52,301 INFO L290 TraceCheckUtils]: 35: Hoare triple {2049#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {2049#false} is VALID [2022-02-20 14:06:52,301 INFO L290 TraceCheckUtils]: 36: Hoare triple {2049#false} main_~a~0#1 := 1 + main_~a~0#1; {2049#false} is VALID [2022-02-20 14:06:52,301 INFO L290 TraceCheckUtils]: 37: Hoare triple {2049#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2049#false} is VALID [2022-02-20 14:06:52,301 INFO L290 TraceCheckUtils]: 38: Hoare triple {2049#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {2049#false} is VALID [2022-02-20 14:06:52,301 INFO L290 TraceCheckUtils]: 39: Hoare triple {2049#false} main_~a~0#1 := 1 + main_~a~0#1; {2049#false} is VALID [2022-02-20 14:06:52,301 INFO L290 TraceCheckUtils]: 40: Hoare triple {2049#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2049#false} is VALID [2022-02-20 14:06:52,302 INFO L290 TraceCheckUtils]: 41: Hoare triple {2049#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {2049#false} is VALID [2022-02-20 14:06:52,302 INFO L290 TraceCheckUtils]: 42: Hoare triple {2049#false} main_~a~0#1 := 1 + main_~a~0#1; {2049#false} is VALID [2022-02-20 14:06:52,302 INFO L290 TraceCheckUtils]: 43: Hoare triple {2049#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2049#false} is VALID [2022-02-20 14:06:52,302 INFO L290 TraceCheckUtils]: 44: Hoare triple {2049#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {2049#false} is VALID [2022-02-20 14:06:52,302 INFO L290 TraceCheckUtils]: 45: Hoare triple {2049#false} main_~a~0#1 := 1 + main_~a~0#1; {2049#false} is VALID [2022-02-20 14:06:52,302 INFO L290 TraceCheckUtils]: 46: Hoare triple {2049#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2049#false} is VALID [2022-02-20 14:06:52,302 INFO L290 TraceCheckUtils]: 47: Hoare triple {2049#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {2049#false} is VALID [2022-02-20 14:06:52,302 INFO L290 TraceCheckUtils]: 48: Hoare triple {2049#false} main_~a~0#1 := 1 + main_~a~0#1; {2049#false} is VALID [2022-02-20 14:06:52,303 INFO L290 TraceCheckUtils]: 49: Hoare triple {2049#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2049#false} is VALID [2022-02-20 14:06:52,303 INFO L290 TraceCheckUtils]: 50: Hoare triple {2049#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {2049#false} is VALID [2022-02-20 14:06:52,304 INFO L290 TraceCheckUtils]: 51: Hoare triple {2049#false} main_~a~0#1 := 1 + main_~a~0#1; {2049#false} is VALID [2022-02-20 14:06:52,304 INFO L290 TraceCheckUtils]: 52: Hoare triple {2049#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2049#false} is VALID [2022-02-20 14:06:52,304 INFO L290 TraceCheckUtils]: 53: Hoare triple {2049#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {2049#false} is VALID [2022-02-20 14:06:52,304 INFO L290 TraceCheckUtils]: 54: Hoare triple {2049#false} main_~a~0#1 := 1 + main_~a~0#1; {2049#false} is VALID [2022-02-20 14:06:52,304 INFO L290 TraceCheckUtils]: 55: Hoare triple {2049#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2049#false} is VALID [2022-02-20 14:06:52,304 INFO L290 TraceCheckUtils]: 56: Hoare triple {2049#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {2049#false} is VALID [2022-02-20 14:06:52,304 INFO L290 TraceCheckUtils]: 57: Hoare triple {2049#false} main_~a~0#1 := 1 + main_~a~0#1; {2049#false} is VALID [2022-02-20 14:06:52,304 INFO L290 TraceCheckUtils]: 58: Hoare triple {2049#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2049#false} is VALID [2022-02-20 14:06:52,305 INFO L290 TraceCheckUtils]: 59: Hoare triple {2049#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {2049#false} is VALID [2022-02-20 14:06:52,305 INFO L290 TraceCheckUtils]: 60: Hoare triple {2049#false} main_~a~0#1 := 1 + main_~a~0#1; {2049#false} is VALID [2022-02-20 14:06:52,305 INFO L290 TraceCheckUtils]: 61: Hoare triple {2049#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2049#false} is VALID [2022-02-20 14:06:52,305 INFO L290 TraceCheckUtils]: 62: Hoare triple {2049#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {2049#false} is VALID [2022-02-20 14:06:52,305 INFO L290 TraceCheckUtils]: 63: Hoare triple {2049#false} main_~a~0#1 := 1 + main_~a~0#1; {2049#false} is VALID [2022-02-20 14:06:52,305 INFO L290 TraceCheckUtils]: 64: Hoare triple {2049#false} assume !(main_~a~0#1 < 100000); {2049#false} is VALID [2022-02-20 14:06:52,305 INFO L290 TraceCheckUtils]: 65: Hoare triple {2049#false} havoc main_~x~0#1;main_~x~0#1 := 0; {2049#false} is VALID [2022-02-20 14:06:52,305 INFO L290 TraceCheckUtils]: 66: Hoare triple {2049#false} assume !!(main_~x~0#1 < main_~b~0#1);call main_#t~mem7#1 := read~int(main_~#bb~0#1.base, main_~#bb~0#1.offset + 4 * main_~x~0#1, 4); {2049#false} is VALID [2022-02-20 14:06:52,306 INFO L272 TraceCheckUtils]: 67: Hoare triple {2049#false} call __VERIFIER_assert((if main_#t~mem7#1 >= 0 then 1 else 0)); {2049#false} is VALID [2022-02-20 14:06:52,306 INFO L290 TraceCheckUtils]: 68: Hoare triple {2049#false} ~cond := #in~cond; {2049#false} is VALID [2022-02-20 14:06:52,306 INFO L290 TraceCheckUtils]: 69: Hoare triple {2049#false} assume 0 == ~cond; {2049#false} is VALID [2022-02-20 14:06:52,306 INFO L290 TraceCheckUtils]: 70: Hoare triple {2049#false} assume !false; {2049#false} is VALID [2022-02-20 14:06:52,306 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-02-20 14:06:52,307 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:06:52,307 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378326710] [2022-02-20 14:06:52,307 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378326710] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:06:52,307 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111432905] [2022-02-20 14:06:52,307 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:06:52,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:06:52,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:06:52,312 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:06:52,321 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:06:52,441 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:06:52,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:06:52,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 14:06:52,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:06:52,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:06:52,719 INFO L290 TraceCheckUtils]: 0: Hoare triple {2048#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); {2048#true} is VALID [2022-02-20 14:06:52,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {2048#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~#bb~0#1.base, main_~#bb~0#1.offset, main_~#cc~0#1.base, main_~#cc~0#1.offset, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;main_~b~0#1 := 0;main_~c~0#1 := 0;call main_~#bb~0#1.base, main_~#bb~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#cc~0#1.base, main_~#cc~0#1.offset := #Ultimate.allocOnStack(400000); {2067#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:06:52,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {2067#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2067#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:06:52,721 INFO L290 TraceCheckUtils]: 3: Hoare triple {2067#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {2067#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:06:52,721 INFO L290 TraceCheckUtils]: 4: Hoare triple {2067#(<= |ULTIMATE.start_main_~a~0#1| 0)} main_~a~0#1 := 1 + main_~a~0#1; {2051#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:06:52,723 INFO L290 TraceCheckUtils]: 5: Hoare triple {2051#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2051#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:06:52,723 INFO L290 TraceCheckUtils]: 6: Hoare triple {2051#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {2051#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:06:52,723 INFO L290 TraceCheckUtils]: 7: Hoare triple {2051#(<= |ULTIMATE.start_main_~a~0#1| 1)} main_~a~0#1 := 1 + main_~a~0#1; {2052#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:06:52,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {2052#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2052#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:06:52,724 INFO L290 TraceCheckUtils]: 9: Hoare triple {2052#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {2052#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:06:52,726 INFO L290 TraceCheckUtils]: 10: Hoare triple {2052#(<= |ULTIMATE.start_main_~a~0#1| 2)} main_~a~0#1 := 1 + main_~a~0#1; {2053#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:06:52,726 INFO L290 TraceCheckUtils]: 11: Hoare triple {2053#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2053#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:06:52,726 INFO L290 TraceCheckUtils]: 12: Hoare triple {2053#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {2053#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:06:52,727 INFO L290 TraceCheckUtils]: 13: Hoare triple {2053#(<= |ULTIMATE.start_main_~a~0#1| 3)} main_~a~0#1 := 1 + main_~a~0#1; {2054#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:06:52,727 INFO L290 TraceCheckUtils]: 14: Hoare triple {2054#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2054#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:06:52,727 INFO L290 TraceCheckUtils]: 15: Hoare triple {2054#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {2054#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:06:52,728 INFO L290 TraceCheckUtils]: 16: Hoare triple {2054#(<= |ULTIMATE.start_main_~a~0#1| 4)} main_~a~0#1 := 1 + main_~a~0#1; {2055#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-20 14:06:52,728 INFO L290 TraceCheckUtils]: 17: Hoare triple {2055#(<= |ULTIMATE.start_main_~a~0#1| 5)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2055#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-20 14:06:52,728 INFO L290 TraceCheckUtils]: 18: Hoare triple {2055#(<= |ULTIMATE.start_main_~a~0#1| 5)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {2055#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-20 14:06:52,729 INFO L290 TraceCheckUtils]: 19: Hoare triple {2055#(<= |ULTIMATE.start_main_~a~0#1| 5)} main_~a~0#1 := 1 + main_~a~0#1; {2056#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-20 14:06:52,730 INFO L290 TraceCheckUtils]: 20: Hoare triple {2056#(<= |ULTIMATE.start_main_~a~0#1| 6)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2056#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-20 14:06:52,731 INFO L290 TraceCheckUtils]: 21: Hoare triple {2056#(<= |ULTIMATE.start_main_~a~0#1| 6)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {2056#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-20 14:06:52,732 INFO L290 TraceCheckUtils]: 22: Hoare triple {2056#(<= |ULTIMATE.start_main_~a~0#1| 6)} main_~a~0#1 := 1 + main_~a~0#1; {2057#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-20 14:06:52,732 INFO L290 TraceCheckUtils]: 23: Hoare triple {2057#(<= |ULTIMATE.start_main_~a~0#1| 7)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2057#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-20 14:06:52,733 INFO L290 TraceCheckUtils]: 24: Hoare triple {2057#(<= |ULTIMATE.start_main_~a~0#1| 7)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {2057#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-20 14:06:52,733 INFO L290 TraceCheckUtils]: 25: Hoare triple {2057#(<= |ULTIMATE.start_main_~a~0#1| 7)} main_~a~0#1 := 1 + main_~a~0#1; {2058#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-20 14:06:52,734 INFO L290 TraceCheckUtils]: 26: Hoare triple {2058#(<= |ULTIMATE.start_main_~a~0#1| 8)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2058#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-20 14:06:52,734 INFO L290 TraceCheckUtils]: 27: Hoare triple {2058#(<= |ULTIMATE.start_main_~a~0#1| 8)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {2058#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-20 14:06:52,735 INFO L290 TraceCheckUtils]: 28: Hoare triple {2058#(<= |ULTIMATE.start_main_~a~0#1| 8)} main_~a~0#1 := 1 + main_~a~0#1; {2059#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-20 14:06:52,736 INFO L290 TraceCheckUtils]: 29: Hoare triple {2059#(<= |ULTIMATE.start_main_~a~0#1| 9)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2059#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-20 14:06:52,736 INFO L290 TraceCheckUtils]: 30: Hoare triple {2059#(<= |ULTIMATE.start_main_~a~0#1| 9)} assume main_#t~mem2#1 >= 0;havoc main_#t~mem2#1;call main_#t~mem3#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem3#1, main_~#bb~0#1.base, main_~#bb~0#1.offset + 4 * main_~b~0#1, 4);havoc main_#t~mem3#1;main_~b~0#1 := 1 + main_~b~0#1; {2059#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-20 14:06:52,737 INFO L290 TraceCheckUtils]: 31: Hoare triple {2059#(<= |ULTIMATE.start_main_~a~0#1| 9)} main_~a~0#1 := 1 + main_~a~0#1; {2060#(<= |ULTIMATE.start_main_~a~0#1| 10)} is VALID [2022-02-20 14:06:52,737 INFO L290 TraceCheckUtils]: 32: Hoare triple {2060#(<= |ULTIMATE.start_main_~a~0#1| 10)} assume !(main_~a~0#1 < 100000); {2049#false} is VALID [2022-02-20 14:06:52,737 INFO L290 TraceCheckUtils]: 33: Hoare triple {2049#false} main_~a~0#1 := 0; {2049#false} is VALID [2022-02-20 14:06:52,737 INFO L290 TraceCheckUtils]: 34: Hoare triple {2049#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2049#false} is VALID [2022-02-20 14:06:52,738 INFO L290 TraceCheckUtils]: 35: Hoare triple {2049#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {2049#false} is VALID [2022-02-20 14:06:52,738 INFO L290 TraceCheckUtils]: 36: Hoare triple {2049#false} main_~a~0#1 := 1 + main_~a~0#1; {2049#false} is VALID [2022-02-20 14:06:52,738 INFO L290 TraceCheckUtils]: 37: Hoare triple {2049#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2049#false} is VALID [2022-02-20 14:06:52,738 INFO L290 TraceCheckUtils]: 38: Hoare triple {2049#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {2049#false} is VALID [2022-02-20 14:06:52,738 INFO L290 TraceCheckUtils]: 39: Hoare triple {2049#false} main_~a~0#1 := 1 + main_~a~0#1; {2049#false} is VALID [2022-02-20 14:06:52,739 INFO L290 TraceCheckUtils]: 40: Hoare triple {2049#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2049#false} is VALID [2022-02-20 14:06:52,739 INFO L290 TraceCheckUtils]: 41: Hoare triple {2049#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {2049#false} is VALID [2022-02-20 14:06:52,739 INFO L290 TraceCheckUtils]: 42: Hoare triple {2049#false} main_~a~0#1 := 1 + main_~a~0#1; {2049#false} is VALID [2022-02-20 14:06:52,739 INFO L290 TraceCheckUtils]: 43: Hoare triple {2049#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2049#false} is VALID [2022-02-20 14:06:52,739 INFO L290 TraceCheckUtils]: 44: Hoare triple {2049#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {2049#false} is VALID [2022-02-20 14:06:52,739 INFO L290 TraceCheckUtils]: 45: Hoare triple {2049#false} main_~a~0#1 := 1 + main_~a~0#1; {2049#false} is VALID [2022-02-20 14:06:52,740 INFO L290 TraceCheckUtils]: 46: Hoare triple {2049#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2049#false} is VALID [2022-02-20 14:06:52,740 INFO L290 TraceCheckUtils]: 47: Hoare triple {2049#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {2049#false} is VALID [2022-02-20 14:06:52,740 INFO L290 TraceCheckUtils]: 48: Hoare triple {2049#false} main_~a~0#1 := 1 + main_~a~0#1; {2049#false} is VALID [2022-02-20 14:06:52,740 INFO L290 TraceCheckUtils]: 49: Hoare triple {2049#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2049#false} is VALID [2022-02-20 14:06:52,740 INFO L290 TraceCheckUtils]: 50: Hoare triple {2049#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {2049#false} is VALID [2022-02-20 14:06:52,740 INFO L290 TraceCheckUtils]: 51: Hoare triple {2049#false} main_~a~0#1 := 1 + main_~a~0#1; {2049#false} is VALID [2022-02-20 14:06:52,741 INFO L290 TraceCheckUtils]: 52: Hoare triple {2049#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2049#false} is VALID [2022-02-20 14:06:52,741 INFO L290 TraceCheckUtils]: 53: Hoare triple {2049#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {2049#false} is VALID [2022-02-20 14:06:52,741 INFO L290 TraceCheckUtils]: 54: Hoare triple {2049#false} main_~a~0#1 := 1 + main_~a~0#1; {2049#false} is VALID [2022-02-20 14:06:52,741 INFO L290 TraceCheckUtils]: 55: Hoare triple {2049#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2049#false} is VALID [2022-02-20 14:06:52,741 INFO L290 TraceCheckUtils]: 56: Hoare triple {2049#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {2049#false} is VALID [2022-02-20 14:06:52,742 INFO L290 TraceCheckUtils]: 57: Hoare triple {2049#false} main_~a~0#1 := 1 + main_~a~0#1; {2049#false} is VALID [2022-02-20 14:06:52,742 INFO L290 TraceCheckUtils]: 58: Hoare triple {2049#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2049#false} is VALID [2022-02-20 14:06:52,742 INFO L290 TraceCheckUtils]: 59: Hoare triple {2049#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {2049#false} is VALID [2022-02-20 14:06:52,742 INFO L290 TraceCheckUtils]: 60: Hoare triple {2049#false} main_~a~0#1 := 1 + main_~a~0#1; {2049#false} is VALID [2022-02-20 14:06:52,742 INFO L290 TraceCheckUtils]: 61: Hoare triple {2049#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2049#false} is VALID [2022-02-20 14:06:52,742 INFO L290 TraceCheckUtils]: 62: Hoare triple {2049#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {2049#false} is VALID [2022-02-20 14:06:52,743 INFO L290 TraceCheckUtils]: 63: Hoare triple {2049#false} main_~a~0#1 := 1 + main_~a~0#1; {2049#false} is VALID [2022-02-20 14:06:52,743 INFO L290 TraceCheckUtils]: 64: Hoare triple {2049#false} assume !(main_~a~0#1 < 100000); {2049#false} is VALID [2022-02-20 14:06:52,743 INFO L290 TraceCheckUtils]: 65: Hoare triple {2049#false} havoc main_~x~0#1;main_~x~0#1 := 0; {2049#false} is VALID [2022-02-20 14:06:52,743 INFO L290 TraceCheckUtils]: 66: Hoare triple {2049#false} assume !!(main_~x~0#1 < main_~b~0#1);call main_#t~mem7#1 := read~int(main_~#bb~0#1.base, main_~#bb~0#1.offset + 4 * main_~x~0#1, 4); {2049#false} is VALID [2022-02-20 14:06:52,743 INFO L272 TraceCheckUtils]: 67: Hoare triple {2049#false} call __VERIFIER_assert((if main_#t~mem7#1 >= 0 then 1 else 0)); {2049#false} is VALID [2022-02-20 14:06:52,743 INFO L290 TraceCheckUtils]: 68: Hoare triple {2049#false} ~cond := #in~cond; {2049#false} is VALID [2022-02-20 14:06:52,744 INFO L290 TraceCheckUtils]: 69: Hoare triple {2049#false} assume 0 == ~cond; {2049#false} is VALID [2022-02-20 14:06:52,744 INFO L290 TraceCheckUtils]: 70: Hoare triple {2049#false} assume !false; {2049#false} is VALID [2022-02-20 14:06:52,744 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-02-20 14:06:52,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:06:53,230 INFO L290 TraceCheckUtils]: 70: Hoare triple {2049#false} assume !false; {2049#false} is VALID [2022-02-20 14:06:53,230 INFO L290 TraceCheckUtils]: 69: Hoare triple {2049#false} assume 0 == ~cond; {2049#false} is VALID [2022-02-20 14:06:53,230 INFO L290 TraceCheckUtils]: 68: Hoare triple {2049#false} ~cond := #in~cond; {2049#false} is VALID [2022-02-20 14:06:53,230 INFO L272 TraceCheckUtils]: 67: Hoare triple {2049#false} call __VERIFIER_assert((if main_#t~mem7#1 >= 0 then 1 else 0)); {2049#false} is VALID [2022-02-20 14:06:53,230 INFO L290 TraceCheckUtils]: 66: Hoare triple {2049#false} assume !!(main_~x~0#1 < main_~b~0#1);call main_#t~mem7#1 := read~int(main_~#bb~0#1.base, main_~#bb~0#1.offset + 4 * main_~x~0#1, 4); {2049#false} is VALID [2022-02-20 14:06:53,231 INFO L290 TraceCheckUtils]: 65: Hoare triple {2049#false} havoc main_~x~0#1;main_~x~0#1 := 0; {2049#false} is VALID [2022-02-20 14:06:53,231 INFO L290 TraceCheckUtils]: 64: Hoare triple {2049#false} assume !(main_~a~0#1 < 100000); {2049#false} is VALID [2022-02-20 14:06:53,231 INFO L290 TraceCheckUtils]: 63: Hoare triple {2049#false} main_~a~0#1 := 1 + main_~a~0#1; {2049#false} is VALID [2022-02-20 14:06:53,231 INFO L290 TraceCheckUtils]: 62: Hoare triple {2049#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {2049#false} is VALID [2022-02-20 14:06:53,231 INFO L290 TraceCheckUtils]: 61: Hoare triple {2049#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2049#false} is VALID [2022-02-20 14:06:53,231 INFO L290 TraceCheckUtils]: 60: Hoare triple {2049#false} main_~a~0#1 := 1 + main_~a~0#1; {2049#false} is VALID [2022-02-20 14:06:53,231 INFO L290 TraceCheckUtils]: 59: Hoare triple {2049#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {2049#false} is VALID [2022-02-20 14:06:53,232 INFO L290 TraceCheckUtils]: 58: Hoare triple {2049#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2049#false} is VALID [2022-02-20 14:06:53,232 INFO L290 TraceCheckUtils]: 57: Hoare triple {2049#false} main_~a~0#1 := 1 + main_~a~0#1; {2049#false} is VALID [2022-02-20 14:06:53,233 INFO L290 TraceCheckUtils]: 56: Hoare triple {2049#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {2049#false} is VALID [2022-02-20 14:06:53,233 INFO L290 TraceCheckUtils]: 55: Hoare triple {2049#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2049#false} is VALID [2022-02-20 14:06:53,236 INFO L290 TraceCheckUtils]: 54: Hoare triple {2049#false} main_~a~0#1 := 1 + main_~a~0#1; {2049#false} is VALID [2022-02-20 14:06:53,239 INFO L290 TraceCheckUtils]: 53: Hoare triple {2049#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {2049#false} is VALID [2022-02-20 14:06:53,239 INFO L290 TraceCheckUtils]: 52: Hoare triple {2049#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2049#false} is VALID [2022-02-20 14:06:53,239 INFO L290 TraceCheckUtils]: 51: Hoare triple {2049#false} main_~a~0#1 := 1 + main_~a~0#1; {2049#false} is VALID [2022-02-20 14:06:53,240 INFO L290 TraceCheckUtils]: 50: Hoare triple {2049#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {2049#false} is VALID [2022-02-20 14:06:53,240 INFO L290 TraceCheckUtils]: 49: Hoare triple {2049#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2049#false} is VALID [2022-02-20 14:06:53,240 INFO L290 TraceCheckUtils]: 48: Hoare triple {2049#false} main_~a~0#1 := 1 + main_~a~0#1; {2049#false} is VALID [2022-02-20 14:06:53,240 INFO L290 TraceCheckUtils]: 47: Hoare triple {2049#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {2049#false} is VALID [2022-02-20 14:06:53,240 INFO L290 TraceCheckUtils]: 46: Hoare triple {2049#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2049#false} is VALID [2022-02-20 14:06:53,241 INFO L290 TraceCheckUtils]: 45: Hoare triple {2049#false} main_~a~0#1 := 1 + main_~a~0#1; {2049#false} is VALID [2022-02-20 14:06:53,241 INFO L290 TraceCheckUtils]: 44: Hoare triple {2049#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {2049#false} is VALID [2022-02-20 14:06:53,241 INFO L290 TraceCheckUtils]: 43: Hoare triple {2049#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2049#false} is VALID [2022-02-20 14:06:53,244 INFO L290 TraceCheckUtils]: 42: Hoare triple {2049#false} main_~a~0#1 := 1 + main_~a~0#1; {2049#false} is VALID [2022-02-20 14:06:53,244 INFO L290 TraceCheckUtils]: 41: Hoare triple {2049#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {2049#false} is VALID [2022-02-20 14:06:53,244 INFO L290 TraceCheckUtils]: 40: Hoare triple {2049#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2049#false} is VALID [2022-02-20 14:06:53,244 INFO L290 TraceCheckUtils]: 39: Hoare triple {2049#false} main_~a~0#1 := 1 + main_~a~0#1; {2049#false} is VALID [2022-02-20 14:06:53,244 INFO L290 TraceCheckUtils]: 38: Hoare triple {2049#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {2049#false} is VALID [2022-02-20 14:06:53,244 INFO L290 TraceCheckUtils]: 37: Hoare triple {2049#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2049#false} is VALID [2022-02-20 14:06:53,244 INFO L290 TraceCheckUtils]: 36: Hoare triple {2049#false} main_~a~0#1 := 1 + main_~a~0#1; {2049#false} is VALID [2022-02-20 14:06:53,245 INFO L290 TraceCheckUtils]: 35: Hoare triple {2049#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {2049#false} is VALID [2022-02-20 14:06:53,245 INFO L290 TraceCheckUtils]: 34: Hoare triple {2049#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2049#false} is VALID [2022-02-20 14:06:53,245 INFO L290 TraceCheckUtils]: 33: Hoare triple {2049#false} main_~a~0#1 := 0; {2049#false} is VALID [2022-02-20 14:06:53,246 INFO L290 TraceCheckUtils]: 32: Hoare triple {2389#(< |ULTIMATE.start_main_~a~0#1| 100000)} assume !(main_~a~0#1 < 100000); {2049#false} is VALID [2022-02-20 14:06:53,246 INFO L290 TraceCheckUtils]: 31: Hoare triple {2393#(< |ULTIMATE.start_main_~a~0#1| 99999)} main_~a~0#1 := 1 + main_~a~0#1; {2389#(< |ULTIMATE.start_main_~a~0#1| 100000)} is VALID [2022-02-20 14:06:53,247 INFO L290 TraceCheckUtils]: 30: Hoare triple {2393#(< |ULTIMATE.start_main_~a~0#1| 99999)} assume main_#t~mem2#1 >= 0;havoc main_#t~mem2#1;call main_#t~mem3#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem3#1, main_~#bb~0#1.base, main_~#bb~0#1.offset + 4 * main_~b~0#1, 4);havoc main_#t~mem3#1;main_~b~0#1 := 1 + main_~b~0#1; {2393#(< |ULTIMATE.start_main_~a~0#1| 99999)} is VALID [2022-02-20 14:06:53,247 INFO L290 TraceCheckUtils]: 29: Hoare triple {2393#(< |ULTIMATE.start_main_~a~0#1| 99999)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2393#(< |ULTIMATE.start_main_~a~0#1| 99999)} is VALID [2022-02-20 14:06:53,248 INFO L290 TraceCheckUtils]: 28: Hoare triple {2403#(< |ULTIMATE.start_main_~a~0#1| 99998)} main_~a~0#1 := 1 + main_~a~0#1; {2393#(< |ULTIMATE.start_main_~a~0#1| 99999)} is VALID [2022-02-20 14:06:53,248 INFO L290 TraceCheckUtils]: 27: Hoare triple {2403#(< |ULTIMATE.start_main_~a~0#1| 99998)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {2403#(< |ULTIMATE.start_main_~a~0#1| 99998)} is VALID [2022-02-20 14:06:53,248 INFO L290 TraceCheckUtils]: 26: Hoare triple {2403#(< |ULTIMATE.start_main_~a~0#1| 99998)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2403#(< |ULTIMATE.start_main_~a~0#1| 99998)} is VALID [2022-02-20 14:06:53,249 INFO L290 TraceCheckUtils]: 25: Hoare triple {2413#(< |ULTIMATE.start_main_~a~0#1| 99997)} main_~a~0#1 := 1 + main_~a~0#1; {2403#(< |ULTIMATE.start_main_~a~0#1| 99998)} is VALID [2022-02-20 14:06:53,249 INFO L290 TraceCheckUtils]: 24: Hoare triple {2413#(< |ULTIMATE.start_main_~a~0#1| 99997)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {2413#(< |ULTIMATE.start_main_~a~0#1| 99997)} is VALID [2022-02-20 14:06:53,249 INFO L290 TraceCheckUtils]: 23: Hoare triple {2413#(< |ULTIMATE.start_main_~a~0#1| 99997)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2413#(< |ULTIMATE.start_main_~a~0#1| 99997)} is VALID [2022-02-20 14:06:53,250 INFO L290 TraceCheckUtils]: 22: Hoare triple {2423#(< |ULTIMATE.start_main_~a~0#1| 99996)} main_~a~0#1 := 1 + main_~a~0#1; {2413#(< |ULTIMATE.start_main_~a~0#1| 99997)} is VALID [2022-02-20 14:06:53,251 INFO L290 TraceCheckUtils]: 21: Hoare triple {2423#(< |ULTIMATE.start_main_~a~0#1| 99996)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {2423#(< |ULTIMATE.start_main_~a~0#1| 99996)} is VALID [2022-02-20 14:06:53,251 INFO L290 TraceCheckUtils]: 20: Hoare triple {2423#(< |ULTIMATE.start_main_~a~0#1| 99996)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2423#(< |ULTIMATE.start_main_~a~0#1| 99996)} is VALID [2022-02-20 14:06:53,252 INFO L290 TraceCheckUtils]: 19: Hoare triple {2433#(< |ULTIMATE.start_main_~a~0#1| 99995)} main_~a~0#1 := 1 + main_~a~0#1; {2423#(< |ULTIMATE.start_main_~a~0#1| 99996)} is VALID [2022-02-20 14:06:53,252 INFO L290 TraceCheckUtils]: 18: Hoare triple {2433#(< |ULTIMATE.start_main_~a~0#1| 99995)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {2433#(< |ULTIMATE.start_main_~a~0#1| 99995)} is VALID [2022-02-20 14:06:53,256 INFO L290 TraceCheckUtils]: 17: Hoare triple {2433#(< |ULTIMATE.start_main_~a~0#1| 99995)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2433#(< |ULTIMATE.start_main_~a~0#1| 99995)} is VALID [2022-02-20 14:06:53,257 INFO L290 TraceCheckUtils]: 16: Hoare triple {2443#(< |ULTIMATE.start_main_~a~0#1| 99994)} main_~a~0#1 := 1 + main_~a~0#1; {2433#(< |ULTIMATE.start_main_~a~0#1| 99995)} is VALID [2022-02-20 14:06:53,257 INFO L290 TraceCheckUtils]: 15: Hoare triple {2443#(< |ULTIMATE.start_main_~a~0#1| 99994)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {2443#(< |ULTIMATE.start_main_~a~0#1| 99994)} is VALID [2022-02-20 14:06:53,258 INFO L290 TraceCheckUtils]: 14: Hoare triple {2443#(< |ULTIMATE.start_main_~a~0#1| 99994)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2443#(< |ULTIMATE.start_main_~a~0#1| 99994)} is VALID [2022-02-20 14:06:53,258 INFO L290 TraceCheckUtils]: 13: Hoare triple {2453#(< |ULTIMATE.start_main_~a~0#1| 99993)} main_~a~0#1 := 1 + main_~a~0#1; {2443#(< |ULTIMATE.start_main_~a~0#1| 99994)} is VALID [2022-02-20 14:06:53,258 INFO L290 TraceCheckUtils]: 12: Hoare triple {2453#(< |ULTIMATE.start_main_~a~0#1| 99993)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {2453#(< |ULTIMATE.start_main_~a~0#1| 99993)} is VALID [2022-02-20 14:06:53,259 INFO L290 TraceCheckUtils]: 11: Hoare triple {2453#(< |ULTIMATE.start_main_~a~0#1| 99993)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2453#(< |ULTIMATE.start_main_~a~0#1| 99993)} is VALID [2022-02-20 14:06:53,259 INFO L290 TraceCheckUtils]: 10: Hoare triple {2463#(< |ULTIMATE.start_main_~a~0#1| 99992)} main_~a~0#1 := 1 + main_~a~0#1; {2453#(< |ULTIMATE.start_main_~a~0#1| 99993)} is VALID [2022-02-20 14:06:53,260 INFO L290 TraceCheckUtils]: 9: Hoare triple {2463#(< |ULTIMATE.start_main_~a~0#1| 99992)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {2463#(< |ULTIMATE.start_main_~a~0#1| 99992)} is VALID [2022-02-20 14:06:53,260 INFO L290 TraceCheckUtils]: 8: Hoare triple {2463#(< |ULTIMATE.start_main_~a~0#1| 99992)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2463#(< |ULTIMATE.start_main_~a~0#1| 99992)} is VALID [2022-02-20 14:06:53,260 INFO L290 TraceCheckUtils]: 7: Hoare triple {2473#(< |ULTIMATE.start_main_~a~0#1| 99991)} main_~a~0#1 := 1 + main_~a~0#1; {2463#(< |ULTIMATE.start_main_~a~0#1| 99992)} is VALID [2022-02-20 14:06:53,261 INFO L290 TraceCheckUtils]: 6: Hoare triple {2473#(< |ULTIMATE.start_main_~a~0#1| 99991)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {2473#(< |ULTIMATE.start_main_~a~0#1| 99991)} is VALID [2022-02-20 14:06:53,261 INFO L290 TraceCheckUtils]: 5: Hoare triple {2473#(< |ULTIMATE.start_main_~a~0#1| 99991)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2473#(< |ULTIMATE.start_main_~a~0#1| 99991)} is VALID [2022-02-20 14:06:53,262 INFO L290 TraceCheckUtils]: 4: Hoare triple {2483#(< |ULTIMATE.start_main_~a~0#1| 99990)} main_~a~0#1 := 1 + main_~a~0#1; {2473#(< |ULTIMATE.start_main_~a~0#1| 99991)} is VALID [2022-02-20 14:06:53,262 INFO L290 TraceCheckUtils]: 3: Hoare triple {2483#(< |ULTIMATE.start_main_~a~0#1| 99990)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {2483#(< |ULTIMATE.start_main_~a~0#1| 99990)} is VALID [2022-02-20 14:06:53,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {2483#(< |ULTIMATE.start_main_~a~0#1| 99990)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {2483#(< |ULTIMATE.start_main_~a~0#1| 99990)} is VALID [2022-02-20 14:06:53,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {2048#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~#bb~0#1.base, main_~#bb~0#1.offset, main_~#cc~0#1.base, main_~#cc~0#1.offset, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;main_~b~0#1 := 0;main_~c~0#1 := 0;call main_~#bb~0#1.base, main_~#bb~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#cc~0#1.base, main_~#cc~0#1.offset := #Ultimate.allocOnStack(400000); {2483#(< |ULTIMATE.start_main_~a~0#1| 99990)} is VALID [2022-02-20 14:06:53,263 INFO L290 TraceCheckUtils]: 0: Hoare triple {2048#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); {2048#true} is VALID [2022-02-20 14:06:53,264 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-02-20 14:06:53,264 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111432905] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:06:53,264 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:06:53,264 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-02-20 14:06:53,264 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259131816] [2022-02-20 14:06:53,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:06:53,265 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.16) internal successors, (79), 25 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2022-02-20 14:06:53,266 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:06:53,266 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 3.16) internal successors, (79), 25 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:06:53,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:06:53,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-02-20 14:06:53,322 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:06:53,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-20 14:06:53,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-02-20 14:06:53,323 INFO L87 Difference]: Start difference. First operand 144 states and 189 transitions. Second operand has 25 states, 25 states have (on average 3.16) internal successors, (79), 25 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:06:53,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:06:53,878 INFO L93 Difference]: Finished difference Result 370 states and 535 transitions. [2022-02-20 14:06:53,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-20 14:06:53,879 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.16) internal successors, (79), 25 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2022-02-20 14:06:53,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:06:53,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 3.16) internal successors, (79), 25 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:06:53,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 249 transitions. [2022-02-20 14:06:53,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 3.16) internal successors, (79), 25 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:06:53,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 249 transitions. [2022-02-20 14:06:53,890 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 249 transitions. [2022-02-20 14:06:54,075 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 249 edges. 249 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:06:54,081 INFO L225 Difference]: With dead ends: 370 [2022-02-20 14:06:54,081 INFO L226 Difference]: Without dead ends: 288 [2022-02-20 14:06:54,082 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 130 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:06:54,083 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 305 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 14:06:54,083 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [305 Valid, 126 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 14:06:54,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-02-20 14:06:54,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2022-02-20 14:06:54,159 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:06:54,161 INFO L82 GeneralOperation]: Start isEquivalent. First operand 288 states. Second operand has 288 states, 284 states have (on average 1.3274647887323943) internal successors, (377), 284 states have internal predecessors, (377), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:06:54,161 INFO L74 IsIncluded]: Start isIncluded. First operand 288 states. Second operand has 288 states, 284 states have (on average 1.3274647887323943) internal successors, (377), 284 states have internal predecessors, (377), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:06:54,162 INFO L87 Difference]: Start difference. First operand 288 states. Second operand has 288 states, 284 states have (on average 1.3274647887323943) internal successors, (377), 284 states have internal predecessors, (377), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:06:54,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:06:54,171 INFO L93 Difference]: Finished difference Result 288 states and 381 transitions. [2022-02-20 14:06:54,171 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 381 transitions. [2022-02-20 14:06:54,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:06:54,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:06:54,173 INFO L74 IsIncluded]: Start isIncluded. First operand has 288 states, 284 states have (on average 1.3274647887323943) internal successors, (377), 284 states have internal predecessors, (377), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 288 states. [2022-02-20 14:06:54,173 INFO L87 Difference]: Start difference. First operand has 288 states, 284 states have (on average 1.3274647887323943) internal successors, (377), 284 states have internal predecessors, (377), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 288 states. [2022-02-20 14:06:54,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:06:54,182 INFO L93 Difference]: Finished difference Result 288 states and 381 transitions. [2022-02-20 14:06:54,182 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 381 transitions. [2022-02-20 14:06:54,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:06:54,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:06:54,183 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:06:54,183 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:06:54,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 284 states have (on average 1.3274647887323943) internal successors, (377), 284 states have internal predecessors, (377), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:06:54,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 381 transitions. [2022-02-20 14:06:54,193 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 381 transitions. Word has length 71 [2022-02-20 14:06:54,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:06:54,193 INFO L470 AbstractCegarLoop]: Abstraction has 288 states and 381 transitions. [2022-02-20 14:06:54,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.16) internal successors, (79), 25 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:06:54,194 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 381 transitions. [2022-02-20 14:06:54,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-02-20 14:06:54,195 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:06:54,196 INFO L514 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:06:54,223 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:06:54,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:06:54,411 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:06:54,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:06:54,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1759255338, now seen corresponding path program 3 times [2022-02-20 14:06:54,412 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:06:54,412 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427892001] [2022-02-20 14:06:54,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:06:54,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:06:54,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:06:54,952 INFO L290 TraceCheckUtils]: 0: Hoare triple {3951#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); {3951#true} is VALID [2022-02-20 14:06:54,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {3951#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~#bb~0#1.base, main_~#bb~0#1.offset, main_~#cc~0#1.base, main_~#cc~0#1.offset, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;main_~b~0#1 := 0;main_~c~0#1 := 0;call main_~#bb~0#1.base, main_~#bb~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#cc~0#1.base, main_~#cc~0#1.offset := #Ultimate.allocOnStack(400000); {3953#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:06:54,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {3953#(= |ULTIMATE.start_main_~a~0#1| 0)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3953#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:06:54,954 INFO L290 TraceCheckUtils]: 3: Hoare triple {3953#(= |ULTIMATE.start_main_~a~0#1| 0)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {3953#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:06:54,955 INFO L290 TraceCheckUtils]: 4: Hoare triple {3953#(= |ULTIMATE.start_main_~a~0#1| 0)} main_~a~0#1 := 1 + main_~a~0#1; {3954#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:06:54,955 INFO L290 TraceCheckUtils]: 5: Hoare triple {3954#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3954#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:06:54,955 INFO L290 TraceCheckUtils]: 6: Hoare triple {3954#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {3954#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:06:54,956 INFO L290 TraceCheckUtils]: 7: Hoare triple {3954#(<= |ULTIMATE.start_main_~a~0#1| 1)} main_~a~0#1 := 1 + main_~a~0#1; {3955#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:06:54,956 INFO L290 TraceCheckUtils]: 8: Hoare triple {3955#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3955#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:06:54,956 INFO L290 TraceCheckUtils]: 9: Hoare triple {3955#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {3955#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:06:54,957 INFO L290 TraceCheckUtils]: 10: Hoare triple {3955#(<= |ULTIMATE.start_main_~a~0#1| 2)} main_~a~0#1 := 1 + main_~a~0#1; {3956#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:06:54,958 INFO L290 TraceCheckUtils]: 11: Hoare triple {3956#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3956#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:06:54,958 INFO L290 TraceCheckUtils]: 12: Hoare triple {3956#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {3956#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:06:54,959 INFO L290 TraceCheckUtils]: 13: Hoare triple {3956#(<= |ULTIMATE.start_main_~a~0#1| 3)} main_~a~0#1 := 1 + main_~a~0#1; {3957#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:06:54,962 INFO L290 TraceCheckUtils]: 14: Hoare triple {3957#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3957#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:06:54,963 INFO L290 TraceCheckUtils]: 15: Hoare triple {3957#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {3957#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:06:54,963 INFO L290 TraceCheckUtils]: 16: Hoare triple {3957#(<= |ULTIMATE.start_main_~a~0#1| 4)} main_~a~0#1 := 1 + main_~a~0#1; {3958#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-20 14:06:54,963 INFO L290 TraceCheckUtils]: 17: Hoare triple {3958#(<= |ULTIMATE.start_main_~a~0#1| 5)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3958#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-20 14:06:54,963 INFO L290 TraceCheckUtils]: 18: Hoare triple {3958#(<= |ULTIMATE.start_main_~a~0#1| 5)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {3958#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-20 14:06:54,964 INFO L290 TraceCheckUtils]: 19: Hoare triple {3958#(<= |ULTIMATE.start_main_~a~0#1| 5)} main_~a~0#1 := 1 + main_~a~0#1; {3959#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-20 14:06:54,964 INFO L290 TraceCheckUtils]: 20: Hoare triple {3959#(<= |ULTIMATE.start_main_~a~0#1| 6)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3959#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-20 14:06:54,964 INFO L290 TraceCheckUtils]: 21: Hoare triple {3959#(<= |ULTIMATE.start_main_~a~0#1| 6)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {3959#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-20 14:06:54,965 INFO L290 TraceCheckUtils]: 22: Hoare triple {3959#(<= |ULTIMATE.start_main_~a~0#1| 6)} main_~a~0#1 := 1 + main_~a~0#1; {3960#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-20 14:06:54,965 INFO L290 TraceCheckUtils]: 23: Hoare triple {3960#(<= |ULTIMATE.start_main_~a~0#1| 7)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3960#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-20 14:06:54,965 INFO L290 TraceCheckUtils]: 24: Hoare triple {3960#(<= |ULTIMATE.start_main_~a~0#1| 7)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {3960#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-20 14:06:54,966 INFO L290 TraceCheckUtils]: 25: Hoare triple {3960#(<= |ULTIMATE.start_main_~a~0#1| 7)} main_~a~0#1 := 1 + main_~a~0#1; {3961#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-20 14:06:54,966 INFO L290 TraceCheckUtils]: 26: Hoare triple {3961#(<= |ULTIMATE.start_main_~a~0#1| 8)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3961#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-20 14:06:54,966 INFO L290 TraceCheckUtils]: 27: Hoare triple {3961#(<= |ULTIMATE.start_main_~a~0#1| 8)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {3961#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-20 14:06:54,967 INFO L290 TraceCheckUtils]: 28: Hoare triple {3961#(<= |ULTIMATE.start_main_~a~0#1| 8)} main_~a~0#1 := 1 + main_~a~0#1; {3962#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-20 14:06:54,967 INFO L290 TraceCheckUtils]: 29: Hoare triple {3962#(<= |ULTIMATE.start_main_~a~0#1| 9)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3962#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-20 14:06:54,968 INFO L290 TraceCheckUtils]: 30: Hoare triple {3962#(<= |ULTIMATE.start_main_~a~0#1| 9)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {3962#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-20 14:06:54,968 INFO L290 TraceCheckUtils]: 31: Hoare triple {3962#(<= |ULTIMATE.start_main_~a~0#1| 9)} main_~a~0#1 := 1 + main_~a~0#1; {3963#(<= |ULTIMATE.start_main_~a~0#1| 10)} is VALID [2022-02-20 14:06:54,968 INFO L290 TraceCheckUtils]: 32: Hoare triple {3963#(<= |ULTIMATE.start_main_~a~0#1| 10)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3963#(<= |ULTIMATE.start_main_~a~0#1| 10)} is VALID [2022-02-20 14:06:54,969 INFO L290 TraceCheckUtils]: 33: Hoare triple {3963#(<= |ULTIMATE.start_main_~a~0#1| 10)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {3963#(<= |ULTIMATE.start_main_~a~0#1| 10)} is VALID [2022-02-20 14:06:54,970 INFO L290 TraceCheckUtils]: 34: Hoare triple {3963#(<= |ULTIMATE.start_main_~a~0#1| 10)} main_~a~0#1 := 1 + main_~a~0#1; {3964#(<= |ULTIMATE.start_main_~a~0#1| 11)} is VALID [2022-02-20 14:06:54,971 INFO L290 TraceCheckUtils]: 35: Hoare triple {3964#(<= |ULTIMATE.start_main_~a~0#1| 11)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3964#(<= |ULTIMATE.start_main_~a~0#1| 11)} is VALID [2022-02-20 14:06:54,971 INFO L290 TraceCheckUtils]: 36: Hoare triple {3964#(<= |ULTIMATE.start_main_~a~0#1| 11)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {3964#(<= |ULTIMATE.start_main_~a~0#1| 11)} is VALID [2022-02-20 14:06:54,971 INFO L290 TraceCheckUtils]: 37: Hoare triple {3964#(<= |ULTIMATE.start_main_~a~0#1| 11)} main_~a~0#1 := 1 + main_~a~0#1; {3965#(<= |ULTIMATE.start_main_~a~0#1| 12)} is VALID [2022-02-20 14:06:54,972 INFO L290 TraceCheckUtils]: 38: Hoare triple {3965#(<= |ULTIMATE.start_main_~a~0#1| 12)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3965#(<= |ULTIMATE.start_main_~a~0#1| 12)} is VALID [2022-02-20 14:06:54,972 INFO L290 TraceCheckUtils]: 39: Hoare triple {3965#(<= |ULTIMATE.start_main_~a~0#1| 12)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {3965#(<= |ULTIMATE.start_main_~a~0#1| 12)} is VALID [2022-02-20 14:06:54,972 INFO L290 TraceCheckUtils]: 40: Hoare triple {3965#(<= |ULTIMATE.start_main_~a~0#1| 12)} main_~a~0#1 := 1 + main_~a~0#1; {3966#(<= |ULTIMATE.start_main_~a~0#1| 13)} is VALID [2022-02-20 14:06:54,973 INFO L290 TraceCheckUtils]: 41: Hoare triple {3966#(<= |ULTIMATE.start_main_~a~0#1| 13)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3966#(<= |ULTIMATE.start_main_~a~0#1| 13)} is VALID [2022-02-20 14:06:54,973 INFO L290 TraceCheckUtils]: 42: Hoare triple {3966#(<= |ULTIMATE.start_main_~a~0#1| 13)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {3966#(<= |ULTIMATE.start_main_~a~0#1| 13)} is VALID [2022-02-20 14:06:54,973 INFO L290 TraceCheckUtils]: 43: Hoare triple {3966#(<= |ULTIMATE.start_main_~a~0#1| 13)} main_~a~0#1 := 1 + main_~a~0#1; {3967#(<= |ULTIMATE.start_main_~a~0#1| 14)} is VALID [2022-02-20 14:06:54,974 INFO L290 TraceCheckUtils]: 44: Hoare triple {3967#(<= |ULTIMATE.start_main_~a~0#1| 14)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3967#(<= |ULTIMATE.start_main_~a~0#1| 14)} is VALID [2022-02-20 14:06:54,974 INFO L290 TraceCheckUtils]: 45: Hoare triple {3967#(<= |ULTIMATE.start_main_~a~0#1| 14)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {3967#(<= |ULTIMATE.start_main_~a~0#1| 14)} is VALID [2022-02-20 14:06:54,974 INFO L290 TraceCheckUtils]: 46: Hoare triple {3967#(<= |ULTIMATE.start_main_~a~0#1| 14)} main_~a~0#1 := 1 + main_~a~0#1; {3968#(<= |ULTIMATE.start_main_~a~0#1| 15)} is VALID [2022-02-20 14:06:54,975 INFO L290 TraceCheckUtils]: 47: Hoare triple {3968#(<= |ULTIMATE.start_main_~a~0#1| 15)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3968#(<= |ULTIMATE.start_main_~a~0#1| 15)} is VALID [2022-02-20 14:06:54,975 INFO L290 TraceCheckUtils]: 48: Hoare triple {3968#(<= |ULTIMATE.start_main_~a~0#1| 15)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {3968#(<= |ULTIMATE.start_main_~a~0#1| 15)} is VALID [2022-02-20 14:06:54,975 INFO L290 TraceCheckUtils]: 49: Hoare triple {3968#(<= |ULTIMATE.start_main_~a~0#1| 15)} main_~a~0#1 := 1 + main_~a~0#1; {3969#(<= |ULTIMATE.start_main_~a~0#1| 16)} is VALID [2022-02-20 14:06:54,976 INFO L290 TraceCheckUtils]: 50: Hoare triple {3969#(<= |ULTIMATE.start_main_~a~0#1| 16)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3969#(<= |ULTIMATE.start_main_~a~0#1| 16)} is VALID [2022-02-20 14:06:54,977 INFO L290 TraceCheckUtils]: 51: Hoare triple {3969#(<= |ULTIMATE.start_main_~a~0#1| 16)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {3969#(<= |ULTIMATE.start_main_~a~0#1| 16)} is VALID [2022-02-20 14:06:54,977 INFO L290 TraceCheckUtils]: 52: Hoare triple {3969#(<= |ULTIMATE.start_main_~a~0#1| 16)} main_~a~0#1 := 1 + main_~a~0#1; {3970#(<= |ULTIMATE.start_main_~a~0#1| 17)} is VALID [2022-02-20 14:06:54,977 INFO L290 TraceCheckUtils]: 53: Hoare triple {3970#(<= |ULTIMATE.start_main_~a~0#1| 17)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3970#(<= |ULTIMATE.start_main_~a~0#1| 17)} is VALID [2022-02-20 14:06:54,978 INFO L290 TraceCheckUtils]: 54: Hoare triple {3970#(<= |ULTIMATE.start_main_~a~0#1| 17)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {3970#(<= |ULTIMATE.start_main_~a~0#1| 17)} is VALID [2022-02-20 14:06:54,978 INFO L290 TraceCheckUtils]: 55: Hoare triple {3970#(<= |ULTIMATE.start_main_~a~0#1| 17)} main_~a~0#1 := 1 + main_~a~0#1; {3971#(<= |ULTIMATE.start_main_~a~0#1| 18)} is VALID [2022-02-20 14:06:54,978 INFO L290 TraceCheckUtils]: 56: Hoare triple {3971#(<= |ULTIMATE.start_main_~a~0#1| 18)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3971#(<= |ULTIMATE.start_main_~a~0#1| 18)} is VALID [2022-02-20 14:06:54,979 INFO L290 TraceCheckUtils]: 57: Hoare triple {3971#(<= |ULTIMATE.start_main_~a~0#1| 18)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {3971#(<= |ULTIMATE.start_main_~a~0#1| 18)} is VALID [2022-02-20 14:06:54,979 INFO L290 TraceCheckUtils]: 58: Hoare triple {3971#(<= |ULTIMATE.start_main_~a~0#1| 18)} main_~a~0#1 := 1 + main_~a~0#1; {3972#(<= |ULTIMATE.start_main_~a~0#1| 19)} is VALID [2022-02-20 14:06:54,979 INFO L290 TraceCheckUtils]: 59: Hoare triple {3972#(<= |ULTIMATE.start_main_~a~0#1| 19)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3972#(<= |ULTIMATE.start_main_~a~0#1| 19)} is VALID [2022-02-20 14:06:54,980 INFO L290 TraceCheckUtils]: 60: Hoare triple {3972#(<= |ULTIMATE.start_main_~a~0#1| 19)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {3972#(<= |ULTIMATE.start_main_~a~0#1| 19)} is VALID [2022-02-20 14:06:54,980 INFO L290 TraceCheckUtils]: 61: Hoare triple {3972#(<= |ULTIMATE.start_main_~a~0#1| 19)} main_~a~0#1 := 1 + main_~a~0#1; {3973#(<= |ULTIMATE.start_main_~a~0#1| 20)} is VALID [2022-02-20 14:06:54,980 INFO L290 TraceCheckUtils]: 62: Hoare triple {3973#(<= |ULTIMATE.start_main_~a~0#1| 20)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3973#(<= |ULTIMATE.start_main_~a~0#1| 20)} is VALID [2022-02-20 14:06:54,981 INFO L290 TraceCheckUtils]: 63: Hoare triple {3973#(<= |ULTIMATE.start_main_~a~0#1| 20)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {3973#(<= |ULTIMATE.start_main_~a~0#1| 20)} is VALID [2022-02-20 14:06:54,981 INFO L290 TraceCheckUtils]: 64: Hoare triple {3973#(<= |ULTIMATE.start_main_~a~0#1| 20)} main_~a~0#1 := 1 + main_~a~0#1; {3974#(<= |ULTIMATE.start_main_~a~0#1| 21)} is VALID [2022-02-20 14:06:54,981 INFO L290 TraceCheckUtils]: 65: Hoare triple {3974#(<= |ULTIMATE.start_main_~a~0#1| 21)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3974#(<= |ULTIMATE.start_main_~a~0#1| 21)} is VALID [2022-02-20 14:06:54,982 INFO L290 TraceCheckUtils]: 66: Hoare triple {3974#(<= |ULTIMATE.start_main_~a~0#1| 21)} assume main_#t~mem2#1 >= 0;havoc main_#t~mem2#1;call main_#t~mem3#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem3#1, main_~#bb~0#1.base, main_~#bb~0#1.offset + 4 * main_~b~0#1, 4);havoc main_#t~mem3#1;main_~b~0#1 := 1 + main_~b~0#1; {3974#(<= |ULTIMATE.start_main_~a~0#1| 21)} is VALID [2022-02-20 14:06:54,982 INFO L290 TraceCheckUtils]: 67: Hoare triple {3974#(<= |ULTIMATE.start_main_~a~0#1| 21)} main_~a~0#1 := 1 + main_~a~0#1; {3975#(<= |ULTIMATE.start_main_~a~0#1| 22)} is VALID [2022-02-20 14:06:54,982 INFO L290 TraceCheckUtils]: 68: Hoare triple {3975#(<= |ULTIMATE.start_main_~a~0#1| 22)} assume !(main_~a~0#1 < 100000); {3952#false} is VALID [2022-02-20 14:06:54,982 INFO L290 TraceCheckUtils]: 69: Hoare triple {3952#false} main_~a~0#1 := 0; {3952#false} is VALID [2022-02-20 14:06:54,982 INFO L290 TraceCheckUtils]: 70: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:06:54,983 INFO L290 TraceCheckUtils]: 71: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:06:54,983 INFO L290 TraceCheckUtils]: 72: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:06:54,983 INFO L290 TraceCheckUtils]: 73: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:06:54,983 INFO L290 TraceCheckUtils]: 74: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:06:54,983 INFO L290 TraceCheckUtils]: 75: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:06:54,983 INFO L290 TraceCheckUtils]: 76: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:06:54,983 INFO L290 TraceCheckUtils]: 77: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:06:54,984 INFO L290 TraceCheckUtils]: 78: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:06:54,985 INFO L290 TraceCheckUtils]: 79: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:06:54,985 INFO L290 TraceCheckUtils]: 80: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:06:54,985 INFO L290 TraceCheckUtils]: 81: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:06:54,985 INFO L290 TraceCheckUtils]: 82: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:06:54,985 INFO L290 TraceCheckUtils]: 83: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:06:54,985 INFO L290 TraceCheckUtils]: 84: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:06:54,986 INFO L290 TraceCheckUtils]: 85: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:06:54,986 INFO L290 TraceCheckUtils]: 86: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:06:54,986 INFO L290 TraceCheckUtils]: 87: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:06:54,986 INFO L290 TraceCheckUtils]: 88: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:06:54,986 INFO L290 TraceCheckUtils]: 89: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:06:54,986 INFO L290 TraceCheckUtils]: 90: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:06:54,987 INFO L290 TraceCheckUtils]: 91: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:06:54,987 INFO L290 TraceCheckUtils]: 92: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:06:54,987 INFO L290 TraceCheckUtils]: 93: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:06:54,987 INFO L290 TraceCheckUtils]: 94: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:06:54,987 INFO L290 TraceCheckUtils]: 95: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:06:54,987 INFO L290 TraceCheckUtils]: 96: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:06:54,987 INFO L290 TraceCheckUtils]: 97: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:06:54,988 INFO L290 TraceCheckUtils]: 98: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:06:54,988 INFO L290 TraceCheckUtils]: 99: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:06:54,988 INFO L290 TraceCheckUtils]: 100: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:06:54,988 INFO L290 TraceCheckUtils]: 101: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:06:54,988 INFO L290 TraceCheckUtils]: 102: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:06:54,988 INFO L290 TraceCheckUtils]: 103: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:06:54,988 INFO L290 TraceCheckUtils]: 104: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:06:54,989 INFO L290 TraceCheckUtils]: 105: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:06:54,989 INFO L290 TraceCheckUtils]: 106: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:06:54,989 INFO L290 TraceCheckUtils]: 107: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:06:54,989 INFO L290 TraceCheckUtils]: 108: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:06:54,989 INFO L290 TraceCheckUtils]: 109: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:06:54,989 INFO L290 TraceCheckUtils]: 110: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:06:54,990 INFO L290 TraceCheckUtils]: 111: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:06:54,990 INFO L290 TraceCheckUtils]: 112: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:06:54,990 INFO L290 TraceCheckUtils]: 113: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:06:54,990 INFO L290 TraceCheckUtils]: 114: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:06:54,990 INFO L290 TraceCheckUtils]: 115: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:06:54,990 INFO L290 TraceCheckUtils]: 116: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:06:54,990 INFO L290 TraceCheckUtils]: 117: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:06:54,990 INFO L290 TraceCheckUtils]: 118: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:06:54,991 INFO L290 TraceCheckUtils]: 119: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:06:54,991 INFO L290 TraceCheckUtils]: 120: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:06:54,991 INFO L290 TraceCheckUtils]: 121: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:06:54,991 INFO L290 TraceCheckUtils]: 122: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:06:54,991 INFO L290 TraceCheckUtils]: 123: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:06:54,991 INFO L290 TraceCheckUtils]: 124: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:06:54,991 INFO L290 TraceCheckUtils]: 125: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:06:54,991 INFO L290 TraceCheckUtils]: 126: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:06:54,991 INFO L290 TraceCheckUtils]: 127: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:06:54,991 INFO L290 TraceCheckUtils]: 128: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:06:54,991 INFO L290 TraceCheckUtils]: 129: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:06:54,992 INFO L290 TraceCheckUtils]: 130: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:06:54,992 INFO L290 TraceCheckUtils]: 131: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:06:54,992 INFO L290 TraceCheckUtils]: 132: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:06:54,992 INFO L290 TraceCheckUtils]: 133: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:06:54,992 INFO L290 TraceCheckUtils]: 134: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:06:54,992 INFO L290 TraceCheckUtils]: 135: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:06:54,992 INFO L290 TraceCheckUtils]: 136: Hoare triple {3952#false} assume !(main_~a~0#1 < 100000); {3952#false} is VALID [2022-02-20 14:06:54,992 INFO L290 TraceCheckUtils]: 137: Hoare triple {3952#false} havoc main_~x~0#1;main_~x~0#1 := 0; {3952#false} is VALID [2022-02-20 14:06:54,992 INFO L290 TraceCheckUtils]: 138: Hoare triple {3952#false} assume !!(main_~x~0#1 < main_~b~0#1);call main_#t~mem7#1 := read~int(main_~#bb~0#1.base, main_~#bb~0#1.offset + 4 * main_~x~0#1, 4); {3952#false} is VALID [2022-02-20 14:06:54,992 INFO L272 TraceCheckUtils]: 139: Hoare triple {3952#false} call __VERIFIER_assert((if main_#t~mem7#1 >= 0 then 1 else 0)); {3952#false} is VALID [2022-02-20 14:06:54,992 INFO L290 TraceCheckUtils]: 140: Hoare triple {3952#false} ~cond := #in~cond; {3952#false} is VALID [2022-02-20 14:06:54,993 INFO L290 TraceCheckUtils]: 141: Hoare triple {3952#false} assume 0 == ~cond; {3952#false} is VALID [2022-02-20 14:06:54,993 INFO L290 TraceCheckUtils]: 142: Hoare triple {3952#false} assume !false; {3952#false} is VALID [2022-02-20 14:06:54,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1430 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2022-02-20 14:06:54,994 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:06:54,994 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427892001] [2022-02-20 14:06:54,994 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427892001] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:06:54,994 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483575938] [2022-02-20 14:06:54,994 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 14:06:54,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:06:54,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:06:54,996 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:06:55,011 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:07:32,274 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2022-02-20 14:07:32,274 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:07:32,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-20 14:07:32,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:07:32,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:07:33,022 INFO L290 TraceCheckUtils]: 0: Hoare triple {3951#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); {3951#true} is VALID [2022-02-20 14:07:33,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {3951#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~#bb~0#1.base, main_~#bb~0#1.offset, main_~#cc~0#1.base, main_~#cc~0#1.offset, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;main_~b~0#1 := 0;main_~c~0#1 := 0;call main_~#bb~0#1.base, main_~#bb~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#cc~0#1.base, main_~#cc~0#1.offset := #Ultimate.allocOnStack(400000); {3982#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:07:33,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {3982#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3982#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:07:33,023 INFO L290 TraceCheckUtils]: 3: Hoare triple {3982#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {3982#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:07:33,024 INFO L290 TraceCheckUtils]: 4: Hoare triple {3982#(<= |ULTIMATE.start_main_~a~0#1| 0)} main_~a~0#1 := 1 + main_~a~0#1; {3954#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:07:33,024 INFO L290 TraceCheckUtils]: 5: Hoare triple {3954#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3954#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:07:33,025 INFO L290 TraceCheckUtils]: 6: Hoare triple {3954#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {3954#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:07:33,025 INFO L290 TraceCheckUtils]: 7: Hoare triple {3954#(<= |ULTIMATE.start_main_~a~0#1| 1)} main_~a~0#1 := 1 + main_~a~0#1; {3955#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:07:33,025 INFO L290 TraceCheckUtils]: 8: Hoare triple {3955#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3955#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:07:33,026 INFO L290 TraceCheckUtils]: 9: Hoare triple {3955#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {3955#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:07:33,026 INFO L290 TraceCheckUtils]: 10: Hoare triple {3955#(<= |ULTIMATE.start_main_~a~0#1| 2)} main_~a~0#1 := 1 + main_~a~0#1; {3956#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:07:33,026 INFO L290 TraceCheckUtils]: 11: Hoare triple {3956#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3956#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:07:33,027 INFO L290 TraceCheckUtils]: 12: Hoare triple {3956#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {3956#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:07:33,027 INFO L290 TraceCheckUtils]: 13: Hoare triple {3956#(<= |ULTIMATE.start_main_~a~0#1| 3)} main_~a~0#1 := 1 + main_~a~0#1; {3957#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:07:33,027 INFO L290 TraceCheckUtils]: 14: Hoare triple {3957#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3957#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:07:33,028 INFO L290 TraceCheckUtils]: 15: Hoare triple {3957#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {3957#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:07:33,028 INFO L290 TraceCheckUtils]: 16: Hoare triple {3957#(<= |ULTIMATE.start_main_~a~0#1| 4)} main_~a~0#1 := 1 + main_~a~0#1; {3958#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-20 14:07:33,029 INFO L290 TraceCheckUtils]: 17: Hoare triple {3958#(<= |ULTIMATE.start_main_~a~0#1| 5)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3958#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-20 14:07:33,029 INFO L290 TraceCheckUtils]: 18: Hoare triple {3958#(<= |ULTIMATE.start_main_~a~0#1| 5)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {3958#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-20 14:07:33,029 INFO L290 TraceCheckUtils]: 19: Hoare triple {3958#(<= |ULTIMATE.start_main_~a~0#1| 5)} main_~a~0#1 := 1 + main_~a~0#1; {3959#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-20 14:07:33,030 INFO L290 TraceCheckUtils]: 20: Hoare triple {3959#(<= |ULTIMATE.start_main_~a~0#1| 6)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3959#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-20 14:07:33,035 INFO L290 TraceCheckUtils]: 21: Hoare triple {3959#(<= |ULTIMATE.start_main_~a~0#1| 6)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {3959#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-20 14:07:33,036 INFO L290 TraceCheckUtils]: 22: Hoare triple {3959#(<= |ULTIMATE.start_main_~a~0#1| 6)} main_~a~0#1 := 1 + main_~a~0#1; {3960#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-20 14:07:33,036 INFO L290 TraceCheckUtils]: 23: Hoare triple {3960#(<= |ULTIMATE.start_main_~a~0#1| 7)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3960#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-20 14:07:33,037 INFO L290 TraceCheckUtils]: 24: Hoare triple {3960#(<= |ULTIMATE.start_main_~a~0#1| 7)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {3960#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-20 14:07:33,037 INFO L290 TraceCheckUtils]: 25: Hoare triple {3960#(<= |ULTIMATE.start_main_~a~0#1| 7)} main_~a~0#1 := 1 + main_~a~0#1; {3961#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-20 14:07:33,038 INFO L290 TraceCheckUtils]: 26: Hoare triple {3961#(<= |ULTIMATE.start_main_~a~0#1| 8)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3961#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-20 14:07:33,038 INFO L290 TraceCheckUtils]: 27: Hoare triple {3961#(<= |ULTIMATE.start_main_~a~0#1| 8)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {3961#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-20 14:07:33,039 INFO L290 TraceCheckUtils]: 28: Hoare triple {3961#(<= |ULTIMATE.start_main_~a~0#1| 8)} main_~a~0#1 := 1 + main_~a~0#1; {3962#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-20 14:07:33,039 INFO L290 TraceCheckUtils]: 29: Hoare triple {3962#(<= |ULTIMATE.start_main_~a~0#1| 9)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3962#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-20 14:07:33,040 INFO L290 TraceCheckUtils]: 30: Hoare triple {3962#(<= |ULTIMATE.start_main_~a~0#1| 9)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {3962#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-20 14:07:33,040 INFO L290 TraceCheckUtils]: 31: Hoare triple {3962#(<= |ULTIMATE.start_main_~a~0#1| 9)} main_~a~0#1 := 1 + main_~a~0#1; {3963#(<= |ULTIMATE.start_main_~a~0#1| 10)} is VALID [2022-02-20 14:07:33,041 INFO L290 TraceCheckUtils]: 32: Hoare triple {3963#(<= |ULTIMATE.start_main_~a~0#1| 10)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3963#(<= |ULTIMATE.start_main_~a~0#1| 10)} is VALID [2022-02-20 14:07:33,041 INFO L290 TraceCheckUtils]: 33: Hoare triple {3963#(<= |ULTIMATE.start_main_~a~0#1| 10)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {3963#(<= |ULTIMATE.start_main_~a~0#1| 10)} is VALID [2022-02-20 14:07:33,041 INFO L290 TraceCheckUtils]: 34: Hoare triple {3963#(<= |ULTIMATE.start_main_~a~0#1| 10)} main_~a~0#1 := 1 + main_~a~0#1; {3964#(<= |ULTIMATE.start_main_~a~0#1| 11)} is VALID [2022-02-20 14:07:33,042 INFO L290 TraceCheckUtils]: 35: Hoare triple {3964#(<= |ULTIMATE.start_main_~a~0#1| 11)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3964#(<= |ULTIMATE.start_main_~a~0#1| 11)} is VALID [2022-02-20 14:07:33,042 INFO L290 TraceCheckUtils]: 36: Hoare triple {3964#(<= |ULTIMATE.start_main_~a~0#1| 11)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {3964#(<= |ULTIMATE.start_main_~a~0#1| 11)} is VALID [2022-02-20 14:07:33,043 INFO L290 TraceCheckUtils]: 37: Hoare triple {3964#(<= |ULTIMATE.start_main_~a~0#1| 11)} main_~a~0#1 := 1 + main_~a~0#1; {3965#(<= |ULTIMATE.start_main_~a~0#1| 12)} is VALID [2022-02-20 14:07:33,043 INFO L290 TraceCheckUtils]: 38: Hoare triple {3965#(<= |ULTIMATE.start_main_~a~0#1| 12)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3965#(<= |ULTIMATE.start_main_~a~0#1| 12)} is VALID [2022-02-20 14:07:33,044 INFO L290 TraceCheckUtils]: 39: Hoare triple {3965#(<= |ULTIMATE.start_main_~a~0#1| 12)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {3965#(<= |ULTIMATE.start_main_~a~0#1| 12)} is VALID [2022-02-20 14:07:33,044 INFO L290 TraceCheckUtils]: 40: Hoare triple {3965#(<= |ULTIMATE.start_main_~a~0#1| 12)} main_~a~0#1 := 1 + main_~a~0#1; {3966#(<= |ULTIMATE.start_main_~a~0#1| 13)} is VALID [2022-02-20 14:07:33,045 INFO L290 TraceCheckUtils]: 41: Hoare triple {3966#(<= |ULTIMATE.start_main_~a~0#1| 13)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3966#(<= |ULTIMATE.start_main_~a~0#1| 13)} is VALID [2022-02-20 14:07:33,045 INFO L290 TraceCheckUtils]: 42: Hoare triple {3966#(<= |ULTIMATE.start_main_~a~0#1| 13)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {3966#(<= |ULTIMATE.start_main_~a~0#1| 13)} is VALID [2022-02-20 14:07:33,046 INFO L290 TraceCheckUtils]: 43: Hoare triple {3966#(<= |ULTIMATE.start_main_~a~0#1| 13)} main_~a~0#1 := 1 + main_~a~0#1; {3967#(<= |ULTIMATE.start_main_~a~0#1| 14)} is VALID [2022-02-20 14:07:33,046 INFO L290 TraceCheckUtils]: 44: Hoare triple {3967#(<= |ULTIMATE.start_main_~a~0#1| 14)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3967#(<= |ULTIMATE.start_main_~a~0#1| 14)} is VALID [2022-02-20 14:07:33,046 INFO L290 TraceCheckUtils]: 45: Hoare triple {3967#(<= |ULTIMATE.start_main_~a~0#1| 14)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {3967#(<= |ULTIMATE.start_main_~a~0#1| 14)} is VALID [2022-02-20 14:07:33,047 INFO L290 TraceCheckUtils]: 46: Hoare triple {3967#(<= |ULTIMATE.start_main_~a~0#1| 14)} main_~a~0#1 := 1 + main_~a~0#1; {3968#(<= |ULTIMATE.start_main_~a~0#1| 15)} is VALID [2022-02-20 14:07:33,047 INFO L290 TraceCheckUtils]: 47: Hoare triple {3968#(<= |ULTIMATE.start_main_~a~0#1| 15)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3968#(<= |ULTIMATE.start_main_~a~0#1| 15)} is VALID [2022-02-20 14:07:33,048 INFO L290 TraceCheckUtils]: 48: Hoare triple {3968#(<= |ULTIMATE.start_main_~a~0#1| 15)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {3968#(<= |ULTIMATE.start_main_~a~0#1| 15)} is VALID [2022-02-20 14:07:33,048 INFO L290 TraceCheckUtils]: 49: Hoare triple {3968#(<= |ULTIMATE.start_main_~a~0#1| 15)} main_~a~0#1 := 1 + main_~a~0#1; {3969#(<= |ULTIMATE.start_main_~a~0#1| 16)} is VALID [2022-02-20 14:07:33,049 INFO L290 TraceCheckUtils]: 50: Hoare triple {3969#(<= |ULTIMATE.start_main_~a~0#1| 16)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3969#(<= |ULTIMATE.start_main_~a~0#1| 16)} is VALID [2022-02-20 14:07:33,049 INFO L290 TraceCheckUtils]: 51: Hoare triple {3969#(<= |ULTIMATE.start_main_~a~0#1| 16)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {3969#(<= |ULTIMATE.start_main_~a~0#1| 16)} is VALID [2022-02-20 14:07:33,050 INFO L290 TraceCheckUtils]: 52: Hoare triple {3969#(<= |ULTIMATE.start_main_~a~0#1| 16)} main_~a~0#1 := 1 + main_~a~0#1; {3970#(<= |ULTIMATE.start_main_~a~0#1| 17)} is VALID [2022-02-20 14:07:33,050 INFO L290 TraceCheckUtils]: 53: Hoare triple {3970#(<= |ULTIMATE.start_main_~a~0#1| 17)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3970#(<= |ULTIMATE.start_main_~a~0#1| 17)} is VALID [2022-02-20 14:07:33,050 INFO L290 TraceCheckUtils]: 54: Hoare triple {3970#(<= |ULTIMATE.start_main_~a~0#1| 17)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {3970#(<= |ULTIMATE.start_main_~a~0#1| 17)} is VALID [2022-02-20 14:07:33,051 INFO L290 TraceCheckUtils]: 55: Hoare triple {3970#(<= |ULTIMATE.start_main_~a~0#1| 17)} main_~a~0#1 := 1 + main_~a~0#1; {3971#(<= |ULTIMATE.start_main_~a~0#1| 18)} is VALID [2022-02-20 14:07:33,051 INFO L290 TraceCheckUtils]: 56: Hoare triple {3971#(<= |ULTIMATE.start_main_~a~0#1| 18)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3971#(<= |ULTIMATE.start_main_~a~0#1| 18)} is VALID [2022-02-20 14:07:33,051 INFO L290 TraceCheckUtils]: 57: Hoare triple {3971#(<= |ULTIMATE.start_main_~a~0#1| 18)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {3971#(<= |ULTIMATE.start_main_~a~0#1| 18)} is VALID [2022-02-20 14:07:33,052 INFO L290 TraceCheckUtils]: 58: Hoare triple {3971#(<= |ULTIMATE.start_main_~a~0#1| 18)} main_~a~0#1 := 1 + main_~a~0#1; {3972#(<= |ULTIMATE.start_main_~a~0#1| 19)} is VALID [2022-02-20 14:07:33,052 INFO L290 TraceCheckUtils]: 59: Hoare triple {3972#(<= |ULTIMATE.start_main_~a~0#1| 19)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3972#(<= |ULTIMATE.start_main_~a~0#1| 19)} is VALID [2022-02-20 14:07:33,052 INFO L290 TraceCheckUtils]: 60: Hoare triple {3972#(<= |ULTIMATE.start_main_~a~0#1| 19)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {3972#(<= |ULTIMATE.start_main_~a~0#1| 19)} is VALID [2022-02-20 14:07:33,053 INFO L290 TraceCheckUtils]: 61: Hoare triple {3972#(<= |ULTIMATE.start_main_~a~0#1| 19)} main_~a~0#1 := 1 + main_~a~0#1; {3973#(<= |ULTIMATE.start_main_~a~0#1| 20)} is VALID [2022-02-20 14:07:33,053 INFO L290 TraceCheckUtils]: 62: Hoare triple {3973#(<= |ULTIMATE.start_main_~a~0#1| 20)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3973#(<= |ULTIMATE.start_main_~a~0#1| 20)} is VALID [2022-02-20 14:07:33,053 INFO L290 TraceCheckUtils]: 63: Hoare triple {3973#(<= |ULTIMATE.start_main_~a~0#1| 20)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {3973#(<= |ULTIMATE.start_main_~a~0#1| 20)} is VALID [2022-02-20 14:07:33,054 INFO L290 TraceCheckUtils]: 64: Hoare triple {3973#(<= |ULTIMATE.start_main_~a~0#1| 20)} main_~a~0#1 := 1 + main_~a~0#1; {3974#(<= |ULTIMATE.start_main_~a~0#1| 21)} is VALID [2022-02-20 14:07:33,054 INFO L290 TraceCheckUtils]: 65: Hoare triple {3974#(<= |ULTIMATE.start_main_~a~0#1| 21)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3974#(<= |ULTIMATE.start_main_~a~0#1| 21)} is VALID [2022-02-20 14:07:33,055 INFO L290 TraceCheckUtils]: 66: Hoare triple {3974#(<= |ULTIMATE.start_main_~a~0#1| 21)} assume main_#t~mem2#1 >= 0;havoc main_#t~mem2#1;call main_#t~mem3#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem3#1, main_~#bb~0#1.base, main_~#bb~0#1.offset + 4 * main_~b~0#1, 4);havoc main_#t~mem3#1;main_~b~0#1 := 1 + main_~b~0#1; {3974#(<= |ULTIMATE.start_main_~a~0#1| 21)} is VALID [2022-02-20 14:07:33,055 INFO L290 TraceCheckUtils]: 67: Hoare triple {3974#(<= |ULTIMATE.start_main_~a~0#1| 21)} main_~a~0#1 := 1 + main_~a~0#1; {3975#(<= |ULTIMATE.start_main_~a~0#1| 22)} is VALID [2022-02-20 14:07:33,056 INFO L290 TraceCheckUtils]: 68: Hoare triple {3975#(<= |ULTIMATE.start_main_~a~0#1| 22)} assume !(main_~a~0#1 < 100000); {3952#false} is VALID [2022-02-20 14:07:33,056 INFO L290 TraceCheckUtils]: 69: Hoare triple {3952#false} main_~a~0#1 := 0; {3952#false} is VALID [2022-02-20 14:07:33,056 INFO L290 TraceCheckUtils]: 70: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:07:33,056 INFO L290 TraceCheckUtils]: 71: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:07:33,056 INFO L290 TraceCheckUtils]: 72: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:07:33,056 INFO L290 TraceCheckUtils]: 73: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:07:33,056 INFO L290 TraceCheckUtils]: 74: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:07:33,057 INFO L290 TraceCheckUtils]: 75: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:07:33,057 INFO L290 TraceCheckUtils]: 76: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:07:33,057 INFO L290 TraceCheckUtils]: 77: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:07:33,057 INFO L290 TraceCheckUtils]: 78: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:07:33,057 INFO L290 TraceCheckUtils]: 79: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:07:33,057 INFO L290 TraceCheckUtils]: 80: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:07:33,057 INFO L290 TraceCheckUtils]: 81: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:07:33,057 INFO L290 TraceCheckUtils]: 82: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:07:33,057 INFO L290 TraceCheckUtils]: 83: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:07:33,057 INFO L290 TraceCheckUtils]: 84: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:07:33,057 INFO L290 TraceCheckUtils]: 85: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:07:33,057 INFO L290 TraceCheckUtils]: 86: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:07:33,058 INFO L290 TraceCheckUtils]: 87: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:07:33,058 INFO L290 TraceCheckUtils]: 88: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:07:33,058 INFO L290 TraceCheckUtils]: 89: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:07:33,058 INFO L290 TraceCheckUtils]: 90: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:07:33,058 INFO L290 TraceCheckUtils]: 91: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:07:33,058 INFO L290 TraceCheckUtils]: 92: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:07:33,058 INFO L290 TraceCheckUtils]: 93: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:07:33,058 INFO L290 TraceCheckUtils]: 94: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:07:33,058 INFO L290 TraceCheckUtils]: 95: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:07:33,058 INFO L290 TraceCheckUtils]: 96: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:07:33,058 INFO L290 TraceCheckUtils]: 97: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:07:33,059 INFO L290 TraceCheckUtils]: 98: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:07:33,059 INFO L290 TraceCheckUtils]: 99: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:07:33,059 INFO L290 TraceCheckUtils]: 100: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:07:33,059 INFO L290 TraceCheckUtils]: 101: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:07:33,059 INFO L290 TraceCheckUtils]: 102: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:07:33,059 INFO L290 TraceCheckUtils]: 103: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:07:33,059 INFO L290 TraceCheckUtils]: 104: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:07:33,059 INFO L290 TraceCheckUtils]: 105: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:07:33,059 INFO L290 TraceCheckUtils]: 106: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:07:33,059 INFO L290 TraceCheckUtils]: 107: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:07:33,059 INFO L290 TraceCheckUtils]: 108: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:07:33,060 INFO L290 TraceCheckUtils]: 109: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:07:33,060 INFO L290 TraceCheckUtils]: 110: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:07:33,060 INFO L290 TraceCheckUtils]: 111: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:07:33,060 INFO L290 TraceCheckUtils]: 112: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:07:33,060 INFO L290 TraceCheckUtils]: 113: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:07:33,063 INFO L290 TraceCheckUtils]: 114: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:07:33,063 INFO L290 TraceCheckUtils]: 115: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:07:33,063 INFO L290 TraceCheckUtils]: 116: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:07:33,063 INFO L290 TraceCheckUtils]: 117: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:07:33,063 INFO L290 TraceCheckUtils]: 118: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:07:33,063 INFO L290 TraceCheckUtils]: 119: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:07:33,063 INFO L290 TraceCheckUtils]: 120: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:07:33,063 INFO L290 TraceCheckUtils]: 121: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:07:33,063 INFO L290 TraceCheckUtils]: 122: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:07:33,064 INFO L290 TraceCheckUtils]: 123: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:07:33,064 INFO L290 TraceCheckUtils]: 124: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:07:33,064 INFO L290 TraceCheckUtils]: 125: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:07:33,064 INFO L290 TraceCheckUtils]: 126: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:07:33,064 INFO L290 TraceCheckUtils]: 127: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:07:33,064 INFO L290 TraceCheckUtils]: 128: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:07:33,064 INFO L290 TraceCheckUtils]: 129: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:07:33,064 INFO L290 TraceCheckUtils]: 130: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:07:33,064 INFO L290 TraceCheckUtils]: 131: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:07:33,064 INFO L290 TraceCheckUtils]: 132: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:07:33,067 INFO L290 TraceCheckUtils]: 133: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:07:33,067 INFO L290 TraceCheckUtils]: 134: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:07:33,067 INFO L290 TraceCheckUtils]: 135: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:07:33,068 INFO L290 TraceCheckUtils]: 136: Hoare triple {3952#false} assume !(main_~a~0#1 < 100000); {3952#false} is VALID [2022-02-20 14:07:33,068 INFO L290 TraceCheckUtils]: 137: Hoare triple {3952#false} havoc main_~x~0#1;main_~x~0#1 := 0; {3952#false} is VALID [2022-02-20 14:07:33,068 INFO L290 TraceCheckUtils]: 138: Hoare triple {3952#false} assume !!(main_~x~0#1 < main_~b~0#1);call main_#t~mem7#1 := read~int(main_~#bb~0#1.base, main_~#bb~0#1.offset + 4 * main_~x~0#1, 4); {3952#false} is VALID [2022-02-20 14:07:33,068 INFO L272 TraceCheckUtils]: 139: Hoare triple {3952#false} call __VERIFIER_assert((if main_#t~mem7#1 >= 0 then 1 else 0)); {3952#false} is VALID [2022-02-20 14:07:33,068 INFO L290 TraceCheckUtils]: 140: Hoare triple {3952#false} ~cond := #in~cond; {3952#false} is VALID [2022-02-20 14:07:33,068 INFO L290 TraceCheckUtils]: 141: Hoare triple {3952#false} assume 0 == ~cond; {3952#false} is VALID [2022-02-20 14:07:33,069 INFO L290 TraceCheckUtils]: 142: Hoare triple {3952#false} assume !false; {3952#false} is VALID [2022-02-20 14:07:33,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1430 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2022-02-20 14:07:33,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:07:34,454 INFO L290 TraceCheckUtils]: 142: Hoare triple {3952#false} assume !false; {3952#false} is VALID [2022-02-20 14:07:34,454 INFO L290 TraceCheckUtils]: 141: Hoare triple {3952#false} assume 0 == ~cond; {3952#false} is VALID [2022-02-20 14:07:34,454 INFO L290 TraceCheckUtils]: 140: Hoare triple {3952#false} ~cond := #in~cond; {3952#false} is VALID [2022-02-20 14:07:34,454 INFO L272 TraceCheckUtils]: 139: Hoare triple {3952#false} call __VERIFIER_assert((if main_#t~mem7#1 >= 0 then 1 else 0)); {3952#false} is VALID [2022-02-20 14:07:34,454 INFO L290 TraceCheckUtils]: 138: Hoare triple {3952#false} assume !!(main_~x~0#1 < main_~b~0#1);call main_#t~mem7#1 := read~int(main_~#bb~0#1.base, main_~#bb~0#1.offset + 4 * main_~x~0#1, 4); {3952#false} is VALID [2022-02-20 14:07:34,454 INFO L290 TraceCheckUtils]: 137: Hoare triple {3952#false} havoc main_~x~0#1;main_~x~0#1 := 0; {3952#false} is VALID [2022-02-20 14:07:34,454 INFO L290 TraceCheckUtils]: 136: Hoare triple {3952#false} assume !(main_~a~0#1 < 100000); {3952#false} is VALID [2022-02-20 14:07:34,455 INFO L290 TraceCheckUtils]: 135: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:07:34,455 INFO L290 TraceCheckUtils]: 134: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:07:34,455 INFO L290 TraceCheckUtils]: 133: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:07:34,455 INFO L290 TraceCheckUtils]: 132: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:07:34,455 INFO L290 TraceCheckUtils]: 131: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:07:34,455 INFO L290 TraceCheckUtils]: 130: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:07:34,455 INFO L290 TraceCheckUtils]: 129: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:07:34,455 INFO L290 TraceCheckUtils]: 128: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:07:34,455 INFO L290 TraceCheckUtils]: 127: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:07:34,455 INFO L290 TraceCheckUtils]: 126: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:07:34,455 INFO L290 TraceCheckUtils]: 125: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:07:34,455 INFO L290 TraceCheckUtils]: 124: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:07:34,455 INFO L290 TraceCheckUtils]: 123: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:07:34,456 INFO L290 TraceCheckUtils]: 122: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:07:34,456 INFO L290 TraceCheckUtils]: 121: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:07:34,456 INFO L290 TraceCheckUtils]: 120: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:07:34,456 INFO L290 TraceCheckUtils]: 119: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:07:34,456 INFO L290 TraceCheckUtils]: 118: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:07:34,456 INFO L290 TraceCheckUtils]: 117: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:07:34,456 INFO L290 TraceCheckUtils]: 116: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:07:34,456 INFO L290 TraceCheckUtils]: 115: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:07:34,456 INFO L290 TraceCheckUtils]: 114: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:07:34,456 INFO L290 TraceCheckUtils]: 113: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:07:34,456 INFO L290 TraceCheckUtils]: 112: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:07:34,456 INFO L290 TraceCheckUtils]: 111: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:07:34,456 INFO L290 TraceCheckUtils]: 110: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:07:34,456 INFO L290 TraceCheckUtils]: 109: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:07:34,457 INFO L290 TraceCheckUtils]: 108: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:07:34,457 INFO L290 TraceCheckUtils]: 107: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:07:34,457 INFO L290 TraceCheckUtils]: 106: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:07:34,457 INFO L290 TraceCheckUtils]: 105: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:07:34,457 INFO L290 TraceCheckUtils]: 104: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:07:34,457 INFO L290 TraceCheckUtils]: 103: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:07:34,457 INFO L290 TraceCheckUtils]: 102: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:07:34,457 INFO L290 TraceCheckUtils]: 101: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:07:34,457 INFO L290 TraceCheckUtils]: 100: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:07:34,457 INFO L290 TraceCheckUtils]: 99: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:07:34,457 INFO L290 TraceCheckUtils]: 98: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:07:34,457 INFO L290 TraceCheckUtils]: 97: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:07:34,457 INFO L290 TraceCheckUtils]: 96: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:07:34,458 INFO L290 TraceCheckUtils]: 95: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:07:34,458 INFO L290 TraceCheckUtils]: 94: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:07:34,458 INFO L290 TraceCheckUtils]: 93: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:07:34,458 INFO L290 TraceCheckUtils]: 92: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:07:34,458 INFO L290 TraceCheckUtils]: 91: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:07:34,458 INFO L290 TraceCheckUtils]: 90: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:07:34,458 INFO L290 TraceCheckUtils]: 89: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:07:34,458 INFO L290 TraceCheckUtils]: 88: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:07:34,458 INFO L290 TraceCheckUtils]: 87: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:07:34,458 INFO L290 TraceCheckUtils]: 86: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:07:34,458 INFO L290 TraceCheckUtils]: 85: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:07:34,459 INFO L290 TraceCheckUtils]: 84: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:07:34,459 INFO L290 TraceCheckUtils]: 83: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:07:34,459 INFO L290 TraceCheckUtils]: 82: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:07:34,459 INFO L290 TraceCheckUtils]: 81: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:07:34,459 INFO L290 TraceCheckUtils]: 80: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:07:34,459 INFO L290 TraceCheckUtils]: 79: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:07:34,459 INFO L290 TraceCheckUtils]: 78: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:07:34,459 INFO L290 TraceCheckUtils]: 77: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:07:34,459 INFO L290 TraceCheckUtils]: 76: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:07:34,459 INFO L290 TraceCheckUtils]: 75: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:07:34,459 INFO L290 TraceCheckUtils]: 74: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:07:34,460 INFO L290 TraceCheckUtils]: 73: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:07:34,460 INFO L290 TraceCheckUtils]: 72: Hoare triple {3952#false} main_~a~0#1 := 1 + main_~a~0#1; {3952#false} is VALID [2022-02-20 14:07:34,460 INFO L290 TraceCheckUtils]: 71: Hoare triple {3952#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {3952#false} is VALID [2022-02-20 14:07:34,460 INFO L290 TraceCheckUtils]: 70: Hoare triple {3952#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {3952#false} is VALID [2022-02-20 14:07:34,460 INFO L290 TraceCheckUtils]: 69: Hoare triple {3952#false} main_~a~0#1 := 0; {3952#false} is VALID [2022-02-20 14:07:34,460 INFO L290 TraceCheckUtils]: 68: Hoare triple {4628#(< |ULTIMATE.start_main_~a~0#1| 100000)} assume !(main_~a~0#1 < 100000); {3952#false} is VALID [2022-02-20 14:07:34,461 INFO L290 TraceCheckUtils]: 67: Hoare triple {4632#(< |ULTIMATE.start_main_~a~0#1| 99999)} main_~a~0#1 := 1 + main_~a~0#1; {4628#(< |ULTIMATE.start_main_~a~0#1| 100000)} is VALID [2022-02-20 14:07:34,461 INFO L290 TraceCheckUtils]: 66: Hoare triple {4632#(< |ULTIMATE.start_main_~a~0#1| 99999)} assume main_#t~mem2#1 >= 0;havoc main_#t~mem2#1;call main_#t~mem3#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem3#1, main_~#bb~0#1.base, main_~#bb~0#1.offset + 4 * main_~b~0#1, 4);havoc main_#t~mem3#1;main_~b~0#1 := 1 + main_~b~0#1; {4632#(< |ULTIMATE.start_main_~a~0#1| 99999)} is VALID [2022-02-20 14:07:34,461 INFO L290 TraceCheckUtils]: 65: Hoare triple {4632#(< |ULTIMATE.start_main_~a~0#1| 99999)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {4632#(< |ULTIMATE.start_main_~a~0#1| 99999)} is VALID [2022-02-20 14:07:34,461 INFO L290 TraceCheckUtils]: 64: Hoare triple {4642#(< |ULTIMATE.start_main_~a~0#1| 99998)} main_~a~0#1 := 1 + main_~a~0#1; {4632#(< |ULTIMATE.start_main_~a~0#1| 99999)} is VALID [2022-02-20 14:07:34,462 INFO L290 TraceCheckUtils]: 63: Hoare triple {4642#(< |ULTIMATE.start_main_~a~0#1| 99998)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {4642#(< |ULTIMATE.start_main_~a~0#1| 99998)} is VALID [2022-02-20 14:07:34,462 INFO L290 TraceCheckUtils]: 62: Hoare triple {4642#(< |ULTIMATE.start_main_~a~0#1| 99998)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {4642#(< |ULTIMATE.start_main_~a~0#1| 99998)} is VALID [2022-02-20 14:07:34,462 INFO L290 TraceCheckUtils]: 61: Hoare triple {4652#(< |ULTIMATE.start_main_~a~0#1| 99997)} main_~a~0#1 := 1 + main_~a~0#1; {4642#(< |ULTIMATE.start_main_~a~0#1| 99998)} is VALID [2022-02-20 14:07:34,463 INFO L290 TraceCheckUtils]: 60: Hoare triple {4652#(< |ULTIMATE.start_main_~a~0#1| 99997)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {4652#(< |ULTIMATE.start_main_~a~0#1| 99997)} is VALID [2022-02-20 14:07:34,463 INFO L290 TraceCheckUtils]: 59: Hoare triple {4652#(< |ULTIMATE.start_main_~a~0#1| 99997)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {4652#(< |ULTIMATE.start_main_~a~0#1| 99997)} is VALID [2022-02-20 14:07:34,463 INFO L290 TraceCheckUtils]: 58: Hoare triple {4662#(< |ULTIMATE.start_main_~a~0#1| 99996)} main_~a~0#1 := 1 + main_~a~0#1; {4652#(< |ULTIMATE.start_main_~a~0#1| 99997)} is VALID [2022-02-20 14:07:34,464 INFO L290 TraceCheckUtils]: 57: Hoare triple {4662#(< |ULTIMATE.start_main_~a~0#1| 99996)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {4662#(< |ULTIMATE.start_main_~a~0#1| 99996)} is VALID [2022-02-20 14:07:34,464 INFO L290 TraceCheckUtils]: 56: Hoare triple {4662#(< |ULTIMATE.start_main_~a~0#1| 99996)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {4662#(< |ULTIMATE.start_main_~a~0#1| 99996)} is VALID [2022-02-20 14:07:34,464 INFO L290 TraceCheckUtils]: 55: Hoare triple {4672#(< |ULTIMATE.start_main_~a~0#1| 99995)} main_~a~0#1 := 1 + main_~a~0#1; {4662#(< |ULTIMATE.start_main_~a~0#1| 99996)} is VALID [2022-02-20 14:07:34,465 INFO L290 TraceCheckUtils]: 54: Hoare triple {4672#(< |ULTIMATE.start_main_~a~0#1| 99995)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {4672#(< |ULTIMATE.start_main_~a~0#1| 99995)} is VALID [2022-02-20 14:07:34,465 INFO L290 TraceCheckUtils]: 53: Hoare triple {4672#(< |ULTIMATE.start_main_~a~0#1| 99995)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {4672#(< |ULTIMATE.start_main_~a~0#1| 99995)} is VALID [2022-02-20 14:07:34,465 INFO L290 TraceCheckUtils]: 52: Hoare triple {4682#(< |ULTIMATE.start_main_~a~0#1| 99994)} main_~a~0#1 := 1 + main_~a~0#1; {4672#(< |ULTIMATE.start_main_~a~0#1| 99995)} is VALID [2022-02-20 14:07:34,466 INFO L290 TraceCheckUtils]: 51: Hoare triple {4682#(< |ULTIMATE.start_main_~a~0#1| 99994)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {4682#(< |ULTIMATE.start_main_~a~0#1| 99994)} is VALID [2022-02-20 14:07:34,466 INFO L290 TraceCheckUtils]: 50: Hoare triple {4682#(< |ULTIMATE.start_main_~a~0#1| 99994)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {4682#(< |ULTIMATE.start_main_~a~0#1| 99994)} is VALID [2022-02-20 14:07:34,466 INFO L290 TraceCheckUtils]: 49: Hoare triple {4692#(< |ULTIMATE.start_main_~a~0#1| 99993)} main_~a~0#1 := 1 + main_~a~0#1; {4682#(< |ULTIMATE.start_main_~a~0#1| 99994)} is VALID [2022-02-20 14:07:34,467 INFO L290 TraceCheckUtils]: 48: Hoare triple {4692#(< |ULTIMATE.start_main_~a~0#1| 99993)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {4692#(< |ULTIMATE.start_main_~a~0#1| 99993)} is VALID [2022-02-20 14:07:34,467 INFO L290 TraceCheckUtils]: 47: Hoare triple {4692#(< |ULTIMATE.start_main_~a~0#1| 99993)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {4692#(< |ULTIMATE.start_main_~a~0#1| 99993)} is VALID [2022-02-20 14:07:34,467 INFO L290 TraceCheckUtils]: 46: Hoare triple {4702#(< |ULTIMATE.start_main_~a~0#1| 99992)} main_~a~0#1 := 1 + main_~a~0#1; {4692#(< |ULTIMATE.start_main_~a~0#1| 99993)} is VALID [2022-02-20 14:07:34,468 INFO L290 TraceCheckUtils]: 45: Hoare triple {4702#(< |ULTIMATE.start_main_~a~0#1| 99992)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {4702#(< |ULTIMATE.start_main_~a~0#1| 99992)} is VALID [2022-02-20 14:07:34,468 INFO L290 TraceCheckUtils]: 44: Hoare triple {4702#(< |ULTIMATE.start_main_~a~0#1| 99992)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {4702#(< |ULTIMATE.start_main_~a~0#1| 99992)} is VALID [2022-02-20 14:07:34,468 INFO L290 TraceCheckUtils]: 43: Hoare triple {4712#(< |ULTIMATE.start_main_~a~0#1| 99991)} main_~a~0#1 := 1 + main_~a~0#1; {4702#(< |ULTIMATE.start_main_~a~0#1| 99992)} is VALID [2022-02-20 14:07:34,469 INFO L290 TraceCheckUtils]: 42: Hoare triple {4712#(< |ULTIMATE.start_main_~a~0#1| 99991)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {4712#(< |ULTIMATE.start_main_~a~0#1| 99991)} is VALID [2022-02-20 14:07:34,469 INFO L290 TraceCheckUtils]: 41: Hoare triple {4712#(< |ULTIMATE.start_main_~a~0#1| 99991)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {4712#(< |ULTIMATE.start_main_~a~0#1| 99991)} is VALID [2022-02-20 14:07:34,469 INFO L290 TraceCheckUtils]: 40: Hoare triple {4722#(< |ULTIMATE.start_main_~a~0#1| 99990)} main_~a~0#1 := 1 + main_~a~0#1; {4712#(< |ULTIMATE.start_main_~a~0#1| 99991)} is VALID [2022-02-20 14:07:34,470 INFO L290 TraceCheckUtils]: 39: Hoare triple {4722#(< |ULTIMATE.start_main_~a~0#1| 99990)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {4722#(< |ULTIMATE.start_main_~a~0#1| 99990)} is VALID [2022-02-20 14:07:34,470 INFO L290 TraceCheckUtils]: 38: Hoare triple {4722#(< |ULTIMATE.start_main_~a~0#1| 99990)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {4722#(< |ULTIMATE.start_main_~a~0#1| 99990)} is VALID [2022-02-20 14:07:34,470 INFO L290 TraceCheckUtils]: 37: Hoare triple {4732#(< |ULTIMATE.start_main_~a~0#1| 99989)} main_~a~0#1 := 1 + main_~a~0#1; {4722#(< |ULTIMATE.start_main_~a~0#1| 99990)} is VALID [2022-02-20 14:07:34,470 INFO L290 TraceCheckUtils]: 36: Hoare triple {4732#(< |ULTIMATE.start_main_~a~0#1| 99989)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {4732#(< |ULTIMATE.start_main_~a~0#1| 99989)} is VALID [2022-02-20 14:07:34,471 INFO L290 TraceCheckUtils]: 35: Hoare triple {4732#(< |ULTIMATE.start_main_~a~0#1| 99989)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {4732#(< |ULTIMATE.start_main_~a~0#1| 99989)} is VALID [2022-02-20 14:07:34,471 INFO L290 TraceCheckUtils]: 34: Hoare triple {4742#(< |ULTIMATE.start_main_~a~0#1| 99988)} main_~a~0#1 := 1 + main_~a~0#1; {4732#(< |ULTIMATE.start_main_~a~0#1| 99989)} is VALID [2022-02-20 14:07:34,472 INFO L290 TraceCheckUtils]: 33: Hoare triple {4742#(< |ULTIMATE.start_main_~a~0#1| 99988)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {4742#(< |ULTIMATE.start_main_~a~0#1| 99988)} is VALID [2022-02-20 14:07:34,472 INFO L290 TraceCheckUtils]: 32: Hoare triple {4742#(< |ULTIMATE.start_main_~a~0#1| 99988)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {4742#(< |ULTIMATE.start_main_~a~0#1| 99988)} is VALID [2022-02-20 14:07:34,472 INFO L290 TraceCheckUtils]: 31: Hoare triple {4752#(< |ULTIMATE.start_main_~a~0#1| 99987)} main_~a~0#1 := 1 + main_~a~0#1; {4742#(< |ULTIMATE.start_main_~a~0#1| 99988)} is VALID [2022-02-20 14:07:34,473 INFO L290 TraceCheckUtils]: 30: Hoare triple {4752#(< |ULTIMATE.start_main_~a~0#1| 99987)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {4752#(< |ULTIMATE.start_main_~a~0#1| 99987)} is VALID [2022-02-20 14:07:34,479 INFO L290 TraceCheckUtils]: 29: Hoare triple {4752#(< |ULTIMATE.start_main_~a~0#1| 99987)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {4752#(< |ULTIMATE.start_main_~a~0#1| 99987)} is VALID [2022-02-20 14:07:34,479 INFO L290 TraceCheckUtils]: 28: Hoare triple {4762#(< |ULTIMATE.start_main_~a~0#1| 99986)} main_~a~0#1 := 1 + main_~a~0#1; {4752#(< |ULTIMATE.start_main_~a~0#1| 99987)} is VALID [2022-02-20 14:07:34,480 INFO L290 TraceCheckUtils]: 27: Hoare triple {4762#(< |ULTIMATE.start_main_~a~0#1| 99986)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {4762#(< |ULTIMATE.start_main_~a~0#1| 99986)} is VALID [2022-02-20 14:07:34,480 INFO L290 TraceCheckUtils]: 26: Hoare triple {4762#(< |ULTIMATE.start_main_~a~0#1| 99986)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {4762#(< |ULTIMATE.start_main_~a~0#1| 99986)} is VALID [2022-02-20 14:07:34,480 INFO L290 TraceCheckUtils]: 25: Hoare triple {4772#(< |ULTIMATE.start_main_~a~0#1| 99985)} main_~a~0#1 := 1 + main_~a~0#1; {4762#(< |ULTIMATE.start_main_~a~0#1| 99986)} is VALID [2022-02-20 14:07:34,481 INFO L290 TraceCheckUtils]: 24: Hoare triple {4772#(< |ULTIMATE.start_main_~a~0#1| 99985)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {4772#(< |ULTIMATE.start_main_~a~0#1| 99985)} is VALID [2022-02-20 14:07:34,481 INFO L290 TraceCheckUtils]: 23: Hoare triple {4772#(< |ULTIMATE.start_main_~a~0#1| 99985)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {4772#(< |ULTIMATE.start_main_~a~0#1| 99985)} is VALID [2022-02-20 14:07:34,481 INFO L290 TraceCheckUtils]: 22: Hoare triple {4782#(< |ULTIMATE.start_main_~a~0#1| 99984)} main_~a~0#1 := 1 + main_~a~0#1; {4772#(< |ULTIMATE.start_main_~a~0#1| 99985)} is VALID [2022-02-20 14:07:34,482 INFO L290 TraceCheckUtils]: 21: Hoare triple {4782#(< |ULTIMATE.start_main_~a~0#1| 99984)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {4782#(< |ULTIMATE.start_main_~a~0#1| 99984)} is VALID [2022-02-20 14:07:34,482 INFO L290 TraceCheckUtils]: 20: Hoare triple {4782#(< |ULTIMATE.start_main_~a~0#1| 99984)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {4782#(< |ULTIMATE.start_main_~a~0#1| 99984)} is VALID [2022-02-20 14:07:34,482 INFO L290 TraceCheckUtils]: 19: Hoare triple {4792#(< |ULTIMATE.start_main_~a~0#1| 99983)} main_~a~0#1 := 1 + main_~a~0#1; {4782#(< |ULTIMATE.start_main_~a~0#1| 99984)} is VALID [2022-02-20 14:07:34,483 INFO L290 TraceCheckUtils]: 18: Hoare triple {4792#(< |ULTIMATE.start_main_~a~0#1| 99983)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {4792#(< |ULTIMATE.start_main_~a~0#1| 99983)} is VALID [2022-02-20 14:07:34,487 INFO L290 TraceCheckUtils]: 17: Hoare triple {4792#(< |ULTIMATE.start_main_~a~0#1| 99983)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {4792#(< |ULTIMATE.start_main_~a~0#1| 99983)} is VALID [2022-02-20 14:07:34,488 INFO L290 TraceCheckUtils]: 16: Hoare triple {4802#(< |ULTIMATE.start_main_~a~0#1| 99982)} main_~a~0#1 := 1 + main_~a~0#1; {4792#(< |ULTIMATE.start_main_~a~0#1| 99983)} is VALID [2022-02-20 14:07:34,488 INFO L290 TraceCheckUtils]: 15: Hoare triple {4802#(< |ULTIMATE.start_main_~a~0#1| 99982)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {4802#(< |ULTIMATE.start_main_~a~0#1| 99982)} is VALID [2022-02-20 14:07:34,488 INFO L290 TraceCheckUtils]: 14: Hoare triple {4802#(< |ULTIMATE.start_main_~a~0#1| 99982)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {4802#(< |ULTIMATE.start_main_~a~0#1| 99982)} is VALID [2022-02-20 14:07:34,489 INFO L290 TraceCheckUtils]: 13: Hoare triple {4812#(< |ULTIMATE.start_main_~a~0#1| 99981)} main_~a~0#1 := 1 + main_~a~0#1; {4802#(< |ULTIMATE.start_main_~a~0#1| 99982)} is VALID [2022-02-20 14:07:34,489 INFO L290 TraceCheckUtils]: 12: Hoare triple {4812#(< |ULTIMATE.start_main_~a~0#1| 99981)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {4812#(< |ULTIMATE.start_main_~a~0#1| 99981)} is VALID [2022-02-20 14:07:34,490 INFO L290 TraceCheckUtils]: 11: Hoare triple {4812#(< |ULTIMATE.start_main_~a~0#1| 99981)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {4812#(< |ULTIMATE.start_main_~a~0#1| 99981)} is VALID [2022-02-20 14:07:34,490 INFO L290 TraceCheckUtils]: 10: Hoare triple {4822#(< |ULTIMATE.start_main_~a~0#1| 99980)} main_~a~0#1 := 1 + main_~a~0#1; {4812#(< |ULTIMATE.start_main_~a~0#1| 99981)} is VALID [2022-02-20 14:07:34,490 INFO L290 TraceCheckUtils]: 9: Hoare triple {4822#(< |ULTIMATE.start_main_~a~0#1| 99980)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {4822#(< |ULTIMATE.start_main_~a~0#1| 99980)} is VALID [2022-02-20 14:07:34,491 INFO L290 TraceCheckUtils]: 8: Hoare triple {4822#(< |ULTIMATE.start_main_~a~0#1| 99980)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {4822#(< |ULTIMATE.start_main_~a~0#1| 99980)} is VALID [2022-02-20 14:07:34,491 INFO L290 TraceCheckUtils]: 7: Hoare triple {4832#(< |ULTIMATE.start_main_~a~0#1| 99979)} main_~a~0#1 := 1 + main_~a~0#1; {4822#(< |ULTIMATE.start_main_~a~0#1| 99980)} is VALID [2022-02-20 14:07:34,492 INFO L290 TraceCheckUtils]: 6: Hoare triple {4832#(< |ULTIMATE.start_main_~a~0#1| 99979)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {4832#(< |ULTIMATE.start_main_~a~0#1| 99979)} is VALID [2022-02-20 14:07:34,492 INFO L290 TraceCheckUtils]: 5: Hoare triple {4832#(< |ULTIMATE.start_main_~a~0#1| 99979)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {4832#(< |ULTIMATE.start_main_~a~0#1| 99979)} is VALID [2022-02-20 14:07:34,493 INFO L290 TraceCheckUtils]: 4: Hoare triple {4842#(< |ULTIMATE.start_main_~a~0#1| 99978)} main_~a~0#1 := 1 + main_~a~0#1; {4832#(< |ULTIMATE.start_main_~a~0#1| 99979)} is VALID [2022-02-20 14:07:34,493 INFO L290 TraceCheckUtils]: 3: Hoare triple {4842#(< |ULTIMATE.start_main_~a~0#1| 99978)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {4842#(< |ULTIMATE.start_main_~a~0#1| 99978)} is VALID [2022-02-20 14:07:34,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {4842#(< |ULTIMATE.start_main_~a~0#1| 99978)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {4842#(< |ULTIMATE.start_main_~a~0#1| 99978)} is VALID [2022-02-20 14:07:34,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {3951#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~#bb~0#1.base, main_~#bb~0#1.offset, main_~#cc~0#1.base, main_~#cc~0#1.offset, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;main_~b~0#1 := 0;main_~c~0#1 := 0;call main_~#bb~0#1.base, main_~#bb~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#cc~0#1.base, main_~#cc~0#1.offset := #Ultimate.allocOnStack(400000); {4842#(< |ULTIMATE.start_main_~a~0#1| 99978)} is VALID [2022-02-20 14:07:34,494 INFO L290 TraceCheckUtils]: 0: Hoare triple {3951#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); {3951#true} is VALID [2022-02-20 14:07:34,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1430 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2022-02-20 14:07:34,495 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483575938] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:07:34,496 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:07:34,496 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2022-02-20 14:07:34,496 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904249793] [2022-02-20 14:07:34,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:07:34,497 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 3.0816326530612246) internal successors, (151), 49 states have internal predecessors, (151), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2022-02-20 14:07:34,498 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:07:34,498 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 49 states, 49 states have (on average 3.0816326530612246) internal successors, (151), 49 states have internal predecessors, (151), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:07:34,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:07:34,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-02-20 14:07:34,626 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:07:34,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-02-20 14:07:34,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-02-20 14:07:34,628 INFO L87 Difference]: Start difference. First operand 288 states and 381 transitions. Second operand has 49 states, 49 states have (on average 3.0816326530612246) internal successors, (151), 49 states have internal predecessors, (151), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:07:35,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:07:35,952 INFO L93 Difference]: Finished difference Result 730 states and 1063 transitions. [2022-02-20 14:07:35,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-02-20 14:07:35,953 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 3.0816326530612246) internal successors, (151), 49 states have internal predecessors, (151), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2022-02-20 14:07:35,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:07:35,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 3.0816326530612246) internal successors, (151), 49 states have internal predecessors, (151), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:07:35,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 465 transitions. [2022-02-20 14:07:35,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 3.0816326530612246) internal successors, (151), 49 states have internal predecessors, (151), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:07:35,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 465 transitions. [2022-02-20 14:07:35,966 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 465 transitions. [2022-02-20 14:07:36,292 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 465 edges. 465 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:07:36,309 INFO L225 Difference]: With dead ends: 730 [2022-02-20 14:07:36,309 INFO L226 Difference]: Without dead ends: 576 [2022-02-20 14:07:36,311 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-02-20 14:07:36,311 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 873 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 873 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 14:07:36,312 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [873 Valid, 153 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 14:07:36,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2022-02-20 14:07:36,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 576. [2022-02-20 14:07:36,445 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:07:36,447 INFO L82 GeneralOperation]: Start isEquivalent. First operand 576 states. Second operand has 576 states, 572 states have (on average 1.3304195804195804) internal successors, (761), 572 states have internal predecessors, (761), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:07:36,448 INFO L74 IsIncluded]: Start isIncluded. First operand 576 states. Second operand has 576 states, 572 states have (on average 1.3304195804195804) internal successors, (761), 572 states have internal predecessors, (761), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:07:36,450 INFO L87 Difference]: Start difference. First operand 576 states. Second operand has 576 states, 572 states have (on average 1.3304195804195804) internal successors, (761), 572 states have internal predecessors, (761), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:07:36,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:07:36,473 INFO L93 Difference]: Finished difference Result 576 states and 765 transitions. [2022-02-20 14:07:36,473 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 765 transitions. [2022-02-20 14:07:36,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:07:36,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:07:36,478 INFO L74 IsIncluded]: Start isIncluded. First operand has 576 states, 572 states have (on average 1.3304195804195804) internal successors, (761), 572 states have internal predecessors, (761), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 576 states. [2022-02-20 14:07:36,480 INFO L87 Difference]: Start difference. First operand has 576 states, 572 states have (on average 1.3304195804195804) internal successors, (761), 572 states have internal predecessors, (761), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 576 states. [2022-02-20 14:07:36,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:07:36,515 INFO L93 Difference]: Finished difference Result 576 states and 765 transitions. [2022-02-20 14:07:36,515 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 765 transitions. [2022-02-20 14:07:36,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:07:36,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:07:36,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:07:36,516 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:07:36,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 572 states have (on average 1.3304195804195804) internal successors, (761), 572 states have internal predecessors, (761), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:07:36,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 765 transitions. [2022-02-20 14:07:36,541 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 765 transitions. Word has length 143 [2022-02-20 14:07:36,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:07:36,541 INFO L470 AbstractCegarLoop]: Abstraction has 576 states and 765 transitions. [2022-02-20 14:07:36,542 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 3.0816326530612246) internal successors, (151), 49 states have internal predecessors, (151), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:07:36,542 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 765 transitions. [2022-02-20 14:07:36,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2022-02-20 14:07:36,546 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:07:36,546 INFO L514 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 46, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:07:36,591 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:07:36,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:07:36,759 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:07:36,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:07:36,760 INFO L85 PathProgramCache]: Analyzing trace with hash 2061111338, now seen corresponding path program 4 times [2022-02-20 14:07:36,760 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:07:36,760 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878012976] [2022-02-20 14:07:36,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:07:36,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:07:36,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:07:38,051 INFO L290 TraceCheckUtils]: 0: Hoare triple {7750#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); {7750#true} is VALID [2022-02-20 14:07:38,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {7750#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~#bb~0#1.base, main_~#bb~0#1.offset, main_~#cc~0#1.base, main_~#cc~0#1.offset, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;main_~b~0#1 := 0;main_~c~0#1 := 0;call main_~#bb~0#1.base, main_~#bb~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#cc~0#1.base, main_~#cc~0#1.offset := #Ultimate.allocOnStack(400000); {7752#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:07:38,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {7752#(= |ULTIMATE.start_main_~a~0#1| 0)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7752#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:07:38,052 INFO L290 TraceCheckUtils]: 3: Hoare triple {7752#(= |ULTIMATE.start_main_~a~0#1| 0)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {7752#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-20 14:07:38,053 INFO L290 TraceCheckUtils]: 4: Hoare triple {7752#(= |ULTIMATE.start_main_~a~0#1| 0)} main_~a~0#1 := 1 + main_~a~0#1; {7753#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:07:38,053 INFO L290 TraceCheckUtils]: 5: Hoare triple {7753#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7753#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:07:38,054 INFO L290 TraceCheckUtils]: 6: Hoare triple {7753#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {7753#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-20 14:07:38,054 INFO L290 TraceCheckUtils]: 7: Hoare triple {7753#(<= |ULTIMATE.start_main_~a~0#1| 1)} main_~a~0#1 := 1 + main_~a~0#1; {7754#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:07:38,055 INFO L290 TraceCheckUtils]: 8: Hoare triple {7754#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7754#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:07:38,055 INFO L290 TraceCheckUtils]: 9: Hoare triple {7754#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {7754#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-20 14:07:38,056 INFO L290 TraceCheckUtils]: 10: Hoare triple {7754#(<= |ULTIMATE.start_main_~a~0#1| 2)} main_~a~0#1 := 1 + main_~a~0#1; {7755#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:07:38,056 INFO L290 TraceCheckUtils]: 11: Hoare triple {7755#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7755#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:07:38,056 INFO L290 TraceCheckUtils]: 12: Hoare triple {7755#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {7755#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-20 14:07:38,057 INFO L290 TraceCheckUtils]: 13: Hoare triple {7755#(<= |ULTIMATE.start_main_~a~0#1| 3)} main_~a~0#1 := 1 + main_~a~0#1; {7756#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:07:38,057 INFO L290 TraceCheckUtils]: 14: Hoare triple {7756#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7756#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:07:38,058 INFO L290 TraceCheckUtils]: 15: Hoare triple {7756#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {7756#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-20 14:07:38,058 INFO L290 TraceCheckUtils]: 16: Hoare triple {7756#(<= |ULTIMATE.start_main_~a~0#1| 4)} main_~a~0#1 := 1 + main_~a~0#1; {7757#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-20 14:07:38,058 INFO L290 TraceCheckUtils]: 17: Hoare triple {7757#(<= |ULTIMATE.start_main_~a~0#1| 5)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7757#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-20 14:07:38,059 INFO L290 TraceCheckUtils]: 18: Hoare triple {7757#(<= |ULTIMATE.start_main_~a~0#1| 5)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {7757#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-20 14:07:38,059 INFO L290 TraceCheckUtils]: 19: Hoare triple {7757#(<= |ULTIMATE.start_main_~a~0#1| 5)} main_~a~0#1 := 1 + main_~a~0#1; {7758#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-20 14:07:38,060 INFO L290 TraceCheckUtils]: 20: Hoare triple {7758#(<= |ULTIMATE.start_main_~a~0#1| 6)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7758#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-20 14:07:38,060 INFO L290 TraceCheckUtils]: 21: Hoare triple {7758#(<= |ULTIMATE.start_main_~a~0#1| 6)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {7758#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-20 14:07:38,061 INFO L290 TraceCheckUtils]: 22: Hoare triple {7758#(<= |ULTIMATE.start_main_~a~0#1| 6)} main_~a~0#1 := 1 + main_~a~0#1; {7759#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-20 14:07:38,061 INFO L290 TraceCheckUtils]: 23: Hoare triple {7759#(<= |ULTIMATE.start_main_~a~0#1| 7)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7759#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-20 14:07:38,061 INFO L290 TraceCheckUtils]: 24: Hoare triple {7759#(<= |ULTIMATE.start_main_~a~0#1| 7)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {7759#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-20 14:07:38,062 INFO L290 TraceCheckUtils]: 25: Hoare triple {7759#(<= |ULTIMATE.start_main_~a~0#1| 7)} main_~a~0#1 := 1 + main_~a~0#1; {7760#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-20 14:07:38,062 INFO L290 TraceCheckUtils]: 26: Hoare triple {7760#(<= |ULTIMATE.start_main_~a~0#1| 8)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7760#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-20 14:07:38,063 INFO L290 TraceCheckUtils]: 27: Hoare triple {7760#(<= |ULTIMATE.start_main_~a~0#1| 8)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {7760#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-20 14:07:38,063 INFO L290 TraceCheckUtils]: 28: Hoare triple {7760#(<= |ULTIMATE.start_main_~a~0#1| 8)} main_~a~0#1 := 1 + main_~a~0#1; {7761#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-20 14:07:38,063 INFO L290 TraceCheckUtils]: 29: Hoare triple {7761#(<= |ULTIMATE.start_main_~a~0#1| 9)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7761#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-20 14:07:38,064 INFO L290 TraceCheckUtils]: 30: Hoare triple {7761#(<= |ULTIMATE.start_main_~a~0#1| 9)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {7761#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-20 14:07:38,064 INFO L290 TraceCheckUtils]: 31: Hoare triple {7761#(<= |ULTIMATE.start_main_~a~0#1| 9)} main_~a~0#1 := 1 + main_~a~0#1; {7762#(<= |ULTIMATE.start_main_~a~0#1| 10)} is VALID [2022-02-20 14:07:38,065 INFO L290 TraceCheckUtils]: 32: Hoare triple {7762#(<= |ULTIMATE.start_main_~a~0#1| 10)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7762#(<= |ULTIMATE.start_main_~a~0#1| 10)} is VALID [2022-02-20 14:07:38,065 INFO L290 TraceCheckUtils]: 33: Hoare triple {7762#(<= |ULTIMATE.start_main_~a~0#1| 10)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {7762#(<= |ULTIMATE.start_main_~a~0#1| 10)} is VALID [2022-02-20 14:07:38,066 INFO L290 TraceCheckUtils]: 34: Hoare triple {7762#(<= |ULTIMATE.start_main_~a~0#1| 10)} main_~a~0#1 := 1 + main_~a~0#1; {7763#(<= |ULTIMATE.start_main_~a~0#1| 11)} is VALID [2022-02-20 14:07:38,066 INFO L290 TraceCheckUtils]: 35: Hoare triple {7763#(<= |ULTIMATE.start_main_~a~0#1| 11)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7763#(<= |ULTIMATE.start_main_~a~0#1| 11)} is VALID [2022-02-20 14:07:38,066 INFO L290 TraceCheckUtils]: 36: Hoare triple {7763#(<= |ULTIMATE.start_main_~a~0#1| 11)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {7763#(<= |ULTIMATE.start_main_~a~0#1| 11)} is VALID [2022-02-20 14:07:38,067 INFO L290 TraceCheckUtils]: 37: Hoare triple {7763#(<= |ULTIMATE.start_main_~a~0#1| 11)} main_~a~0#1 := 1 + main_~a~0#1; {7764#(<= |ULTIMATE.start_main_~a~0#1| 12)} is VALID [2022-02-20 14:07:38,067 INFO L290 TraceCheckUtils]: 38: Hoare triple {7764#(<= |ULTIMATE.start_main_~a~0#1| 12)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7764#(<= |ULTIMATE.start_main_~a~0#1| 12)} is VALID [2022-02-20 14:07:38,068 INFO L290 TraceCheckUtils]: 39: Hoare triple {7764#(<= |ULTIMATE.start_main_~a~0#1| 12)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {7764#(<= |ULTIMATE.start_main_~a~0#1| 12)} is VALID [2022-02-20 14:07:38,068 INFO L290 TraceCheckUtils]: 40: Hoare triple {7764#(<= |ULTIMATE.start_main_~a~0#1| 12)} main_~a~0#1 := 1 + main_~a~0#1; {7765#(<= |ULTIMATE.start_main_~a~0#1| 13)} is VALID [2022-02-20 14:07:38,069 INFO L290 TraceCheckUtils]: 41: Hoare triple {7765#(<= |ULTIMATE.start_main_~a~0#1| 13)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7765#(<= |ULTIMATE.start_main_~a~0#1| 13)} is VALID [2022-02-20 14:07:38,069 INFO L290 TraceCheckUtils]: 42: Hoare triple {7765#(<= |ULTIMATE.start_main_~a~0#1| 13)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {7765#(<= |ULTIMATE.start_main_~a~0#1| 13)} is VALID [2022-02-20 14:07:38,069 INFO L290 TraceCheckUtils]: 43: Hoare triple {7765#(<= |ULTIMATE.start_main_~a~0#1| 13)} main_~a~0#1 := 1 + main_~a~0#1; {7766#(<= |ULTIMATE.start_main_~a~0#1| 14)} is VALID [2022-02-20 14:07:38,070 INFO L290 TraceCheckUtils]: 44: Hoare triple {7766#(<= |ULTIMATE.start_main_~a~0#1| 14)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7766#(<= |ULTIMATE.start_main_~a~0#1| 14)} is VALID [2022-02-20 14:07:38,070 INFO L290 TraceCheckUtils]: 45: Hoare triple {7766#(<= |ULTIMATE.start_main_~a~0#1| 14)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {7766#(<= |ULTIMATE.start_main_~a~0#1| 14)} is VALID [2022-02-20 14:07:38,071 INFO L290 TraceCheckUtils]: 46: Hoare triple {7766#(<= |ULTIMATE.start_main_~a~0#1| 14)} main_~a~0#1 := 1 + main_~a~0#1; {7767#(<= |ULTIMATE.start_main_~a~0#1| 15)} is VALID [2022-02-20 14:07:38,071 INFO L290 TraceCheckUtils]: 47: Hoare triple {7767#(<= |ULTIMATE.start_main_~a~0#1| 15)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7767#(<= |ULTIMATE.start_main_~a~0#1| 15)} is VALID [2022-02-20 14:07:38,072 INFO L290 TraceCheckUtils]: 48: Hoare triple {7767#(<= |ULTIMATE.start_main_~a~0#1| 15)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {7767#(<= |ULTIMATE.start_main_~a~0#1| 15)} is VALID [2022-02-20 14:07:38,072 INFO L290 TraceCheckUtils]: 49: Hoare triple {7767#(<= |ULTIMATE.start_main_~a~0#1| 15)} main_~a~0#1 := 1 + main_~a~0#1; {7768#(<= |ULTIMATE.start_main_~a~0#1| 16)} is VALID [2022-02-20 14:07:38,073 INFO L290 TraceCheckUtils]: 50: Hoare triple {7768#(<= |ULTIMATE.start_main_~a~0#1| 16)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7768#(<= |ULTIMATE.start_main_~a~0#1| 16)} is VALID [2022-02-20 14:07:38,073 INFO L290 TraceCheckUtils]: 51: Hoare triple {7768#(<= |ULTIMATE.start_main_~a~0#1| 16)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {7768#(<= |ULTIMATE.start_main_~a~0#1| 16)} is VALID [2022-02-20 14:07:38,073 INFO L290 TraceCheckUtils]: 52: Hoare triple {7768#(<= |ULTIMATE.start_main_~a~0#1| 16)} main_~a~0#1 := 1 + main_~a~0#1; {7769#(<= |ULTIMATE.start_main_~a~0#1| 17)} is VALID [2022-02-20 14:07:38,074 INFO L290 TraceCheckUtils]: 53: Hoare triple {7769#(<= |ULTIMATE.start_main_~a~0#1| 17)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7769#(<= |ULTIMATE.start_main_~a~0#1| 17)} is VALID [2022-02-20 14:07:38,074 INFO L290 TraceCheckUtils]: 54: Hoare triple {7769#(<= |ULTIMATE.start_main_~a~0#1| 17)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {7769#(<= |ULTIMATE.start_main_~a~0#1| 17)} is VALID [2022-02-20 14:07:38,075 INFO L290 TraceCheckUtils]: 55: Hoare triple {7769#(<= |ULTIMATE.start_main_~a~0#1| 17)} main_~a~0#1 := 1 + main_~a~0#1; {7770#(<= |ULTIMATE.start_main_~a~0#1| 18)} is VALID [2022-02-20 14:07:38,075 INFO L290 TraceCheckUtils]: 56: Hoare triple {7770#(<= |ULTIMATE.start_main_~a~0#1| 18)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7770#(<= |ULTIMATE.start_main_~a~0#1| 18)} is VALID [2022-02-20 14:07:38,076 INFO L290 TraceCheckUtils]: 57: Hoare triple {7770#(<= |ULTIMATE.start_main_~a~0#1| 18)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {7770#(<= |ULTIMATE.start_main_~a~0#1| 18)} is VALID [2022-02-20 14:07:38,076 INFO L290 TraceCheckUtils]: 58: Hoare triple {7770#(<= |ULTIMATE.start_main_~a~0#1| 18)} main_~a~0#1 := 1 + main_~a~0#1; {7771#(<= |ULTIMATE.start_main_~a~0#1| 19)} is VALID [2022-02-20 14:07:38,076 INFO L290 TraceCheckUtils]: 59: Hoare triple {7771#(<= |ULTIMATE.start_main_~a~0#1| 19)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7771#(<= |ULTIMATE.start_main_~a~0#1| 19)} is VALID [2022-02-20 14:07:38,077 INFO L290 TraceCheckUtils]: 60: Hoare triple {7771#(<= |ULTIMATE.start_main_~a~0#1| 19)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {7771#(<= |ULTIMATE.start_main_~a~0#1| 19)} is VALID [2022-02-20 14:07:38,077 INFO L290 TraceCheckUtils]: 61: Hoare triple {7771#(<= |ULTIMATE.start_main_~a~0#1| 19)} main_~a~0#1 := 1 + main_~a~0#1; {7772#(<= |ULTIMATE.start_main_~a~0#1| 20)} is VALID [2022-02-20 14:07:38,078 INFO L290 TraceCheckUtils]: 62: Hoare triple {7772#(<= |ULTIMATE.start_main_~a~0#1| 20)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7772#(<= |ULTIMATE.start_main_~a~0#1| 20)} is VALID [2022-02-20 14:07:38,078 INFO L290 TraceCheckUtils]: 63: Hoare triple {7772#(<= |ULTIMATE.start_main_~a~0#1| 20)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {7772#(<= |ULTIMATE.start_main_~a~0#1| 20)} is VALID [2022-02-20 14:07:38,079 INFO L290 TraceCheckUtils]: 64: Hoare triple {7772#(<= |ULTIMATE.start_main_~a~0#1| 20)} main_~a~0#1 := 1 + main_~a~0#1; {7773#(<= |ULTIMATE.start_main_~a~0#1| 21)} is VALID [2022-02-20 14:07:38,079 INFO L290 TraceCheckUtils]: 65: Hoare triple {7773#(<= |ULTIMATE.start_main_~a~0#1| 21)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7773#(<= |ULTIMATE.start_main_~a~0#1| 21)} is VALID [2022-02-20 14:07:38,079 INFO L290 TraceCheckUtils]: 66: Hoare triple {7773#(<= |ULTIMATE.start_main_~a~0#1| 21)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {7773#(<= |ULTIMATE.start_main_~a~0#1| 21)} is VALID [2022-02-20 14:07:38,080 INFO L290 TraceCheckUtils]: 67: Hoare triple {7773#(<= |ULTIMATE.start_main_~a~0#1| 21)} main_~a~0#1 := 1 + main_~a~0#1; {7774#(<= |ULTIMATE.start_main_~a~0#1| 22)} is VALID [2022-02-20 14:07:38,080 INFO L290 TraceCheckUtils]: 68: Hoare triple {7774#(<= |ULTIMATE.start_main_~a~0#1| 22)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7774#(<= |ULTIMATE.start_main_~a~0#1| 22)} is VALID [2022-02-20 14:07:38,081 INFO L290 TraceCheckUtils]: 69: Hoare triple {7774#(<= |ULTIMATE.start_main_~a~0#1| 22)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {7774#(<= |ULTIMATE.start_main_~a~0#1| 22)} is VALID [2022-02-20 14:07:38,081 INFO L290 TraceCheckUtils]: 70: Hoare triple {7774#(<= |ULTIMATE.start_main_~a~0#1| 22)} main_~a~0#1 := 1 + main_~a~0#1; {7775#(<= |ULTIMATE.start_main_~a~0#1| 23)} is VALID [2022-02-20 14:07:38,082 INFO L290 TraceCheckUtils]: 71: Hoare triple {7775#(<= |ULTIMATE.start_main_~a~0#1| 23)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7775#(<= |ULTIMATE.start_main_~a~0#1| 23)} is VALID [2022-02-20 14:07:38,082 INFO L290 TraceCheckUtils]: 72: Hoare triple {7775#(<= |ULTIMATE.start_main_~a~0#1| 23)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {7775#(<= |ULTIMATE.start_main_~a~0#1| 23)} is VALID [2022-02-20 14:07:38,083 INFO L290 TraceCheckUtils]: 73: Hoare triple {7775#(<= |ULTIMATE.start_main_~a~0#1| 23)} main_~a~0#1 := 1 + main_~a~0#1; {7776#(<= |ULTIMATE.start_main_~a~0#1| 24)} is VALID [2022-02-20 14:07:38,083 INFO L290 TraceCheckUtils]: 74: Hoare triple {7776#(<= |ULTIMATE.start_main_~a~0#1| 24)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7776#(<= |ULTIMATE.start_main_~a~0#1| 24)} is VALID [2022-02-20 14:07:38,083 INFO L290 TraceCheckUtils]: 75: Hoare triple {7776#(<= |ULTIMATE.start_main_~a~0#1| 24)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {7776#(<= |ULTIMATE.start_main_~a~0#1| 24)} is VALID [2022-02-20 14:07:38,084 INFO L290 TraceCheckUtils]: 76: Hoare triple {7776#(<= |ULTIMATE.start_main_~a~0#1| 24)} main_~a~0#1 := 1 + main_~a~0#1; {7777#(<= |ULTIMATE.start_main_~a~0#1| 25)} is VALID [2022-02-20 14:07:38,084 INFO L290 TraceCheckUtils]: 77: Hoare triple {7777#(<= |ULTIMATE.start_main_~a~0#1| 25)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7777#(<= |ULTIMATE.start_main_~a~0#1| 25)} is VALID [2022-02-20 14:07:38,085 INFO L290 TraceCheckUtils]: 78: Hoare triple {7777#(<= |ULTIMATE.start_main_~a~0#1| 25)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {7777#(<= |ULTIMATE.start_main_~a~0#1| 25)} is VALID [2022-02-20 14:07:38,085 INFO L290 TraceCheckUtils]: 79: Hoare triple {7777#(<= |ULTIMATE.start_main_~a~0#1| 25)} main_~a~0#1 := 1 + main_~a~0#1; {7778#(<= |ULTIMATE.start_main_~a~0#1| 26)} is VALID [2022-02-20 14:07:38,086 INFO L290 TraceCheckUtils]: 80: Hoare triple {7778#(<= |ULTIMATE.start_main_~a~0#1| 26)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7778#(<= |ULTIMATE.start_main_~a~0#1| 26)} is VALID [2022-02-20 14:07:38,086 INFO L290 TraceCheckUtils]: 81: Hoare triple {7778#(<= |ULTIMATE.start_main_~a~0#1| 26)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {7778#(<= |ULTIMATE.start_main_~a~0#1| 26)} is VALID [2022-02-20 14:07:38,086 INFO L290 TraceCheckUtils]: 82: Hoare triple {7778#(<= |ULTIMATE.start_main_~a~0#1| 26)} main_~a~0#1 := 1 + main_~a~0#1; {7779#(<= |ULTIMATE.start_main_~a~0#1| 27)} is VALID [2022-02-20 14:07:38,087 INFO L290 TraceCheckUtils]: 83: Hoare triple {7779#(<= |ULTIMATE.start_main_~a~0#1| 27)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7779#(<= |ULTIMATE.start_main_~a~0#1| 27)} is VALID [2022-02-20 14:07:38,087 INFO L290 TraceCheckUtils]: 84: Hoare triple {7779#(<= |ULTIMATE.start_main_~a~0#1| 27)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {7779#(<= |ULTIMATE.start_main_~a~0#1| 27)} is VALID [2022-02-20 14:07:38,088 INFO L290 TraceCheckUtils]: 85: Hoare triple {7779#(<= |ULTIMATE.start_main_~a~0#1| 27)} main_~a~0#1 := 1 + main_~a~0#1; {7780#(<= |ULTIMATE.start_main_~a~0#1| 28)} is VALID [2022-02-20 14:07:38,088 INFO L290 TraceCheckUtils]: 86: Hoare triple {7780#(<= |ULTIMATE.start_main_~a~0#1| 28)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7780#(<= |ULTIMATE.start_main_~a~0#1| 28)} is VALID [2022-02-20 14:07:38,089 INFO L290 TraceCheckUtils]: 87: Hoare triple {7780#(<= |ULTIMATE.start_main_~a~0#1| 28)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {7780#(<= |ULTIMATE.start_main_~a~0#1| 28)} is VALID [2022-02-20 14:07:38,089 INFO L290 TraceCheckUtils]: 88: Hoare triple {7780#(<= |ULTIMATE.start_main_~a~0#1| 28)} main_~a~0#1 := 1 + main_~a~0#1; {7781#(<= |ULTIMATE.start_main_~a~0#1| 29)} is VALID [2022-02-20 14:07:38,089 INFO L290 TraceCheckUtils]: 89: Hoare triple {7781#(<= |ULTIMATE.start_main_~a~0#1| 29)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7781#(<= |ULTIMATE.start_main_~a~0#1| 29)} is VALID [2022-02-20 14:07:38,090 INFO L290 TraceCheckUtils]: 90: Hoare triple {7781#(<= |ULTIMATE.start_main_~a~0#1| 29)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {7781#(<= |ULTIMATE.start_main_~a~0#1| 29)} is VALID [2022-02-20 14:07:38,090 INFO L290 TraceCheckUtils]: 91: Hoare triple {7781#(<= |ULTIMATE.start_main_~a~0#1| 29)} main_~a~0#1 := 1 + main_~a~0#1; {7782#(<= |ULTIMATE.start_main_~a~0#1| 30)} is VALID [2022-02-20 14:07:38,091 INFO L290 TraceCheckUtils]: 92: Hoare triple {7782#(<= |ULTIMATE.start_main_~a~0#1| 30)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7782#(<= |ULTIMATE.start_main_~a~0#1| 30)} is VALID [2022-02-20 14:07:38,091 INFO L290 TraceCheckUtils]: 93: Hoare triple {7782#(<= |ULTIMATE.start_main_~a~0#1| 30)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {7782#(<= |ULTIMATE.start_main_~a~0#1| 30)} is VALID [2022-02-20 14:07:38,092 INFO L290 TraceCheckUtils]: 94: Hoare triple {7782#(<= |ULTIMATE.start_main_~a~0#1| 30)} main_~a~0#1 := 1 + main_~a~0#1; {7783#(<= |ULTIMATE.start_main_~a~0#1| 31)} is VALID [2022-02-20 14:07:38,092 INFO L290 TraceCheckUtils]: 95: Hoare triple {7783#(<= |ULTIMATE.start_main_~a~0#1| 31)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7783#(<= |ULTIMATE.start_main_~a~0#1| 31)} is VALID [2022-02-20 14:07:38,092 INFO L290 TraceCheckUtils]: 96: Hoare triple {7783#(<= |ULTIMATE.start_main_~a~0#1| 31)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {7783#(<= |ULTIMATE.start_main_~a~0#1| 31)} is VALID [2022-02-20 14:07:38,093 INFO L290 TraceCheckUtils]: 97: Hoare triple {7783#(<= |ULTIMATE.start_main_~a~0#1| 31)} main_~a~0#1 := 1 + main_~a~0#1; {7784#(<= |ULTIMATE.start_main_~a~0#1| 32)} is VALID [2022-02-20 14:07:38,093 INFO L290 TraceCheckUtils]: 98: Hoare triple {7784#(<= |ULTIMATE.start_main_~a~0#1| 32)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7784#(<= |ULTIMATE.start_main_~a~0#1| 32)} is VALID [2022-02-20 14:07:38,094 INFO L290 TraceCheckUtils]: 99: Hoare triple {7784#(<= |ULTIMATE.start_main_~a~0#1| 32)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {7784#(<= |ULTIMATE.start_main_~a~0#1| 32)} is VALID [2022-02-20 14:07:38,094 INFO L290 TraceCheckUtils]: 100: Hoare triple {7784#(<= |ULTIMATE.start_main_~a~0#1| 32)} main_~a~0#1 := 1 + main_~a~0#1; {7785#(<= |ULTIMATE.start_main_~a~0#1| 33)} is VALID [2022-02-20 14:07:38,095 INFO L290 TraceCheckUtils]: 101: Hoare triple {7785#(<= |ULTIMATE.start_main_~a~0#1| 33)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7785#(<= |ULTIMATE.start_main_~a~0#1| 33)} is VALID [2022-02-20 14:07:38,095 INFO L290 TraceCheckUtils]: 102: Hoare triple {7785#(<= |ULTIMATE.start_main_~a~0#1| 33)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {7785#(<= |ULTIMATE.start_main_~a~0#1| 33)} is VALID [2022-02-20 14:07:38,095 INFO L290 TraceCheckUtils]: 103: Hoare triple {7785#(<= |ULTIMATE.start_main_~a~0#1| 33)} main_~a~0#1 := 1 + main_~a~0#1; {7786#(<= |ULTIMATE.start_main_~a~0#1| 34)} is VALID [2022-02-20 14:07:38,096 INFO L290 TraceCheckUtils]: 104: Hoare triple {7786#(<= |ULTIMATE.start_main_~a~0#1| 34)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7786#(<= |ULTIMATE.start_main_~a~0#1| 34)} is VALID [2022-02-20 14:07:38,096 INFO L290 TraceCheckUtils]: 105: Hoare triple {7786#(<= |ULTIMATE.start_main_~a~0#1| 34)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {7786#(<= |ULTIMATE.start_main_~a~0#1| 34)} is VALID [2022-02-20 14:07:38,096 INFO L290 TraceCheckUtils]: 106: Hoare triple {7786#(<= |ULTIMATE.start_main_~a~0#1| 34)} main_~a~0#1 := 1 + main_~a~0#1; {7787#(<= |ULTIMATE.start_main_~a~0#1| 35)} is VALID [2022-02-20 14:07:38,097 INFO L290 TraceCheckUtils]: 107: Hoare triple {7787#(<= |ULTIMATE.start_main_~a~0#1| 35)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7787#(<= |ULTIMATE.start_main_~a~0#1| 35)} is VALID [2022-02-20 14:07:38,097 INFO L290 TraceCheckUtils]: 108: Hoare triple {7787#(<= |ULTIMATE.start_main_~a~0#1| 35)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {7787#(<= |ULTIMATE.start_main_~a~0#1| 35)} is VALID [2022-02-20 14:07:38,098 INFO L290 TraceCheckUtils]: 109: Hoare triple {7787#(<= |ULTIMATE.start_main_~a~0#1| 35)} main_~a~0#1 := 1 + main_~a~0#1; {7788#(<= |ULTIMATE.start_main_~a~0#1| 36)} is VALID [2022-02-20 14:07:38,098 INFO L290 TraceCheckUtils]: 110: Hoare triple {7788#(<= |ULTIMATE.start_main_~a~0#1| 36)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7788#(<= |ULTIMATE.start_main_~a~0#1| 36)} is VALID [2022-02-20 14:07:38,099 INFO L290 TraceCheckUtils]: 111: Hoare triple {7788#(<= |ULTIMATE.start_main_~a~0#1| 36)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {7788#(<= |ULTIMATE.start_main_~a~0#1| 36)} is VALID [2022-02-20 14:07:38,099 INFO L290 TraceCheckUtils]: 112: Hoare triple {7788#(<= |ULTIMATE.start_main_~a~0#1| 36)} main_~a~0#1 := 1 + main_~a~0#1; {7789#(<= |ULTIMATE.start_main_~a~0#1| 37)} is VALID [2022-02-20 14:07:38,099 INFO L290 TraceCheckUtils]: 113: Hoare triple {7789#(<= |ULTIMATE.start_main_~a~0#1| 37)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7789#(<= |ULTIMATE.start_main_~a~0#1| 37)} is VALID [2022-02-20 14:07:38,100 INFO L290 TraceCheckUtils]: 114: Hoare triple {7789#(<= |ULTIMATE.start_main_~a~0#1| 37)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {7789#(<= |ULTIMATE.start_main_~a~0#1| 37)} is VALID [2022-02-20 14:07:38,100 INFO L290 TraceCheckUtils]: 115: Hoare triple {7789#(<= |ULTIMATE.start_main_~a~0#1| 37)} main_~a~0#1 := 1 + main_~a~0#1; {7790#(<= |ULTIMATE.start_main_~a~0#1| 38)} is VALID [2022-02-20 14:07:38,100 INFO L290 TraceCheckUtils]: 116: Hoare triple {7790#(<= |ULTIMATE.start_main_~a~0#1| 38)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7790#(<= |ULTIMATE.start_main_~a~0#1| 38)} is VALID [2022-02-20 14:07:38,101 INFO L290 TraceCheckUtils]: 117: Hoare triple {7790#(<= |ULTIMATE.start_main_~a~0#1| 38)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {7790#(<= |ULTIMATE.start_main_~a~0#1| 38)} is VALID [2022-02-20 14:07:38,101 INFO L290 TraceCheckUtils]: 118: Hoare triple {7790#(<= |ULTIMATE.start_main_~a~0#1| 38)} main_~a~0#1 := 1 + main_~a~0#1; {7791#(<= |ULTIMATE.start_main_~a~0#1| 39)} is VALID [2022-02-20 14:07:38,101 INFO L290 TraceCheckUtils]: 119: Hoare triple {7791#(<= |ULTIMATE.start_main_~a~0#1| 39)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7791#(<= |ULTIMATE.start_main_~a~0#1| 39)} is VALID [2022-02-20 14:07:38,102 INFO L290 TraceCheckUtils]: 120: Hoare triple {7791#(<= |ULTIMATE.start_main_~a~0#1| 39)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {7791#(<= |ULTIMATE.start_main_~a~0#1| 39)} is VALID [2022-02-20 14:07:38,102 INFO L290 TraceCheckUtils]: 121: Hoare triple {7791#(<= |ULTIMATE.start_main_~a~0#1| 39)} main_~a~0#1 := 1 + main_~a~0#1; {7792#(<= |ULTIMATE.start_main_~a~0#1| 40)} is VALID [2022-02-20 14:07:38,102 INFO L290 TraceCheckUtils]: 122: Hoare triple {7792#(<= |ULTIMATE.start_main_~a~0#1| 40)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7792#(<= |ULTIMATE.start_main_~a~0#1| 40)} is VALID [2022-02-20 14:07:38,103 INFO L290 TraceCheckUtils]: 123: Hoare triple {7792#(<= |ULTIMATE.start_main_~a~0#1| 40)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {7792#(<= |ULTIMATE.start_main_~a~0#1| 40)} is VALID [2022-02-20 14:07:38,103 INFO L290 TraceCheckUtils]: 124: Hoare triple {7792#(<= |ULTIMATE.start_main_~a~0#1| 40)} main_~a~0#1 := 1 + main_~a~0#1; {7793#(<= |ULTIMATE.start_main_~a~0#1| 41)} is VALID [2022-02-20 14:07:38,103 INFO L290 TraceCheckUtils]: 125: Hoare triple {7793#(<= |ULTIMATE.start_main_~a~0#1| 41)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7793#(<= |ULTIMATE.start_main_~a~0#1| 41)} is VALID [2022-02-20 14:07:38,104 INFO L290 TraceCheckUtils]: 126: Hoare triple {7793#(<= |ULTIMATE.start_main_~a~0#1| 41)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {7793#(<= |ULTIMATE.start_main_~a~0#1| 41)} is VALID [2022-02-20 14:07:38,104 INFO L290 TraceCheckUtils]: 127: Hoare triple {7793#(<= |ULTIMATE.start_main_~a~0#1| 41)} main_~a~0#1 := 1 + main_~a~0#1; {7794#(<= |ULTIMATE.start_main_~a~0#1| 42)} is VALID [2022-02-20 14:07:38,104 INFO L290 TraceCheckUtils]: 128: Hoare triple {7794#(<= |ULTIMATE.start_main_~a~0#1| 42)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7794#(<= |ULTIMATE.start_main_~a~0#1| 42)} is VALID [2022-02-20 14:07:38,105 INFO L290 TraceCheckUtils]: 129: Hoare triple {7794#(<= |ULTIMATE.start_main_~a~0#1| 42)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {7794#(<= |ULTIMATE.start_main_~a~0#1| 42)} is VALID [2022-02-20 14:07:38,105 INFO L290 TraceCheckUtils]: 130: Hoare triple {7794#(<= |ULTIMATE.start_main_~a~0#1| 42)} main_~a~0#1 := 1 + main_~a~0#1; {7795#(<= |ULTIMATE.start_main_~a~0#1| 43)} is VALID [2022-02-20 14:07:38,105 INFO L290 TraceCheckUtils]: 131: Hoare triple {7795#(<= |ULTIMATE.start_main_~a~0#1| 43)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7795#(<= |ULTIMATE.start_main_~a~0#1| 43)} is VALID [2022-02-20 14:07:38,106 INFO L290 TraceCheckUtils]: 132: Hoare triple {7795#(<= |ULTIMATE.start_main_~a~0#1| 43)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {7795#(<= |ULTIMATE.start_main_~a~0#1| 43)} is VALID [2022-02-20 14:07:38,106 INFO L290 TraceCheckUtils]: 133: Hoare triple {7795#(<= |ULTIMATE.start_main_~a~0#1| 43)} main_~a~0#1 := 1 + main_~a~0#1; {7796#(<= |ULTIMATE.start_main_~a~0#1| 44)} is VALID [2022-02-20 14:07:38,106 INFO L290 TraceCheckUtils]: 134: Hoare triple {7796#(<= |ULTIMATE.start_main_~a~0#1| 44)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7796#(<= |ULTIMATE.start_main_~a~0#1| 44)} is VALID [2022-02-20 14:07:38,107 INFO L290 TraceCheckUtils]: 135: Hoare triple {7796#(<= |ULTIMATE.start_main_~a~0#1| 44)} assume !(main_#t~mem2#1 >= 0);havoc main_#t~mem2#1; {7796#(<= |ULTIMATE.start_main_~a~0#1| 44)} is VALID [2022-02-20 14:07:38,107 INFO L290 TraceCheckUtils]: 136: Hoare triple {7796#(<= |ULTIMATE.start_main_~a~0#1| 44)} main_~a~0#1 := 1 + main_~a~0#1; {7797#(<= |ULTIMATE.start_main_~a~0#1| 45)} is VALID [2022-02-20 14:07:38,107 INFO L290 TraceCheckUtils]: 137: Hoare triple {7797#(<= |ULTIMATE.start_main_~a~0#1| 45)} assume !!(main_~a~0#1 < 100000);assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;call write~int(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7797#(<= |ULTIMATE.start_main_~a~0#1| 45)} is VALID [2022-02-20 14:07:38,107 INFO L290 TraceCheckUtils]: 138: Hoare triple {7797#(<= |ULTIMATE.start_main_~a~0#1| 45)} assume main_#t~mem2#1 >= 0;havoc main_#t~mem2#1;call main_#t~mem3#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem3#1, main_~#bb~0#1.base, main_~#bb~0#1.offset + 4 * main_~b~0#1, 4);havoc main_#t~mem3#1;main_~b~0#1 := 1 + main_~b~0#1; {7797#(<= |ULTIMATE.start_main_~a~0#1| 45)} is VALID [2022-02-20 14:07:38,108 INFO L290 TraceCheckUtils]: 139: Hoare triple {7797#(<= |ULTIMATE.start_main_~a~0#1| 45)} main_~a~0#1 := 1 + main_~a~0#1; {7798#(<= |ULTIMATE.start_main_~a~0#1| 46)} is VALID [2022-02-20 14:07:38,108 INFO L290 TraceCheckUtils]: 140: Hoare triple {7798#(<= |ULTIMATE.start_main_~a~0#1| 46)} assume !(main_~a~0#1 < 100000); {7751#false} is VALID [2022-02-20 14:07:38,108 INFO L290 TraceCheckUtils]: 141: Hoare triple {7751#false} main_~a~0#1 := 0; {7751#false} is VALID [2022-02-20 14:07:38,108 INFO L290 TraceCheckUtils]: 142: Hoare triple {7751#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7751#false} is VALID [2022-02-20 14:07:38,108 INFO L290 TraceCheckUtils]: 143: Hoare triple {7751#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {7751#false} is VALID [2022-02-20 14:07:38,109 INFO L290 TraceCheckUtils]: 144: Hoare triple {7751#false} main_~a~0#1 := 1 + main_~a~0#1; {7751#false} is VALID [2022-02-20 14:07:38,109 INFO L290 TraceCheckUtils]: 145: Hoare triple {7751#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7751#false} is VALID [2022-02-20 14:07:38,109 INFO L290 TraceCheckUtils]: 146: Hoare triple {7751#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {7751#false} is VALID [2022-02-20 14:07:38,109 INFO L290 TraceCheckUtils]: 147: Hoare triple {7751#false} main_~a~0#1 := 1 + main_~a~0#1; {7751#false} is VALID [2022-02-20 14:07:38,109 INFO L290 TraceCheckUtils]: 148: Hoare triple {7751#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7751#false} is VALID [2022-02-20 14:07:38,109 INFO L290 TraceCheckUtils]: 149: Hoare triple {7751#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {7751#false} is VALID [2022-02-20 14:07:38,109 INFO L290 TraceCheckUtils]: 150: Hoare triple {7751#false} main_~a~0#1 := 1 + main_~a~0#1; {7751#false} is VALID [2022-02-20 14:07:38,109 INFO L290 TraceCheckUtils]: 151: Hoare triple {7751#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7751#false} is VALID [2022-02-20 14:07:38,110 INFO L290 TraceCheckUtils]: 152: Hoare triple {7751#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {7751#false} is VALID [2022-02-20 14:07:38,110 INFO L290 TraceCheckUtils]: 153: Hoare triple {7751#false} main_~a~0#1 := 1 + main_~a~0#1; {7751#false} is VALID [2022-02-20 14:07:38,110 INFO L290 TraceCheckUtils]: 154: Hoare triple {7751#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7751#false} is VALID [2022-02-20 14:07:38,110 INFO L290 TraceCheckUtils]: 155: Hoare triple {7751#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {7751#false} is VALID [2022-02-20 14:07:38,110 INFO L290 TraceCheckUtils]: 156: Hoare triple {7751#false} main_~a~0#1 := 1 + main_~a~0#1; {7751#false} is VALID [2022-02-20 14:07:38,110 INFO L290 TraceCheckUtils]: 157: Hoare triple {7751#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7751#false} is VALID [2022-02-20 14:07:38,111 INFO L290 TraceCheckUtils]: 158: Hoare triple {7751#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {7751#false} is VALID [2022-02-20 14:07:38,111 INFO L290 TraceCheckUtils]: 159: Hoare triple {7751#false} main_~a~0#1 := 1 + main_~a~0#1; {7751#false} is VALID [2022-02-20 14:07:38,111 INFO L290 TraceCheckUtils]: 160: Hoare triple {7751#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7751#false} is VALID [2022-02-20 14:07:38,111 INFO L290 TraceCheckUtils]: 161: Hoare triple {7751#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {7751#false} is VALID [2022-02-20 14:07:38,111 INFO L290 TraceCheckUtils]: 162: Hoare triple {7751#false} main_~a~0#1 := 1 + main_~a~0#1; {7751#false} is VALID [2022-02-20 14:07:38,111 INFO L290 TraceCheckUtils]: 163: Hoare triple {7751#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7751#false} is VALID [2022-02-20 14:07:38,111 INFO L290 TraceCheckUtils]: 164: Hoare triple {7751#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {7751#false} is VALID [2022-02-20 14:07:38,112 INFO L290 TraceCheckUtils]: 165: Hoare triple {7751#false} main_~a~0#1 := 1 + main_~a~0#1; {7751#false} is VALID [2022-02-20 14:07:38,112 INFO L290 TraceCheckUtils]: 166: Hoare triple {7751#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7751#false} is VALID [2022-02-20 14:07:38,112 INFO L290 TraceCheckUtils]: 167: Hoare triple {7751#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {7751#false} is VALID [2022-02-20 14:07:38,112 INFO L290 TraceCheckUtils]: 168: Hoare triple {7751#false} main_~a~0#1 := 1 + main_~a~0#1; {7751#false} is VALID [2022-02-20 14:07:38,113 INFO L290 TraceCheckUtils]: 169: Hoare triple {7751#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7751#false} is VALID [2022-02-20 14:07:38,113 INFO L290 TraceCheckUtils]: 170: Hoare triple {7751#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {7751#false} is VALID [2022-02-20 14:07:38,113 INFO L290 TraceCheckUtils]: 171: Hoare triple {7751#false} main_~a~0#1 := 1 + main_~a~0#1; {7751#false} is VALID [2022-02-20 14:07:38,113 INFO L290 TraceCheckUtils]: 172: Hoare triple {7751#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7751#false} is VALID [2022-02-20 14:07:38,113 INFO L290 TraceCheckUtils]: 173: Hoare triple {7751#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {7751#false} is VALID [2022-02-20 14:07:38,113 INFO L290 TraceCheckUtils]: 174: Hoare triple {7751#false} main_~a~0#1 := 1 + main_~a~0#1; {7751#false} is VALID [2022-02-20 14:07:38,114 INFO L290 TraceCheckUtils]: 175: Hoare triple {7751#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7751#false} is VALID [2022-02-20 14:07:38,114 INFO L290 TraceCheckUtils]: 176: Hoare triple {7751#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {7751#false} is VALID [2022-02-20 14:07:38,114 INFO L290 TraceCheckUtils]: 177: Hoare triple {7751#false} main_~a~0#1 := 1 + main_~a~0#1; {7751#false} is VALID [2022-02-20 14:07:38,114 INFO L290 TraceCheckUtils]: 178: Hoare triple {7751#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7751#false} is VALID [2022-02-20 14:07:38,114 INFO L290 TraceCheckUtils]: 179: Hoare triple {7751#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {7751#false} is VALID [2022-02-20 14:07:38,114 INFO L290 TraceCheckUtils]: 180: Hoare triple {7751#false} main_~a~0#1 := 1 + main_~a~0#1; {7751#false} is VALID [2022-02-20 14:07:38,114 INFO L290 TraceCheckUtils]: 181: Hoare triple {7751#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7751#false} is VALID [2022-02-20 14:07:38,115 INFO L290 TraceCheckUtils]: 182: Hoare triple {7751#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {7751#false} is VALID [2022-02-20 14:07:38,115 INFO L290 TraceCheckUtils]: 183: Hoare triple {7751#false} main_~a~0#1 := 1 + main_~a~0#1; {7751#false} is VALID [2022-02-20 14:07:38,115 INFO L290 TraceCheckUtils]: 184: Hoare triple {7751#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7751#false} is VALID [2022-02-20 14:07:38,115 INFO L290 TraceCheckUtils]: 185: Hoare triple {7751#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {7751#false} is VALID [2022-02-20 14:07:38,115 INFO L290 TraceCheckUtils]: 186: Hoare triple {7751#false} main_~a~0#1 := 1 + main_~a~0#1; {7751#false} is VALID [2022-02-20 14:07:38,115 INFO L290 TraceCheckUtils]: 187: Hoare triple {7751#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7751#false} is VALID [2022-02-20 14:07:38,116 INFO L290 TraceCheckUtils]: 188: Hoare triple {7751#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {7751#false} is VALID [2022-02-20 14:07:38,116 INFO L290 TraceCheckUtils]: 189: Hoare triple {7751#false} main_~a~0#1 := 1 + main_~a~0#1; {7751#false} is VALID [2022-02-20 14:07:38,116 INFO L290 TraceCheckUtils]: 190: Hoare triple {7751#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7751#false} is VALID [2022-02-20 14:07:38,116 INFO L290 TraceCheckUtils]: 191: Hoare triple {7751#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {7751#false} is VALID [2022-02-20 14:07:38,116 INFO L290 TraceCheckUtils]: 192: Hoare triple {7751#false} main_~a~0#1 := 1 + main_~a~0#1; {7751#false} is VALID [2022-02-20 14:07:38,116 INFO L290 TraceCheckUtils]: 193: Hoare triple {7751#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7751#false} is VALID [2022-02-20 14:07:38,116 INFO L290 TraceCheckUtils]: 194: Hoare triple {7751#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {7751#false} is VALID [2022-02-20 14:07:38,117 INFO L290 TraceCheckUtils]: 195: Hoare triple {7751#false} main_~a~0#1 := 1 + main_~a~0#1; {7751#false} is VALID [2022-02-20 14:07:38,117 INFO L290 TraceCheckUtils]: 196: Hoare triple {7751#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7751#false} is VALID [2022-02-20 14:07:38,117 INFO L290 TraceCheckUtils]: 197: Hoare triple {7751#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {7751#false} is VALID [2022-02-20 14:07:38,117 INFO L290 TraceCheckUtils]: 198: Hoare triple {7751#false} main_~a~0#1 := 1 + main_~a~0#1; {7751#false} is VALID [2022-02-20 14:07:38,117 INFO L290 TraceCheckUtils]: 199: Hoare triple {7751#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7751#false} is VALID [2022-02-20 14:07:38,117 INFO L290 TraceCheckUtils]: 200: Hoare triple {7751#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {7751#false} is VALID [2022-02-20 14:07:38,117 INFO L290 TraceCheckUtils]: 201: Hoare triple {7751#false} main_~a~0#1 := 1 + main_~a~0#1; {7751#false} is VALID [2022-02-20 14:07:38,118 INFO L290 TraceCheckUtils]: 202: Hoare triple {7751#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7751#false} is VALID [2022-02-20 14:07:38,118 INFO L290 TraceCheckUtils]: 203: Hoare triple {7751#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {7751#false} is VALID [2022-02-20 14:07:38,118 INFO L290 TraceCheckUtils]: 204: Hoare triple {7751#false} main_~a~0#1 := 1 + main_~a~0#1; {7751#false} is VALID [2022-02-20 14:07:38,118 INFO L290 TraceCheckUtils]: 205: Hoare triple {7751#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7751#false} is VALID [2022-02-20 14:07:38,118 INFO L290 TraceCheckUtils]: 206: Hoare triple {7751#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {7751#false} is VALID [2022-02-20 14:07:38,118 INFO L290 TraceCheckUtils]: 207: Hoare triple {7751#false} main_~a~0#1 := 1 + main_~a~0#1; {7751#false} is VALID [2022-02-20 14:07:38,118 INFO L290 TraceCheckUtils]: 208: Hoare triple {7751#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7751#false} is VALID [2022-02-20 14:07:38,119 INFO L290 TraceCheckUtils]: 209: Hoare triple {7751#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {7751#false} is VALID [2022-02-20 14:07:38,119 INFO L290 TraceCheckUtils]: 210: Hoare triple {7751#false} main_~a~0#1 := 1 + main_~a~0#1; {7751#false} is VALID [2022-02-20 14:07:38,119 INFO L290 TraceCheckUtils]: 211: Hoare triple {7751#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7751#false} is VALID [2022-02-20 14:07:38,119 INFO L290 TraceCheckUtils]: 212: Hoare triple {7751#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {7751#false} is VALID [2022-02-20 14:07:38,119 INFO L290 TraceCheckUtils]: 213: Hoare triple {7751#false} main_~a~0#1 := 1 + main_~a~0#1; {7751#false} is VALID [2022-02-20 14:07:38,119 INFO L290 TraceCheckUtils]: 214: Hoare triple {7751#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7751#false} is VALID [2022-02-20 14:07:38,120 INFO L290 TraceCheckUtils]: 215: Hoare triple {7751#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {7751#false} is VALID [2022-02-20 14:07:38,120 INFO L290 TraceCheckUtils]: 216: Hoare triple {7751#false} main_~a~0#1 := 1 + main_~a~0#1; {7751#false} is VALID [2022-02-20 14:07:38,120 INFO L290 TraceCheckUtils]: 217: Hoare triple {7751#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7751#false} is VALID [2022-02-20 14:07:38,120 INFO L290 TraceCheckUtils]: 218: Hoare triple {7751#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {7751#false} is VALID [2022-02-20 14:07:38,120 INFO L290 TraceCheckUtils]: 219: Hoare triple {7751#false} main_~a~0#1 := 1 + main_~a~0#1; {7751#false} is VALID [2022-02-20 14:07:38,120 INFO L290 TraceCheckUtils]: 220: Hoare triple {7751#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7751#false} is VALID [2022-02-20 14:07:38,120 INFO L290 TraceCheckUtils]: 221: Hoare triple {7751#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {7751#false} is VALID [2022-02-20 14:07:38,121 INFO L290 TraceCheckUtils]: 222: Hoare triple {7751#false} main_~a~0#1 := 1 + main_~a~0#1; {7751#false} is VALID [2022-02-20 14:07:38,121 INFO L290 TraceCheckUtils]: 223: Hoare triple {7751#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7751#false} is VALID [2022-02-20 14:07:38,121 INFO L290 TraceCheckUtils]: 224: Hoare triple {7751#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {7751#false} is VALID [2022-02-20 14:07:38,121 INFO L290 TraceCheckUtils]: 225: Hoare triple {7751#false} main_~a~0#1 := 1 + main_~a~0#1; {7751#false} is VALID [2022-02-20 14:07:38,121 INFO L290 TraceCheckUtils]: 226: Hoare triple {7751#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7751#false} is VALID [2022-02-20 14:07:38,121 INFO L290 TraceCheckUtils]: 227: Hoare triple {7751#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {7751#false} is VALID [2022-02-20 14:07:38,121 INFO L290 TraceCheckUtils]: 228: Hoare triple {7751#false} main_~a~0#1 := 1 + main_~a~0#1; {7751#false} is VALID [2022-02-20 14:07:38,122 INFO L290 TraceCheckUtils]: 229: Hoare triple {7751#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7751#false} is VALID [2022-02-20 14:07:38,122 INFO L290 TraceCheckUtils]: 230: Hoare triple {7751#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {7751#false} is VALID [2022-02-20 14:07:38,122 INFO L290 TraceCheckUtils]: 231: Hoare triple {7751#false} main_~a~0#1 := 1 + main_~a~0#1; {7751#false} is VALID [2022-02-20 14:07:38,122 INFO L290 TraceCheckUtils]: 232: Hoare triple {7751#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7751#false} is VALID [2022-02-20 14:07:38,122 INFO L290 TraceCheckUtils]: 233: Hoare triple {7751#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {7751#false} is VALID [2022-02-20 14:07:38,122 INFO L290 TraceCheckUtils]: 234: Hoare triple {7751#false} main_~a~0#1 := 1 + main_~a~0#1; {7751#false} is VALID [2022-02-20 14:07:38,123 INFO L290 TraceCheckUtils]: 235: Hoare triple {7751#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7751#false} is VALID [2022-02-20 14:07:38,123 INFO L290 TraceCheckUtils]: 236: Hoare triple {7751#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {7751#false} is VALID [2022-02-20 14:07:38,123 INFO L290 TraceCheckUtils]: 237: Hoare triple {7751#false} main_~a~0#1 := 1 + main_~a~0#1; {7751#false} is VALID [2022-02-20 14:07:38,123 INFO L290 TraceCheckUtils]: 238: Hoare triple {7751#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7751#false} is VALID [2022-02-20 14:07:38,123 INFO L290 TraceCheckUtils]: 239: Hoare triple {7751#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {7751#false} is VALID [2022-02-20 14:07:38,123 INFO L290 TraceCheckUtils]: 240: Hoare triple {7751#false} main_~a~0#1 := 1 + main_~a~0#1; {7751#false} is VALID [2022-02-20 14:07:38,123 INFO L290 TraceCheckUtils]: 241: Hoare triple {7751#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7751#false} is VALID [2022-02-20 14:07:38,124 INFO L290 TraceCheckUtils]: 242: Hoare triple {7751#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {7751#false} is VALID [2022-02-20 14:07:38,124 INFO L290 TraceCheckUtils]: 243: Hoare triple {7751#false} main_~a~0#1 := 1 + main_~a~0#1; {7751#false} is VALID [2022-02-20 14:07:38,124 INFO L290 TraceCheckUtils]: 244: Hoare triple {7751#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7751#false} is VALID [2022-02-20 14:07:38,124 INFO L290 TraceCheckUtils]: 245: Hoare triple {7751#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {7751#false} is VALID [2022-02-20 14:07:38,124 INFO L290 TraceCheckUtils]: 246: Hoare triple {7751#false} main_~a~0#1 := 1 + main_~a~0#1; {7751#false} is VALID [2022-02-20 14:07:38,124 INFO L290 TraceCheckUtils]: 247: Hoare triple {7751#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7751#false} is VALID [2022-02-20 14:07:38,124 INFO L290 TraceCheckUtils]: 248: Hoare triple {7751#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {7751#false} is VALID [2022-02-20 14:07:38,125 INFO L290 TraceCheckUtils]: 249: Hoare triple {7751#false} main_~a~0#1 := 1 + main_~a~0#1; {7751#false} is VALID [2022-02-20 14:07:38,125 INFO L290 TraceCheckUtils]: 250: Hoare triple {7751#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7751#false} is VALID [2022-02-20 14:07:38,125 INFO L290 TraceCheckUtils]: 251: Hoare triple {7751#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {7751#false} is VALID [2022-02-20 14:07:38,125 INFO L290 TraceCheckUtils]: 252: Hoare triple {7751#false} main_~a~0#1 := 1 + main_~a~0#1; {7751#false} is VALID [2022-02-20 14:07:38,125 INFO L290 TraceCheckUtils]: 253: Hoare triple {7751#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7751#false} is VALID [2022-02-20 14:07:38,125 INFO L290 TraceCheckUtils]: 254: Hoare triple {7751#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {7751#false} is VALID [2022-02-20 14:07:38,126 INFO L290 TraceCheckUtils]: 255: Hoare triple {7751#false} main_~a~0#1 := 1 + main_~a~0#1; {7751#false} is VALID [2022-02-20 14:07:38,126 INFO L290 TraceCheckUtils]: 256: Hoare triple {7751#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7751#false} is VALID [2022-02-20 14:07:38,126 INFO L290 TraceCheckUtils]: 257: Hoare triple {7751#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {7751#false} is VALID [2022-02-20 14:07:38,126 INFO L290 TraceCheckUtils]: 258: Hoare triple {7751#false} main_~a~0#1 := 1 + main_~a~0#1; {7751#false} is VALID [2022-02-20 14:07:38,126 INFO L290 TraceCheckUtils]: 259: Hoare triple {7751#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7751#false} is VALID [2022-02-20 14:07:38,126 INFO L290 TraceCheckUtils]: 260: Hoare triple {7751#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {7751#false} is VALID [2022-02-20 14:07:38,126 INFO L290 TraceCheckUtils]: 261: Hoare triple {7751#false} main_~a~0#1 := 1 + main_~a~0#1; {7751#false} is VALID [2022-02-20 14:07:38,127 INFO L290 TraceCheckUtils]: 262: Hoare triple {7751#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7751#false} is VALID [2022-02-20 14:07:38,127 INFO L290 TraceCheckUtils]: 263: Hoare triple {7751#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {7751#false} is VALID [2022-02-20 14:07:38,127 INFO L290 TraceCheckUtils]: 264: Hoare triple {7751#false} main_~a~0#1 := 1 + main_~a~0#1; {7751#false} is VALID [2022-02-20 14:07:38,127 INFO L290 TraceCheckUtils]: 265: Hoare triple {7751#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7751#false} is VALID [2022-02-20 14:07:38,127 INFO L290 TraceCheckUtils]: 266: Hoare triple {7751#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {7751#false} is VALID [2022-02-20 14:07:38,127 INFO L290 TraceCheckUtils]: 267: Hoare triple {7751#false} main_~a~0#1 := 1 + main_~a~0#1; {7751#false} is VALID [2022-02-20 14:07:38,127 INFO L290 TraceCheckUtils]: 268: Hoare triple {7751#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7751#false} is VALID [2022-02-20 14:07:38,128 INFO L290 TraceCheckUtils]: 269: Hoare triple {7751#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {7751#false} is VALID [2022-02-20 14:07:38,128 INFO L290 TraceCheckUtils]: 270: Hoare triple {7751#false} main_~a~0#1 := 1 + main_~a~0#1; {7751#false} is VALID [2022-02-20 14:07:38,128 INFO L290 TraceCheckUtils]: 271: Hoare triple {7751#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7751#false} is VALID [2022-02-20 14:07:38,128 INFO L290 TraceCheckUtils]: 272: Hoare triple {7751#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {7751#false} is VALID [2022-02-20 14:07:38,128 INFO L290 TraceCheckUtils]: 273: Hoare triple {7751#false} main_~a~0#1 := 1 + main_~a~0#1; {7751#false} is VALID [2022-02-20 14:07:38,128 INFO L290 TraceCheckUtils]: 274: Hoare triple {7751#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7751#false} is VALID [2022-02-20 14:07:38,129 INFO L290 TraceCheckUtils]: 275: Hoare triple {7751#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {7751#false} is VALID [2022-02-20 14:07:38,129 INFO L290 TraceCheckUtils]: 276: Hoare triple {7751#false} main_~a~0#1 := 1 + main_~a~0#1; {7751#false} is VALID [2022-02-20 14:07:38,129 INFO L290 TraceCheckUtils]: 277: Hoare triple {7751#false} assume !!(main_~a~0#1 < 100000);call main_#t~mem4#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); {7751#false} is VALID [2022-02-20 14:07:38,129 INFO L290 TraceCheckUtils]: 278: Hoare triple {7751#false} assume main_#t~mem4#1 >= 0;havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);call write~int(main_#t~mem5#1, main_~#cc~0#1.base, main_~#cc~0#1.offset + 4 * main_~c~0#1, 4);havoc main_#t~mem5#1;main_~c~0#1 := 1 + main_~c~0#1; {7751#false} is VALID [2022-02-20 14:07:38,129 INFO L290 TraceCheckUtils]: 279: Hoare triple {7751#false} main_~a~0#1 := 1 + main_~a~0#1; {7751#false} is VALID [2022-02-20 14:07:38,129 INFO L290 TraceCheckUtils]: 280: Hoare triple {7751#false} assume !(main_~a~0#1 < 100000); {7751#false} is VALID [2022-02-20 14:07:38,129 INFO L290 TraceCheckUtils]: 281: Hoare triple {7751#false} havoc main_~x~0#1;main_~x~0#1 := 0; {7751#false} is VALID [2022-02-20 14:07:38,130 INFO L290 TraceCheckUtils]: 282: Hoare triple {7751#false} assume !!(main_~x~0#1 < main_~b~0#1);call main_#t~mem7#1 := read~int(main_~#bb~0#1.base, main_~#bb~0#1.offset + 4 * main_~x~0#1, 4); {7751#false} is VALID [2022-02-20 14:07:38,130 INFO L272 TraceCheckUtils]: 283: Hoare triple {7751#false} call __VERIFIER_assert((if main_#t~mem7#1 >= 0 then 1 else 0)); {7751#false} is VALID [2022-02-20 14:07:38,130 INFO L290 TraceCheckUtils]: 284: Hoare triple {7751#false} ~cond := #in~cond; {7751#false} is VALID [2022-02-20 14:07:38,130 INFO L290 TraceCheckUtils]: 285: Hoare triple {7751#false} assume 0 == ~cond; {7751#false} is VALID [2022-02-20 14:07:38,130 INFO L290 TraceCheckUtils]: 286: Hoare triple {7751#false} assume !false; {7751#false} is VALID [2022-02-20 14:07:38,133 INFO L134 CoverageAnalysis]: Checked inductivity of 6302 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 3151 trivial. 0 not checked. [2022-02-20 14:07:38,133 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:07:38,133 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878012976] [2022-02-20 14:07:38,133 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878012976] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:07:38,133 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043911712] [2022-02-20 14:07:38,134 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 14:07:38,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:07:38,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:07:38,151 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:07:38,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process