./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ef4a52e45666a829b602608a46cff9c8137910dd58bdfaebe016ce17984d1ac8 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:49:27,603 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:49:27,605 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:49:27,623 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:49:27,623 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:49:27,624 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:49:27,625 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:49:27,626 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:49:27,628 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:49:27,628 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:49:27,629 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:49:27,630 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:49:27,630 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:49:27,631 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:49:27,632 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:49:27,632 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:49:27,633 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:49:27,634 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:49:27,635 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:49:27,636 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:49:27,637 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:49:27,638 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:49:27,639 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:49:27,639 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:49:27,641 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:49:27,641 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:49:27,641 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:49:27,642 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:49:27,642 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:49:27,643 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:49:27,643 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:49:27,644 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:49:27,644 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:49:27,645 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:49:27,645 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:49:27,646 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:49:27,646 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:49:27,646 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:49:27,646 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:49:27,647 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:49:27,647 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:49:27,648 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-02-20 23:49:27,662 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:49:27,662 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:49:27,662 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:49:27,663 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:49:27,663 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:49:27,663 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:49:27,664 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:49:27,664 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:49:27,664 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:49:27,664 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:49:27,665 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:49:27,665 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:49:27,665 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:49:27,665 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:49:27,665 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:49:27,665 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:49:27,666 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:49:27,666 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:49:27,666 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:49:27,666 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:49:27,666 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:49:27,667 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:49:27,667 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:49:27,667 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:49:27,667 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:49:27,667 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:49:27,668 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:49:27,668 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:49:27,668 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:49:27,668 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:49:27,668 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> ef4a52e45666a829b602608a46cff9c8137910dd58bdfaebe016ce17984d1ac8 [2022-02-20 23:49:27,835 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:49:27,861 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:49:27,864 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:49:27,865 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:49:27,866 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:49:27,867 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration.c [2022-02-20 23:49:27,931 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd5bcd0f0/a6bf116e8f494799bce4b80163a63d09/FLAGa76f4d78b [2022-02-20 23:49:28,246 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:49:28,247 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration.c [2022-02-20 23:49:28,254 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd5bcd0f0/a6bf116e8f494799bce4b80163a63d09/FLAGa76f4d78b [2022-02-20 23:49:28,682 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd5bcd0f0/a6bf116e8f494799bce4b80163a63d09 [2022-02-20 23:49:28,684 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:49:28,685 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:49:28,686 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:49:28,686 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:49:28,688 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:49:28,689 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:49:28" (1/1) ... [2022-02-20 23:49:28,690 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@394cd16c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:28, skipping insertion in model container [2022-02-20 23:49:28,690 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:49:28" (1/1) ... [2022-02-20 23:49:28,694 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:49:28,701 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:49:28,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:49:28,817 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:49:28,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:49:28,841 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:49:28,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:28 WrapperNode [2022-02-20 23:49:28,842 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:49:28,842 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:49:28,842 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:49:28,843 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:49:28,850 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:28" (1/1) ... [2022-02-20 23:49:28,854 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:28" (1/1) ... [2022-02-20 23:49:28,871 INFO L137 Inliner]: procedures = 8, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 67 [2022-02-20 23:49:28,872 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:49:28,876 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:49:28,876 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:49:28,876 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:49:28,881 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:28" (1/1) ... [2022-02-20 23:49:28,881 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:28" (1/1) ... [2022-02-20 23:49:28,882 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:28" (1/1) ... [2022-02-20 23:49:28,883 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:28" (1/1) ... [2022-02-20 23:49:28,887 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:28" (1/1) ... [2022-02-20 23:49:28,890 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:28" (1/1) ... [2022-02-20 23:49:28,890 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:28" (1/1) ... [2022-02-20 23:49:28,891 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:49:28,892 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:49:28,892 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:49:28,892 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:49:28,893 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:28" (1/1) ... [2022-02-20 23:49:28,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:49:28,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:49:28,946 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 23:49:28,951 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 23:49:28,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 23:49:28,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:49:28,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:49:28,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 23:49:28,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 23:49:28,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:49:29,021 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:49:29,022 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:49:29,195 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:49:29,200 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:49:29,200 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 23:49:29,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:49:29 BoogieIcfgContainer [2022-02-20 23:49:29,201 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:49:29,202 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:49:29,203 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:49:29,205 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:49:29,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:49:28" (1/3) ... [2022-02-20 23:49:29,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cd1837c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:49:29, skipping insertion in model container [2022-02-20 23:49:29,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:28" (2/3) ... [2022-02-20 23:49:29,206 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cd1837c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:49:29, skipping insertion in model container [2022-02-20 23:49:29,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:49:29" (3/3) ... [2022-02-20 23:49:29,207 INFO L111 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration.c [2022-02-20 23:49:29,210 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:49:29,210 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-02-20 23:49:29,239 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:49:29,243 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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 23:49:29,244 INFO L340 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-02-20 23:49:29,254 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 30 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:29,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:49:29,258 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:29,258 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:49:29,258 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2022-02-20 23:49:29,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:29,262 INFO L85 PathProgramCache]: Analyzing trace with hash 28698920, now seen corresponding path program 1 times [2022-02-20 23:49:29,268 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:29,269 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678569833] [2022-02-20 23:49:29,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:29,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:29,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:29,415 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {34#true} is VALID [2022-02-20 23:49:29,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(128);call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; {34#true} is VALID [2022-02-20 23:49:29,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {36#(= |ULTIMATE.start_foo_~i~0#1| 0)} is VALID [2022-02-20 23:49:29,417 INFO L290 TraceCheckUtils]: 3: Hoare triple {36#(= |ULTIMATE.start_foo_~i~0#1| 0)} assume !!(foo_~i~0#1 <= foo_~size#1); {36#(= |ULTIMATE.start_foo_~i~0#1| 0)} is VALID [2022-02-20 23:49:29,418 INFO L290 TraceCheckUtils]: 4: Hoare triple {36#(= |ULTIMATE.start_foo_~i~0#1| 0)} assume !(0 <= foo_~i~0#1 && foo_~i~0#1 < 32); {35#false} is VALID [2022-02-20 23:49:29,419 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 23:49:29,419 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:49:29,419 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678569833] [2022-02-20 23:49:29,420 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678569833] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:49:29,420 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:49:29,421 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:49:29,422 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836736474] [2022-02-20 23:49:29,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:49:29,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 23:49:29,426 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:29,428 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:29,435 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:29,436 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:49:29,436 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:29,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:49:29,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:49:29,452 INFO L87 Difference]: Start difference. First operand has 31 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 30 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:29,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:29,541 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2022-02-20 23:49:29,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:49:29,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 23:49:29,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:29,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:29,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-02-20 23:49:29,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:29,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-02-20 23:49:29,556 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 72 transitions. [2022-02-20 23:49:29,620 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:29,632 INFO L225 Difference]: With dead ends: 59 [2022-02-20 23:49:29,632 INFO L226 Difference]: Without dead ends: 55 [2022-02-20 23:49:29,643 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 23:49:29,646 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 28 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:29,649 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 66 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:49:29,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-02-20 23:49:29,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 31. [2022-02-20 23:49:29,666 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:29,667 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 31 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 30 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:29,667 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 31 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 30 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:29,668 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 31 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 30 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:29,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:29,670 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2022-02-20 23:49:29,670 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-02-20 23:49:29,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:29,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:29,671 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 30 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 55 states. [2022-02-20 23:49:29,672 INFO L87 Difference]: Start difference. First operand has 31 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 30 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 55 states. [2022-02-20 23:49:29,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:29,674 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2022-02-20 23:49:29,674 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-02-20 23:49:29,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:29,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:29,675 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:29,675 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:29,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 30 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:29,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2022-02-20 23:49:29,677 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 5 [2022-02-20 23:49:29,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:29,678 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2022-02-20 23:49:29,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:29,678 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2022-02-20 23:49:29,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:49:29,678 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:29,679 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:49:29,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:49:29,679 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2022-02-20 23:49:29,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:29,680 INFO L85 PathProgramCache]: Analyzing trace with hash 889631015, now seen corresponding path program 1 times [2022-02-20 23:49:29,680 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:29,680 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466159219] [2022-02-20 23:49:29,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:29,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:29,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:29,710 INFO L290 TraceCheckUtils]: 0: Hoare triple {239#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {239#true} is VALID [2022-02-20 23:49:29,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {239#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(128);call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; {241#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:29,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {241#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !(main_~i~1#1 % 4294967296 < 32); {240#false} is VALID [2022-02-20 23:49:29,712 INFO L290 TraceCheckUtils]: 3: Hoare triple {240#false} main_~i~1#1 := 0; {240#false} is VALID [2022-02-20 23:49:29,712 INFO L290 TraceCheckUtils]: 4: Hoare triple {240#false} assume !!(main_~i~1#1 % 4294967296 < 32); {240#false} is VALID [2022-02-20 23:49:29,712 INFO L290 TraceCheckUtils]: 5: Hoare triple {240#false} assume !(1 == #valid[main_~#b~0#1.base]); {240#false} is VALID [2022-02-20 23:49:29,712 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 23:49:29,712 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:49:29,713 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466159219] [2022-02-20 23:49:29,713 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466159219] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:49:29,713 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:49:29,713 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:49:29,713 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902335157] [2022-02-20 23:49:29,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:49:29,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:49:29,715 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:29,715 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:29,720 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:29,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:49:29,720 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:29,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:49:29,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:49:29,721 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:29,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:29,785 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2022-02-20 23:49:29,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:49:29,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:49:29,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:29,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:29,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-02-20 23:49:29,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:29,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-02-20 23:49:29,789 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 60 transitions. [2022-02-20 23:49:29,832 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:29,836 INFO L225 Difference]: With dead ends: 58 [2022-02-20 23:49:29,836 INFO L226 Difference]: Without dead ends: 58 [2022-02-20 23:49:29,836 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 23:49:29,841 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 24 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:29,842 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 40 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:49:29,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-02-20 23:49:29,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 33. [2022-02-20 23:49:29,847 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:29,848 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 33 states, 25 states have (on average 1.48) internal successors, (37), 32 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:29,850 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 33 states, 25 states have (on average 1.48) internal successors, (37), 32 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:29,850 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 33 states, 25 states have (on average 1.48) internal successors, (37), 32 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:29,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:29,855 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2022-02-20 23:49:29,855 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2022-02-20 23:49:29,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:29,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:29,857 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 25 states have (on average 1.48) internal successors, (37), 32 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 58 states. [2022-02-20 23:49:29,857 INFO L87 Difference]: Start difference. First operand has 33 states, 25 states have (on average 1.48) internal successors, (37), 32 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 58 states. [2022-02-20 23:49:29,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:29,860 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2022-02-20 23:49:29,860 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2022-02-20 23:49:29,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:29,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:29,863 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:29,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:29,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.48) internal successors, (37), 32 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:29,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-02-20 23:49:29,869 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 6 [2022-02-20 23:49:29,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:29,869 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-02-20 23:49:29,869 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:29,869 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-02-20 23:49:29,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:49:29,872 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:29,872 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:49:29,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:49:29,872 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2022-02-20 23:49:29,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:29,873 INFO L85 PathProgramCache]: Analyzing trace with hash 889666573, now seen corresponding path program 1 times [2022-02-20 23:49:29,873 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:29,873 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122070657] [2022-02-20 23:49:29,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:29,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:29,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:29,926 INFO L290 TraceCheckUtils]: 0: Hoare triple {451#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {451#true} is VALID [2022-02-20 23:49:29,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {451#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(128);call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; {453#(= (select |#valid| |ULTIMATE.start_main_~#mask~0#1.base|) 1)} is VALID [2022-02-20 23:49:29,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {453#(= (select |#valid| |ULTIMATE.start_main_~#mask~0#1.base|) 1)} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {454#(= (select |#valid| |ULTIMATE.start_foo_~b#1.base|) 1)} is VALID [2022-02-20 23:49:29,932 INFO L290 TraceCheckUtils]: 3: Hoare triple {454#(= (select |#valid| |ULTIMATE.start_foo_~b#1.base|) 1)} assume !!(foo_~i~0#1 <= foo_~size#1); {454#(= (select |#valid| |ULTIMATE.start_foo_~b#1.base|) 1)} is VALID [2022-02-20 23:49:29,933 INFO L290 TraceCheckUtils]: 4: Hoare triple {454#(= (select |#valid| |ULTIMATE.start_foo_~b#1.base|) 1)} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {454#(= (select |#valid| |ULTIMATE.start_foo_~b#1.base|) 1)} is VALID [2022-02-20 23:49:29,933 INFO L290 TraceCheckUtils]: 5: Hoare triple {454#(= (select |#valid| |ULTIMATE.start_foo_~b#1.base|) 1)} assume !(1 == #valid[foo_~b#1.base]); {452#false} is VALID [2022-02-20 23:49:29,933 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 23:49:29,934 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:49:29,934 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122070657] [2022-02-20 23:49:29,934 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122070657] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:49:29,934 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:49:29,934 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:49:29,934 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943152095] [2022-02-20 23:49:29,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:49:29,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:49:29,936 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:29,936 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:29,941 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:29,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:49:29,941 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:29,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:49:29,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:49:29,943 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:30,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:30,008 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-02-20 23:49:30,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:49:30,009 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:49:30,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:30,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:30,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-02-20 23:49:30,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:30,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-02-20 23:49:30,013 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 33 transitions. [2022-02-20 23:49:30,038 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:30,040 INFO L225 Difference]: With dead ends: 32 [2022-02-20 23:49:30,040 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 23:49:30,040 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:49:30,045 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 49 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:30,046 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 22 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:49:30,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 23:49:30,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-02-20 23:49:30,050 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:30,051 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 25 states have (on average 1.44) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:30,052 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 25 states have (on average 1.44) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:30,052 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 25 states have (on average 1.44) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:30,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:30,053 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-02-20 23:49:30,053 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-02-20 23:49:30,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:30,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:30,054 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 25 states have (on average 1.44) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 32 states. [2022-02-20 23:49:30,054 INFO L87 Difference]: Start difference. First operand has 32 states, 25 states have (on average 1.44) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 32 states. [2022-02-20 23:49:30,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:30,055 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-02-20 23:49:30,055 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-02-20 23:49:30,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:30,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:30,055 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:30,055 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:30,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.44) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:30,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-02-20 23:49:30,069 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 6 [2022-02-20 23:49:30,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:30,069 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-02-20 23:49:30,070 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:30,070 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-02-20 23:49:30,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:49:30,070 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:30,070 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:49:30,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:49:30,071 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2022-02-20 23:49:30,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:30,071 INFO L85 PathProgramCache]: Analyzing trace with hash 889666574, now seen corresponding path program 1 times [2022-02-20 23:49:30,072 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:30,072 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533122842] [2022-02-20 23:49:30,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:30,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:30,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:30,149 INFO L290 TraceCheckUtils]: 0: Hoare triple {587#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {587#true} is VALID [2022-02-20 23:49:30,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {587#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(128);call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; {589#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:30,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {589#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {590#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:49:30,151 INFO L290 TraceCheckUtils]: 3: Hoare triple {590#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} assume !!(foo_~i~0#1 <= foo_~size#1); {590#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:49:30,151 INFO L290 TraceCheckUtils]: 4: Hoare triple {590#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {590#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:49:30,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {590#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} assume !(1 + (foo_~b#1.offset + foo_~i~0#1) <= #length[foo_~b#1.base] && 0 <= foo_~b#1.offset + foo_~i~0#1); {588#false} is VALID [2022-02-20 23:49:30,152 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 23:49:30,153 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:49:30,153 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533122842] [2022-02-20 23:49:30,153 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533122842] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:49:30,153 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:49:30,153 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:49:30,153 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193446678] [2022-02-20 23:49:30,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:49:30,154 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:49:30,154 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:30,154 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:30,159 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:30,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:49:30,160 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:30,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:49:30,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:49:30,161 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:30,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:30,262 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2022-02-20 23:49:30,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:49:30,262 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:49:30,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:30,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:30,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-02-20 23:49:30,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:30,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-02-20 23:49:30,264 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 59 transitions. [2022-02-20 23:49:30,309 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:30,310 INFO L225 Difference]: With dead ends: 55 [2022-02-20 23:49:30,310 INFO L226 Difference]: Without dead ends: 55 [2022-02-20 23:49:30,311 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:49:30,311 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 69 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:30,312 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 32 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:49:30,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-02-20 23:49:30,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 33. [2022-02-20 23:49:30,313 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:30,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 33 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 32 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:30,314 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 33 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 32 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:30,314 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 33 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 32 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:30,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:30,315 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2022-02-20 23:49:30,315 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-02-20 23:49:30,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:30,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:30,316 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 32 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 55 states. [2022-02-20 23:49:30,316 INFO L87 Difference]: Start difference. First operand has 33 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 32 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 55 states. [2022-02-20 23:49:30,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:30,317 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2022-02-20 23:49:30,317 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-02-20 23:49:30,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:30,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:30,318 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:30,318 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:30,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 32 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:30,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-02-20 23:49:30,319 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 6 [2022-02-20 23:49:30,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:30,319 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-02-20 23:49:30,319 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:30,319 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-02-20 23:49:30,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:49:30,320 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:30,320 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:30,320 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:49:30,320 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2022-02-20 23:49:30,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:30,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1809810359, now seen corresponding path program 1 times [2022-02-20 23:49:30,321 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:30,321 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202361138] [2022-02-20 23:49:30,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:30,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:30,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:30,355 INFO L290 TraceCheckUtils]: 0: Hoare triple {793#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {793#true} is VALID [2022-02-20 23:49:30,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {793#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(128);call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; {795#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:30,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {795#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {796#(and (= |ULTIMATE.start_foo_~size#1| 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:49:30,357 INFO L290 TraceCheckUtils]: 3: Hoare triple {796#(and (= |ULTIMATE.start_foo_~size#1| 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} assume !(foo_~i~0#1 <= foo_~size#1); {794#false} is VALID [2022-02-20 23:49:30,357 INFO L290 TraceCheckUtils]: 4: Hoare triple {794#false} foo_#res#1 := foo_~i~0#1; {794#false} is VALID [2022-02-20 23:49:30,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {794#false} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {794#false} is VALID [2022-02-20 23:49:30,357 INFO L290 TraceCheckUtils]: 6: Hoare triple {794#false} assume !(1 == #valid[main_~#b~0#1.base]); {794#false} is VALID [2022-02-20 23:49:30,357 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 23:49:30,357 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:49:30,358 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202361138] [2022-02-20 23:49:30,358 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202361138] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:49:30,358 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:49:30,358 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:49:30,358 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230464639] [2022-02-20 23:49:30,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:49:30,359 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:49:30,359 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:30,359 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:30,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:30,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:49:30,364 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:30,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:49:30,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:49:30,365 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:30,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:30,451 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2022-02-20 23:49:30,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:49:30,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:49:30,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:30,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:30,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-02-20 23:49:30,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:30,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-02-20 23:49:30,453 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 62 transitions. [2022-02-20 23:49:30,504 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:30,505 INFO L225 Difference]: With dead ends: 60 [2022-02-20 23:49:30,505 INFO L226 Difference]: Without dead ends: 60 [2022-02-20 23:49:30,505 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:49:30,506 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 31 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:30,506 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 45 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:49:30,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-02-20 23:49:30,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 34. [2022-02-20 23:49:30,508 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:30,508 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 34 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 33 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:30,509 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 34 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 33 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:30,509 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 34 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 33 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:30,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:30,510 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2022-02-20 23:49:30,510 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2022-02-20 23:49:30,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:30,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:30,510 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 33 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 60 states. [2022-02-20 23:49:30,511 INFO L87 Difference]: Start difference. First operand has 34 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 33 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 60 states. [2022-02-20 23:49:30,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:30,512 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2022-02-20 23:49:30,512 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2022-02-20 23:49:30,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:30,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:30,512 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:30,512 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:30,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 33 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:30,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-02-20 23:49:30,513 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 7 [2022-02-20 23:49:30,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:30,514 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-02-20 23:49:30,514 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:30,514 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-02-20 23:49:30,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 23:49:30,514 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:30,514 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:30,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 23:49:30,515 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2022-02-20 23:49:30,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:30,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1480744241, now seen corresponding path program 1 times [2022-02-20 23:49:30,515 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:30,515 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061086346] [2022-02-20 23:49:30,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:30,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:30,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:30,560 INFO L290 TraceCheckUtils]: 0: Hoare triple {1015#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1015#true} is VALID [2022-02-20 23:49:30,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {1015#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(128);call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; {1017#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:30,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {1017#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {1018#(and (= |ULTIMATE.start_foo_~size#1| 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:49:30,561 INFO L290 TraceCheckUtils]: 3: Hoare triple {1018#(and (= |ULTIMATE.start_foo_~size#1| 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} assume !!(foo_~i~0#1 <= foo_~size#1); {1018#(and (= |ULTIMATE.start_foo_~size#1| 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:49:30,562 INFO L290 TraceCheckUtils]: 4: Hoare triple {1018#(and (= |ULTIMATE.start_foo_~size#1| 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {1018#(and (= |ULTIMATE.start_foo_~size#1| 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:49:30,562 INFO L290 TraceCheckUtils]: 5: Hoare triple {1018#(and (= |ULTIMATE.start_foo_~size#1| 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {1018#(and (= |ULTIMATE.start_foo_~size#1| 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:49:30,563 INFO L290 TraceCheckUtils]: 6: Hoare triple {1018#(and (= |ULTIMATE.start_foo_~size#1| 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {1018#(and (= |ULTIMATE.start_foo_~size#1| 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:49:30,563 INFO L290 TraceCheckUtils]: 7: Hoare triple {1018#(and (= |ULTIMATE.start_foo_~size#1| 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {1019#(and (= |ULTIMATE.start_foo_~size#1| 0) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:49:30,564 INFO L290 TraceCheckUtils]: 8: Hoare triple {1019#(and (= |ULTIMATE.start_foo_~size#1| 0) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} assume !!(foo_~i~0#1 <= foo_~size#1); {1016#false} is VALID [2022-02-20 23:49:30,564 INFO L290 TraceCheckUtils]: 9: Hoare triple {1016#false} assume !(0 <= foo_~i~0#1 && foo_~i~0#1 < 32); {1016#false} is VALID [2022-02-20 23:49:30,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:49:30,565 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:49:30,565 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061086346] [2022-02-20 23:49:30,565 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061086346] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:49:30,565 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43273102] [2022-02-20 23:49:30,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:30,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:49:30,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:49:30,567 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 23:49:30,584 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 23:49:30,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:30,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:49:30,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:30,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:49:30,813 INFO L290 TraceCheckUtils]: 0: Hoare triple {1015#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1015#true} is VALID [2022-02-20 23:49:30,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {1015#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(128);call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; {1026#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:30,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {1026#(<= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {1030#(and (<= |ULTIMATE.start_foo_~size#1| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:49:30,815 INFO L290 TraceCheckUtils]: 3: Hoare triple {1030#(and (<= |ULTIMATE.start_foo_~size#1| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} assume !!(foo_~i~0#1 <= foo_~size#1); {1030#(and (<= |ULTIMATE.start_foo_~size#1| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:49:30,815 INFO L290 TraceCheckUtils]: 4: Hoare triple {1030#(and (<= |ULTIMATE.start_foo_~size#1| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {1030#(and (<= |ULTIMATE.start_foo_~size#1| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:49:30,816 INFO L290 TraceCheckUtils]: 5: Hoare triple {1030#(and (<= |ULTIMATE.start_foo_~size#1| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {1030#(and (<= |ULTIMATE.start_foo_~size#1| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:49:30,816 INFO L290 TraceCheckUtils]: 6: Hoare triple {1030#(and (<= |ULTIMATE.start_foo_~size#1| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {1030#(and (<= |ULTIMATE.start_foo_~size#1| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:49:30,817 INFO L290 TraceCheckUtils]: 7: Hoare triple {1030#(and (<= |ULTIMATE.start_foo_~size#1| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {1046#(and (<= 1 |ULTIMATE.start_foo_~i~0#1|) (<= |ULTIMATE.start_foo_~size#1| 0))} is VALID [2022-02-20 23:49:30,817 INFO L290 TraceCheckUtils]: 8: Hoare triple {1046#(and (<= 1 |ULTIMATE.start_foo_~i~0#1|) (<= |ULTIMATE.start_foo_~size#1| 0))} assume !!(foo_~i~0#1 <= foo_~size#1); {1016#false} is VALID [2022-02-20 23:49:30,817 INFO L290 TraceCheckUtils]: 9: Hoare triple {1016#false} assume !(0 <= foo_~i~0#1 && foo_~i~0#1 < 32); {1016#false} is VALID [2022-02-20 23:49:30,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:49:30,818 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:49:30,818 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43273102] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:49:30,818 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:49:30,818 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2022-02-20 23:49:30,818 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87925103] [2022-02-20 23:49:30,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:49:30,819 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 23:49:30,819 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:30,819 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:30,826 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:30,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:49:30,827 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:30,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:49:30,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:49:30,827 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:30,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:30,977 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2022-02-20 23:49:30,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:49:30,977 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 23:49:30,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:30,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:30,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2022-02-20 23:49:30,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:30,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2022-02-20 23:49:30,979 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 78 transitions. [2022-02-20 23:49:31,036 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:31,037 INFO L225 Difference]: With dead ends: 75 [2022-02-20 23:49:31,037 INFO L226 Difference]: Without dead ends: 75 [2022-02-20 23:49:31,038 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:49:31,038 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 84 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:31,039 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 47 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:49:31,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-02-20 23:49:31,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 39. [2022-02-20 23:49:31,041 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:31,041 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 39 states, 32 states have (on average 1.34375) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:31,041 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 39 states, 32 states have (on average 1.34375) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:31,041 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 39 states, 32 states have (on average 1.34375) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:31,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:31,043 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2022-02-20 23:49:31,043 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2022-02-20 23:49:31,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:31,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:31,043 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 32 states have (on average 1.34375) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 75 states. [2022-02-20 23:49:31,043 INFO L87 Difference]: Start difference. First operand has 39 states, 32 states have (on average 1.34375) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 75 states. [2022-02-20 23:49:31,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:31,045 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2022-02-20 23:49:31,045 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2022-02-20 23:49:31,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:31,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:31,045 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:31,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:31,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.34375) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:31,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-02-20 23:49:31,046 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 10 [2022-02-20 23:49:31,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:31,047 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-02-20 23:49:31,047 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:31,047 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-02-20 23:49:31,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:49:31,047 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:31,047 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:31,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 23:49:31,282 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-02-20 23:49:31,282 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2022-02-20 23:49:31,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:31,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1361088610, now seen corresponding path program 1 times [2022-02-20 23:49:31,283 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:31,283 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454109262] [2022-02-20 23:49:31,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:31,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:31,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:31,330 INFO L290 TraceCheckUtils]: 0: Hoare triple {1320#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1320#true} is VALID [2022-02-20 23:49:31,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {1320#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(128);call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; {1322#(or (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#b~0#1.base|) 1))} is VALID [2022-02-20 23:49:31,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {1322#(or (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#b~0#1.base|) 1))} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {1323#(or (= |ULTIMATE.start_foo_~b#1.base| |ULTIMATE.start_main_~#b~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#b~0#1.base|) 1))} is VALID [2022-02-20 23:49:31,332 INFO L290 TraceCheckUtils]: 3: Hoare triple {1323#(or (= |ULTIMATE.start_foo_~b#1.base| |ULTIMATE.start_main_~#b~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#b~0#1.base|) 1))} assume !!(foo_~i~0#1 <= foo_~size#1); {1323#(or (= |ULTIMATE.start_foo_~b#1.base| |ULTIMATE.start_main_~#b~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#b~0#1.base|) 1))} is VALID [2022-02-20 23:49:31,333 INFO L290 TraceCheckUtils]: 4: Hoare triple {1323#(or (= |ULTIMATE.start_foo_~b#1.base| |ULTIMATE.start_main_~#b~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#b~0#1.base|) 1))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {1323#(or (= |ULTIMATE.start_foo_~b#1.base| |ULTIMATE.start_main_~#b~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#b~0#1.base|) 1))} is VALID [2022-02-20 23:49:31,333 INFO L290 TraceCheckUtils]: 5: Hoare triple {1323#(or (= |ULTIMATE.start_foo_~b#1.base| |ULTIMATE.start_main_~#b~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#b~0#1.base|) 1))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {1324#(= (select |#valid| |ULTIMATE.start_main_~#b~0#1.base|) 1)} is VALID [2022-02-20 23:49:31,334 INFO L290 TraceCheckUtils]: 6: Hoare triple {1324#(= (select |#valid| |ULTIMATE.start_main_~#b~0#1.base|) 1)} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {1324#(= (select |#valid| |ULTIMATE.start_main_~#b~0#1.base|) 1)} is VALID [2022-02-20 23:49:31,334 INFO L290 TraceCheckUtils]: 7: Hoare triple {1324#(= (select |#valid| |ULTIMATE.start_main_~#b~0#1.base|) 1)} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {1324#(= (select |#valid| |ULTIMATE.start_main_~#b~0#1.base|) 1)} is VALID [2022-02-20 23:49:31,334 INFO L290 TraceCheckUtils]: 8: Hoare triple {1324#(= (select |#valid| |ULTIMATE.start_main_~#b~0#1.base|) 1)} assume !(foo_~i~0#1 <= foo_~size#1); {1324#(= (select |#valid| |ULTIMATE.start_main_~#b~0#1.base|) 1)} is VALID [2022-02-20 23:49:31,335 INFO L290 TraceCheckUtils]: 9: Hoare triple {1324#(= (select |#valid| |ULTIMATE.start_main_~#b~0#1.base|) 1)} foo_#res#1 := foo_~i~0#1; {1324#(= (select |#valid| |ULTIMATE.start_main_~#b~0#1.base|) 1)} is VALID [2022-02-20 23:49:31,335 INFO L290 TraceCheckUtils]: 10: Hoare triple {1324#(= (select |#valid| |ULTIMATE.start_main_~#b~0#1.base|) 1)} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {1324#(= (select |#valid| |ULTIMATE.start_main_~#b~0#1.base|) 1)} is VALID [2022-02-20 23:49:31,335 INFO L290 TraceCheckUtils]: 11: Hoare triple {1324#(= (select |#valid| |ULTIMATE.start_main_~#b~0#1.base|) 1)} assume !(1 == #valid[main_~#b~0#1.base]); {1321#false} is VALID [2022-02-20 23:49:31,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:49:31,336 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:49:31,336 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454109262] [2022-02-20 23:49:31,336 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454109262] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:49:31,336 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:49:31,336 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:49:31,336 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417259150] [2022-02-20 23:49:31,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:49:31,337 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 23:49:31,337 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:31,337 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:31,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:31,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:49:31,345 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:31,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:49:31,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:49:31,346 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:31,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:31,391 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-02-20 23:49:31,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:49:31,391 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 23:49:31,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:31,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:31,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2022-02-20 23:49:31,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:31,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2022-02-20 23:49:31,392 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 31 transitions. [2022-02-20 23:49:31,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:31,415 INFO L225 Difference]: With dead ends: 37 [2022-02-20 23:49:31,415 INFO L226 Difference]: Without dead ends: 37 [2022-02-20 23:49:31,415 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:49:31,416 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 63 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:31,416 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 22 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:49:31,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-02-20 23:49:31,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-02-20 23:49:31,417 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:31,418 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.28125) internal successors, (41), 36 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:31,418 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.28125) internal successors, (41), 36 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:31,418 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.28125) internal successors, (41), 36 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:31,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:31,419 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-02-20 23:49:31,419 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-02-20 23:49:31,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:31,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:31,419 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.28125) internal successors, (41), 36 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 37 states. [2022-02-20 23:49:31,419 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.28125) internal successors, (41), 36 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 37 states. [2022-02-20 23:49:31,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:31,420 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-02-20 23:49:31,420 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-02-20 23:49:31,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:31,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:31,421 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:31,421 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:31,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.28125) internal successors, (41), 36 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:31,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2022-02-20 23:49:31,422 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 12 [2022-02-20 23:49:31,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:31,422 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2022-02-20 23:49:31,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:31,422 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-02-20 23:49:31,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:49:31,422 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:31,422 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:31,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 23:49:31,423 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2022-02-20 23:49:31,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:31,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1361088609, now seen corresponding path program 1 times [2022-02-20 23:49:31,423 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:31,424 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225927825] [2022-02-20 23:49:31,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:31,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:31,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:31,512 INFO L290 TraceCheckUtils]: 0: Hoare triple {1475#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1475#true} is VALID [2022-02-20 23:49:31,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {1475#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(128);call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; {1477#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:31,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {1477#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {1478#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:31,514 INFO L290 TraceCheckUtils]: 3: Hoare triple {1478#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} assume !!(foo_~i~0#1 <= foo_~size#1); {1478#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:31,515 INFO L290 TraceCheckUtils]: 4: Hoare triple {1478#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {1478#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:31,515 INFO L290 TraceCheckUtils]: 5: Hoare triple {1478#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {1478#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:31,516 INFO L290 TraceCheckUtils]: 6: Hoare triple {1478#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {1478#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:31,516 INFO L290 TraceCheckUtils]: 7: Hoare triple {1478#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {1478#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:31,517 INFO L290 TraceCheckUtils]: 8: Hoare triple {1478#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} assume !(foo_~i~0#1 <= foo_~size#1); {1478#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:31,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {1478#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} foo_#res#1 := foo_~i~0#1; {1478#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:31,517 INFO L290 TraceCheckUtils]: 10: Hoare triple {1478#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {1478#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:31,518 INFO L290 TraceCheckUtils]: 11: Hoare triple {1478#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} assume !(4 + (main_~#b~0#1.offset + 4 * main_~i~1#1) <= #length[main_~#b~0#1.base] && 0 <= main_~#b~0#1.offset + 4 * main_~i~1#1); {1476#false} is VALID [2022-02-20 23:49:31,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:49:31,518 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:49:31,518 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225927825] [2022-02-20 23:49:31,519 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225927825] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:49:31,519 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:49:31,519 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:49:31,519 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797207320] [2022-02-20 23:49:31,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:49:31,519 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 23:49:31,520 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:31,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:31,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:31,528 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:49:31,528 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:31,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:49:31,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:49:31,529 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:31,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:31,576 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-02-20 23:49:31,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:49:31,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 23:49:31,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:31,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:31,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-02-20 23:49:31,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:31,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-02-20 23:49:31,578 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2022-02-20 23:49:31,610 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:31,611 INFO L225 Difference]: With dead ends: 42 [2022-02-20 23:49:31,611 INFO L226 Difference]: Without dead ends: 42 [2022-02-20 23:49:31,611 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 23:49:31,611 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 13 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:31,625 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 36 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:49:31,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-02-20 23:49:31,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2022-02-20 23:49:31,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:31,627 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 40 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 39 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:31,627 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 40 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 39 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:31,627 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 40 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 39 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:31,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:31,628 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-02-20 23:49:31,628 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-02-20 23:49:31,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:31,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:31,629 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 39 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 42 states. [2022-02-20 23:49:31,629 INFO L87 Difference]: Start difference. First operand has 40 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 39 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 42 states. [2022-02-20 23:49:31,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:31,630 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-02-20 23:49:31,630 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-02-20 23:49:31,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:31,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:31,630 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:31,630 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:31,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 39 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:31,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-02-20 23:49:31,631 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 12 [2022-02-20 23:49:31,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:31,631 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-02-20 23:49:31,632 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:31,632 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-02-20 23:49:31,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:49:31,632 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:31,632 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:31,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 23:49:31,632 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2022-02-20 23:49:31,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:31,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1343012932, now seen corresponding path program 1 times [2022-02-20 23:49:31,633 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:31,633 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294849643] [2022-02-20 23:49:31,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:31,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:31,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:31,710 INFO L290 TraceCheckUtils]: 0: Hoare triple {1647#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1647#true} is VALID [2022-02-20 23:49:31,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {1647#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(128);call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; {1649#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0))} is VALID [2022-02-20 23:49:31,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {1649#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0))} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {1649#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0))} is VALID [2022-02-20 23:49:31,712 INFO L290 TraceCheckUtils]: 3: Hoare triple {1649#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0))} assume !!(foo_~i~0#1 <= foo_~size#1); {1649#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0))} is VALID [2022-02-20 23:49:31,712 INFO L290 TraceCheckUtils]: 4: Hoare triple {1649#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {1649#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0))} is VALID [2022-02-20 23:49:31,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {1649#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {1649#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0))} is VALID [2022-02-20 23:49:31,713 INFO L290 TraceCheckUtils]: 6: Hoare triple {1649#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {1649#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0))} is VALID [2022-02-20 23:49:31,714 INFO L290 TraceCheckUtils]: 7: Hoare triple {1649#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {1649#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0))} is VALID [2022-02-20 23:49:31,714 INFO L290 TraceCheckUtils]: 8: Hoare triple {1649#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0))} assume !(foo_~i~0#1 <= foo_~size#1); {1649#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0))} is VALID [2022-02-20 23:49:31,714 INFO L290 TraceCheckUtils]: 9: Hoare triple {1649#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0))} foo_#res#1 := foo_~i~0#1; {1649#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0))} is VALID [2022-02-20 23:49:31,715 INFO L290 TraceCheckUtils]: 10: Hoare triple {1649#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0))} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {1649#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0))} is VALID [2022-02-20 23:49:31,715 INFO L290 TraceCheckUtils]: 11: Hoare triple {1649#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0))} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {1650#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:31,716 INFO L290 TraceCheckUtils]: 12: Hoare triple {1650#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} havoc main_#t~ret3#1; {1650#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:31,716 INFO L290 TraceCheckUtils]: 13: Hoare triple {1650#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1651#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:31,717 INFO L290 TraceCheckUtils]: 14: Hoare triple {1651#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} assume !(main_~i~1#1 % 4294967296 < 32); {1651#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:31,717 INFO L290 TraceCheckUtils]: 15: Hoare triple {1651#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} main_~i~1#1 := 0; {1650#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:31,718 INFO L290 TraceCheckUtils]: 16: Hoare triple {1650#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} assume !!(main_~i~1#1 % 4294967296 < 32); {1650#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:31,718 INFO L290 TraceCheckUtils]: 17: Hoare triple {1650#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} assume !(4 + (main_~#b~0#1.offset + 4 * main_~i~1#1) <= #length[main_~#b~0#1.base] && 0 <= main_~#b~0#1.offset + 4 * main_~i~1#1); {1648#false} is VALID [2022-02-20 23:49:31,719 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 23:49:31,731 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:49:31,731 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294849643] [2022-02-20 23:49:31,731 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294849643] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:49:31,732 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006356198] [2022-02-20 23:49:31,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:31,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:49:31,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:49:31,733 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 23:49:31,734 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 23:49:31,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:31,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:49:31,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:31,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:49:31,980 INFO L290 TraceCheckUtils]: 0: Hoare triple {1647#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1647#true} is VALID [2022-02-20 23:49:31,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {1647#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(128);call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; {1658#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:31,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {1658#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {1658#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:31,983 INFO L290 TraceCheckUtils]: 3: Hoare triple {1658#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} assume !!(foo_~i~0#1 <= foo_~size#1); {1658#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:31,984 INFO L290 TraceCheckUtils]: 4: Hoare triple {1658#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {1658#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:31,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {1658#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {1658#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:31,985 INFO L290 TraceCheckUtils]: 6: Hoare triple {1658#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {1658#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:31,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {1658#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {1658#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:31,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {1658#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} assume !(foo_~i~0#1 <= foo_~size#1); {1658#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:31,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {1658#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} foo_#res#1 := foo_~i~0#1; {1658#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:31,986 INFO L290 TraceCheckUtils]: 10: Hoare triple {1658#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {1658#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:31,987 INFO L290 TraceCheckUtils]: 11: Hoare triple {1658#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {1689#(and (<= 0 (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:31,987 INFO L290 TraceCheckUtils]: 12: Hoare triple {1689#(and (<= 0 (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} havoc main_#t~ret3#1; {1689#(and (<= 0 (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:31,988 INFO L290 TraceCheckUtils]: 13: Hoare triple {1689#(and (<= 0 (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1689#(and (<= 0 (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:31,990 INFO L290 TraceCheckUtils]: 14: Hoare triple {1689#(and (<= 0 (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} assume !(main_~i~1#1 % 4294967296 < 32); {1689#(and (<= 0 (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:31,991 INFO L290 TraceCheckUtils]: 15: Hoare triple {1689#(and (<= 0 (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} main_~i~1#1 := 0; {1702#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 0 (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:31,991 INFO L290 TraceCheckUtils]: 16: Hoare triple {1702#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 0 (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} assume !!(main_~i~1#1 % 4294967296 < 32); {1702#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 0 (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:31,992 INFO L290 TraceCheckUtils]: 17: Hoare triple {1702#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 0 (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} assume !(4 + (main_~#b~0#1.offset + 4 * main_~i~1#1) <= #length[main_~#b~0#1.base] && 0 <= main_~#b~0#1.offset + 4 * main_~i~1#1); {1648#false} is VALID [2022-02-20 23:49:31,992 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 23:49:31,992 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:49:32,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-02-20 23:49:32,260 INFO L290 TraceCheckUtils]: 17: Hoare triple {1709#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} assume !(4 + (main_~#b~0#1.offset + 4 * main_~i~1#1) <= #length[main_~#b~0#1.base] && 0 <= main_~#b~0#1.offset + 4 * main_~i~1#1); {1648#false} is VALID [2022-02-20 23:49:32,261 INFO L290 TraceCheckUtils]: 16: Hoare triple {1709#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} assume !!(main_~i~1#1 % 4294967296 < 32); {1709#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:32,262 INFO L290 TraceCheckUtils]: 15: Hoare triple {1689#(and (<= 0 (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} main_~i~1#1 := 0; {1709#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:32,262 INFO L290 TraceCheckUtils]: 14: Hoare triple {1689#(and (<= 0 (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} assume !(main_~i~1#1 % 4294967296 < 32); {1689#(and (<= 0 (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:32,263 INFO L290 TraceCheckUtils]: 13: Hoare triple {1689#(and (<= 0 (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1689#(and (<= 0 (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:32,264 INFO L290 TraceCheckUtils]: 12: Hoare triple {1689#(and (<= 0 (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} havoc main_#t~ret3#1; {1689#(and (<= 0 (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:32,264 INFO L290 TraceCheckUtils]: 11: Hoare triple {1658#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {1689#(and (<= 0 (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:32,266 INFO L290 TraceCheckUtils]: 10: Hoare triple {1658#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {1658#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:32,266 INFO L290 TraceCheckUtils]: 9: Hoare triple {1658#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} foo_#res#1 := foo_~i~0#1; {1658#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:32,273 INFO L290 TraceCheckUtils]: 8: Hoare triple {1658#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} assume !(foo_~i~0#1 <= foo_~size#1); {1658#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:32,275 INFO L290 TraceCheckUtils]: 7: Hoare triple {1658#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {1658#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:32,276 INFO L290 TraceCheckUtils]: 6: Hoare triple {1658#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {1658#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:32,277 INFO L290 TraceCheckUtils]: 5: Hoare triple {1658#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {1658#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:32,277 INFO L290 TraceCheckUtils]: 4: Hoare triple {1658#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {1658#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:32,277 INFO L290 TraceCheckUtils]: 3: Hoare triple {1658#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} assume !!(foo_~i~0#1 <= foo_~size#1); {1658#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:32,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {1658#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {1658#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:32,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {1647#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(128);call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; {1658#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:32,279 INFO L290 TraceCheckUtils]: 0: Hoare triple {1647#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1647#true} is VALID [2022-02-20 23:49:32,279 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 23:49:32,279 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006356198] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:49:32,280 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:49:32,280 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-02-20 23:49:32,280 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004853976] [2022-02-20 23:49:32,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:49:32,281 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 23:49:32,281 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:32,281 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:32,313 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:32,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:49:32,314 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:32,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:49:32,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:49:32,314 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:32,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:32,545 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-02-20 23:49:32,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:49:32,546 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 23:49:32,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:32,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:32,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-02-20 23:49:32,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:32,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-02-20 23:49:32,551 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 48 transitions. [2022-02-20 23:49:32,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:32,616 INFO L225 Difference]: With dead ends: 46 [2022-02-20 23:49:32,616 INFO L226 Difference]: Without dead ends: 46 [2022-02-20 23:49:32,616 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:49:32,617 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 123 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:32,617 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 37 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:49:32,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-02-20 23:49:32,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2022-02-20 23:49:32,618 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:32,618 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 41 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:32,619 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 41 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:32,619 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 41 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:32,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:32,619 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-02-20 23:49:32,619 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-02-20 23:49:32,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:32,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:32,620 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 46 states. [2022-02-20 23:49:32,620 INFO L87 Difference]: Start difference. First operand has 41 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 46 states. [2022-02-20 23:49:32,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:32,621 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-02-20 23:49:32,621 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-02-20 23:49:32,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:32,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:32,621 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:32,621 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:32,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:32,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2022-02-20 23:49:32,622 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 18 [2022-02-20 23:49:32,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:32,622 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2022-02-20 23:49:32,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:32,622 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-02-20 23:49:32,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 23:49:32,622 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:32,622 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:32,641 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 23:49:32,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-02-20 23:49:32,823 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2022-02-20 23:49:32,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:32,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1315219428, now seen corresponding path program 1 times [2022-02-20 23:49:32,824 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:32,824 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82043813] [2022-02-20 23:49:32,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:32,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:32,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:32,873 INFO L290 TraceCheckUtils]: 0: Hoare triple {1943#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1943#true} is VALID [2022-02-20 23:49:32,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {1943#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(128);call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; {1945#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:32,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {1945#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {1945#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:32,874 INFO L290 TraceCheckUtils]: 3: Hoare triple {1945#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(foo_~i~0#1 <= foo_~size#1); {1945#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:32,875 INFO L290 TraceCheckUtils]: 4: Hoare triple {1945#(= |ULTIMATE.start_main_~i~1#1| 0)} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {1945#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:32,875 INFO L290 TraceCheckUtils]: 5: Hoare triple {1945#(= |ULTIMATE.start_main_~i~1#1| 0)} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {1945#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:32,875 INFO L290 TraceCheckUtils]: 6: Hoare triple {1945#(= |ULTIMATE.start_main_~i~1#1| 0)} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {1945#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:32,876 INFO L290 TraceCheckUtils]: 7: Hoare triple {1945#(= |ULTIMATE.start_main_~i~1#1| 0)} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {1945#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:32,876 INFO L290 TraceCheckUtils]: 8: Hoare triple {1945#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !(foo_~i~0#1 <= foo_~size#1); {1945#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:32,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {1945#(= |ULTIMATE.start_main_~i~1#1| 0)} foo_#res#1 := foo_~i~0#1; {1945#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:32,877 INFO L290 TraceCheckUtils]: 10: Hoare triple {1945#(= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {1945#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:32,877 INFO L290 TraceCheckUtils]: 11: Hoare triple {1945#(= |ULTIMATE.start_main_~i~1#1| 0)} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {1945#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:32,877 INFO L290 TraceCheckUtils]: 12: Hoare triple {1945#(= |ULTIMATE.start_main_~i~1#1| 0)} havoc main_#t~ret3#1; {1945#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:32,878 INFO L290 TraceCheckUtils]: 13: Hoare triple {1945#(= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1946#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:32,878 INFO L290 TraceCheckUtils]: 14: Hoare triple {1946#(<= 1 |ULTIMATE.start_main_~i~1#1|)} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {1947#(and (<= 1 |ULTIMATE.start_main_~i~1#1|) (= (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) |ULTIMATE.start_main_~i~1#1|) 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:49:32,879 INFO L290 TraceCheckUtils]: 15: Hoare triple {1947#(and (<= 1 |ULTIMATE.start_main_~i~1#1|) (= (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) |ULTIMATE.start_main_~i~1#1|) 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} assume !(foo_~i~0#1 <= foo_~size#1); {1944#false} is VALID [2022-02-20 23:49:32,879 INFO L290 TraceCheckUtils]: 16: Hoare triple {1944#false} foo_#res#1 := foo_~i~0#1; {1944#false} is VALID [2022-02-20 23:49:32,879 INFO L290 TraceCheckUtils]: 17: Hoare triple {1944#false} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {1944#false} is VALID [2022-02-20 23:49:32,879 INFO L290 TraceCheckUtils]: 18: Hoare triple {1944#false} assume !(4 + (main_~#b~0#1.offset + 4 * main_~i~1#1) <= #length[main_~#b~0#1.base] && 0 <= main_~#b~0#1.offset + 4 * main_~i~1#1); {1944#false} is VALID [2022-02-20 23:49:32,879 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:49:32,879 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:49:32,880 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82043813] [2022-02-20 23:49:32,880 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82043813] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:49:32,880 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219194289] [2022-02-20 23:49:32,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:32,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:49:32,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:49:32,896 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 23:49:32,897 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 23:49:32,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:32,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:49:32,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:32,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:49:33,053 INFO L290 TraceCheckUtils]: 0: Hoare triple {1943#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1943#true} is VALID [2022-02-20 23:49:33,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {1943#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(128);call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; {1954#(<= 0 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:33,054 INFO L290 TraceCheckUtils]: 2: Hoare triple {1954#(<= 0 |ULTIMATE.start_main_~i~1#1|)} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {1954#(<= 0 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:33,055 INFO L290 TraceCheckUtils]: 3: Hoare triple {1954#(<= 0 |ULTIMATE.start_main_~i~1#1|)} assume !!(foo_~i~0#1 <= foo_~size#1); {1954#(<= 0 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:33,055 INFO L290 TraceCheckUtils]: 4: Hoare triple {1954#(<= 0 |ULTIMATE.start_main_~i~1#1|)} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {1954#(<= 0 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:33,055 INFO L290 TraceCheckUtils]: 5: Hoare triple {1954#(<= 0 |ULTIMATE.start_main_~i~1#1|)} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {1954#(<= 0 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:33,056 INFO L290 TraceCheckUtils]: 6: Hoare triple {1954#(<= 0 |ULTIMATE.start_main_~i~1#1|)} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {1954#(<= 0 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:33,056 INFO L290 TraceCheckUtils]: 7: Hoare triple {1954#(<= 0 |ULTIMATE.start_main_~i~1#1|)} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {1954#(<= 0 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:33,057 INFO L290 TraceCheckUtils]: 8: Hoare triple {1954#(<= 0 |ULTIMATE.start_main_~i~1#1|)} assume !(foo_~i~0#1 <= foo_~size#1); {1954#(<= 0 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:33,057 INFO L290 TraceCheckUtils]: 9: Hoare triple {1954#(<= 0 |ULTIMATE.start_main_~i~1#1|)} foo_#res#1 := foo_~i~0#1; {1954#(<= 0 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:33,057 INFO L290 TraceCheckUtils]: 10: Hoare triple {1954#(<= 0 |ULTIMATE.start_main_~i~1#1|)} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {1954#(<= 0 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:33,058 INFO L290 TraceCheckUtils]: 11: Hoare triple {1954#(<= 0 |ULTIMATE.start_main_~i~1#1|)} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {1954#(<= 0 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:33,058 INFO L290 TraceCheckUtils]: 12: Hoare triple {1954#(<= 0 |ULTIMATE.start_main_~i~1#1|)} havoc main_#t~ret3#1; {1954#(<= 0 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:33,059 INFO L290 TraceCheckUtils]: 13: Hoare triple {1954#(<= 0 |ULTIMATE.start_main_~i~1#1|)} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1946#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:33,059 INFO L290 TraceCheckUtils]: 14: Hoare triple {1946#(<= 1 |ULTIMATE.start_main_~i~1#1|)} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {1994#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 1 |ULTIMATE.start_foo_~size#1|))} is VALID [2022-02-20 23:49:33,060 INFO L290 TraceCheckUtils]: 15: Hoare triple {1994#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 1 |ULTIMATE.start_foo_~size#1|))} assume !(foo_~i~0#1 <= foo_~size#1); {1944#false} is VALID [2022-02-20 23:49:33,060 INFO L290 TraceCheckUtils]: 16: Hoare triple {1944#false} foo_#res#1 := foo_~i~0#1; {1944#false} is VALID [2022-02-20 23:49:33,060 INFO L290 TraceCheckUtils]: 17: Hoare triple {1944#false} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {1944#false} is VALID [2022-02-20 23:49:33,060 INFO L290 TraceCheckUtils]: 18: Hoare triple {1944#false} assume !(4 + (main_~#b~0#1.offset + 4 * main_~i~1#1) <= #length[main_~#b~0#1.base] && 0 <= main_~#b~0#1.offset + 4 * main_~i~1#1); {1944#false} is VALID [2022-02-20 23:49:33,060 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:49:33,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:49:33,162 INFO L290 TraceCheckUtils]: 18: Hoare triple {1944#false} assume !(4 + (main_~#b~0#1.offset + 4 * main_~i~1#1) <= #length[main_~#b~0#1.base] && 0 <= main_~#b~0#1.offset + 4 * main_~i~1#1); {1944#false} is VALID [2022-02-20 23:49:33,163 INFO L290 TraceCheckUtils]: 17: Hoare triple {1944#false} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {1944#false} is VALID [2022-02-20 23:49:33,163 INFO L290 TraceCheckUtils]: 16: Hoare triple {1944#false} foo_#res#1 := foo_~i~0#1; {1944#false} is VALID [2022-02-20 23:49:33,163 INFO L290 TraceCheckUtils]: 15: Hoare triple {2016#(<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|)} assume !(foo_~i~0#1 <= foo_~size#1); {1944#false} is VALID [2022-02-20 23:49:33,164 INFO L290 TraceCheckUtils]: 14: Hoare triple {1954#(<= 0 |ULTIMATE.start_main_~i~1#1|)} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {2016#(<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|)} is VALID [2022-02-20 23:49:33,164 INFO L290 TraceCheckUtils]: 13: Hoare triple {2023#(<= 0 (+ |ULTIMATE.start_main_~i~1#1| 1))} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1954#(<= 0 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:33,165 INFO L290 TraceCheckUtils]: 12: Hoare triple {2023#(<= 0 (+ |ULTIMATE.start_main_~i~1#1| 1))} havoc main_#t~ret3#1; {2023#(<= 0 (+ |ULTIMATE.start_main_~i~1#1| 1))} is VALID [2022-02-20 23:49:33,165 INFO L290 TraceCheckUtils]: 11: Hoare triple {2023#(<= 0 (+ |ULTIMATE.start_main_~i~1#1| 1))} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {2023#(<= 0 (+ |ULTIMATE.start_main_~i~1#1| 1))} is VALID [2022-02-20 23:49:33,165 INFO L290 TraceCheckUtils]: 10: Hoare triple {2023#(<= 0 (+ |ULTIMATE.start_main_~i~1#1| 1))} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {2023#(<= 0 (+ |ULTIMATE.start_main_~i~1#1| 1))} is VALID [2022-02-20 23:49:33,166 INFO L290 TraceCheckUtils]: 9: Hoare triple {2023#(<= 0 (+ |ULTIMATE.start_main_~i~1#1| 1))} foo_#res#1 := foo_~i~0#1; {2023#(<= 0 (+ |ULTIMATE.start_main_~i~1#1| 1))} is VALID [2022-02-20 23:49:33,166 INFO L290 TraceCheckUtils]: 8: Hoare triple {2023#(<= 0 (+ |ULTIMATE.start_main_~i~1#1| 1))} assume !(foo_~i~0#1 <= foo_~size#1); {2023#(<= 0 (+ |ULTIMATE.start_main_~i~1#1| 1))} is VALID [2022-02-20 23:49:33,166 INFO L290 TraceCheckUtils]: 7: Hoare triple {2023#(<= 0 (+ |ULTIMATE.start_main_~i~1#1| 1))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {2023#(<= 0 (+ |ULTIMATE.start_main_~i~1#1| 1))} is VALID [2022-02-20 23:49:33,167 INFO L290 TraceCheckUtils]: 6: Hoare triple {2023#(<= 0 (+ |ULTIMATE.start_main_~i~1#1| 1))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {2023#(<= 0 (+ |ULTIMATE.start_main_~i~1#1| 1))} is VALID [2022-02-20 23:49:33,167 INFO L290 TraceCheckUtils]: 5: Hoare triple {2023#(<= 0 (+ |ULTIMATE.start_main_~i~1#1| 1))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {2023#(<= 0 (+ |ULTIMATE.start_main_~i~1#1| 1))} is VALID [2022-02-20 23:49:33,167 INFO L290 TraceCheckUtils]: 4: Hoare triple {2023#(<= 0 (+ |ULTIMATE.start_main_~i~1#1| 1))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {2023#(<= 0 (+ |ULTIMATE.start_main_~i~1#1| 1))} is VALID [2022-02-20 23:49:33,168 INFO L290 TraceCheckUtils]: 3: Hoare triple {2023#(<= 0 (+ |ULTIMATE.start_main_~i~1#1| 1))} assume !!(foo_~i~0#1 <= foo_~size#1); {2023#(<= 0 (+ |ULTIMATE.start_main_~i~1#1| 1))} is VALID [2022-02-20 23:49:33,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {2023#(<= 0 (+ |ULTIMATE.start_main_~i~1#1| 1))} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {2023#(<= 0 (+ |ULTIMATE.start_main_~i~1#1| 1))} is VALID [2022-02-20 23:49:33,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {1943#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(128);call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; {2023#(<= 0 (+ |ULTIMATE.start_main_~i~1#1| 1))} is VALID [2022-02-20 23:49:33,169 INFO L290 TraceCheckUtils]: 0: Hoare triple {1943#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1943#true} is VALID [2022-02-20 23:49:33,169 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:49:33,169 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219194289] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:49:33,169 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:49:33,170 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-02-20 23:49:33,170 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861695040] [2022-02-20 23:49:33,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:49:33,170 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 23:49:33,171 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:33,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:33,205 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:33,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:49:33,205 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:33,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:49:33,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:49:33,206 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:33,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:33,448 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2022-02-20 23:49:33,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:49:33,448 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 23:49:33,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:33,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:33,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2022-02-20 23:49:33,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:33,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2022-02-20 23:49:33,450 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 56 transitions. [2022-02-20 23:49:33,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:33,500 INFO L225 Difference]: With dead ends: 51 [2022-02-20 23:49:33,500 INFO L226 Difference]: Without dead ends: 51 [2022-02-20 23:49:33,500 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:49:33,500 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 63 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:33,500 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 64 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:49:33,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-02-20 23:49:33,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 44. [2022-02-20 23:49:33,502 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:33,502 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 44 states, 39 states have (on average 1.205128205128205) internal successors, (47), 43 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:33,502 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 44 states, 39 states have (on average 1.205128205128205) internal successors, (47), 43 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:33,502 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 44 states, 39 states have (on average 1.205128205128205) internal successors, (47), 43 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:33,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:33,503 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2022-02-20 23:49:33,503 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2022-02-20 23:49:33,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:33,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:33,503 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 39 states have (on average 1.205128205128205) internal successors, (47), 43 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 51 states. [2022-02-20 23:49:33,503 INFO L87 Difference]: Start difference. First operand has 44 states, 39 states have (on average 1.205128205128205) internal successors, (47), 43 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 51 states. [2022-02-20 23:49:33,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:33,504 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2022-02-20 23:49:33,504 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2022-02-20 23:49:33,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:33,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:33,504 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:33,504 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:33,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.205128205128205) internal successors, (47), 43 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:33,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2022-02-20 23:49:33,505 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 19 [2022-02-20 23:49:33,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:33,505 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2022-02-20 23:49:33,505 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:33,505 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2022-02-20 23:49:33,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 23:49:33,505 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:33,505 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:33,522 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 23:49:33,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:49:33,713 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2022-02-20 23:49:33,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:33,713 INFO L85 PathProgramCache]: Analyzing trace with hash 2077891072, now seen corresponding path program 1 times [2022-02-20 23:49:33,713 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:33,713 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857058177] [2022-02-20 23:49:33,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:33,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:33,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:33,767 INFO L290 TraceCheckUtils]: 0: Hoare triple {2263#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2263#true} is VALID [2022-02-20 23:49:33,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {2263#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(128);call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; {2265#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:33,768 INFO L290 TraceCheckUtils]: 2: Hoare triple {2265#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {2265#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:33,768 INFO L290 TraceCheckUtils]: 3: Hoare triple {2265#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(foo_~i~0#1 <= foo_~size#1); {2265#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:33,769 INFO L290 TraceCheckUtils]: 4: Hoare triple {2265#(= |ULTIMATE.start_main_~i~1#1| 0)} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {2265#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:33,769 INFO L290 TraceCheckUtils]: 5: Hoare triple {2265#(= |ULTIMATE.start_main_~i~1#1| 0)} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {2265#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:33,769 INFO L290 TraceCheckUtils]: 6: Hoare triple {2265#(= |ULTIMATE.start_main_~i~1#1| 0)} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {2265#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:33,769 INFO L290 TraceCheckUtils]: 7: Hoare triple {2265#(= |ULTIMATE.start_main_~i~1#1| 0)} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {2265#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:33,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {2265#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !(foo_~i~0#1 <= foo_~size#1); {2265#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:33,770 INFO L290 TraceCheckUtils]: 9: Hoare triple {2265#(= |ULTIMATE.start_main_~i~1#1| 0)} foo_#res#1 := foo_~i~0#1; {2265#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:33,770 INFO L290 TraceCheckUtils]: 10: Hoare triple {2265#(= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {2265#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:33,771 INFO L290 TraceCheckUtils]: 11: Hoare triple {2265#(= |ULTIMATE.start_main_~i~1#1| 0)} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {2265#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:33,771 INFO L290 TraceCheckUtils]: 12: Hoare triple {2265#(= |ULTIMATE.start_main_~i~1#1| 0)} havoc main_#t~ret3#1; {2265#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:33,771 INFO L290 TraceCheckUtils]: 13: Hoare triple {2265#(= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2266#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (not (<= (+ (div |ULTIMATE.start_main_~i~1#1| 4294967296) 1) 0)))} is VALID [2022-02-20 23:49:33,772 INFO L290 TraceCheckUtils]: 14: Hoare triple {2266#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (not (<= (+ (div |ULTIMATE.start_main_~i~1#1| 4294967296) 1) 0)))} assume !(main_~i~1#1 % 4294967296 < 32); {2264#false} is VALID [2022-02-20 23:49:33,772 INFO L290 TraceCheckUtils]: 15: Hoare triple {2264#false} main_~i~1#1 := 0; {2264#false} is VALID [2022-02-20 23:49:33,772 INFO L290 TraceCheckUtils]: 16: Hoare triple {2264#false} assume !!(main_~i~1#1 % 4294967296 < 32); {2264#false} is VALID [2022-02-20 23:49:33,772 INFO L290 TraceCheckUtils]: 17: Hoare triple {2264#false} SUMMARY for call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L30 {2264#false} is VALID [2022-02-20 23:49:33,772 INFO L290 TraceCheckUtils]: 18: Hoare triple {2264#false} assume main_#t~mem5#1 != main_~i~1#1;havoc main_#t~mem5#1; {2264#false} is VALID [2022-02-20 23:49:33,773 INFO L290 TraceCheckUtils]: 19: Hoare triple {2264#false} main_#res#1 := 1;call ULTIMATE.dealloc(main_~#b~0#1.base, main_~#b~0#1.offset);havoc main_~#b~0#1.base, main_~#b~0#1.offset;call ULTIMATE.dealloc(main_~#mask~0#1.base, main_~#mask~0#1.offset);havoc main_~#mask~0#1.base, main_~#mask~0#1.offset; {2264#false} is VALID [2022-02-20 23:49:33,773 INFO L290 TraceCheckUtils]: 20: Hoare triple {2264#false} assume !(#valid == main_old_#valid#1); {2264#false} is VALID [2022-02-20 23:49:33,773 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 23:49:33,773 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:49:33,773 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857058177] [2022-02-20 23:49:33,773 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857058177] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:49:33,773 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56135225] [2022-02-20 23:49:33,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:33,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:49:33,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:49:33,788 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 23:49:33,804 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 23:49:33,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:33,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 23:49:33,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:33,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:49:34,272 INFO L290 TraceCheckUtils]: 0: Hoare triple {2263#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2263#true} is VALID [2022-02-20 23:49:34,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {2263#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(128);call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; {2273#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_104 Int) (v_ArrVal_103 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_103) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_104) |#valid|)) (exists ((v_ArrVal_102 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_102) |ULTIMATE.start_main_~#mask~0#1.base|) 0)))} is VALID [2022-02-20 23:49:34,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {2273#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_104 Int) (v_ArrVal_103 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_103) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_104) |#valid|)) (exists ((v_ArrVal_102 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_102) |ULTIMATE.start_main_~#mask~0#1.base|) 0)))} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {2273#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_104 Int) (v_ArrVal_103 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_103) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_104) |#valid|)) (exists ((v_ArrVal_102 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_102) |ULTIMATE.start_main_~#mask~0#1.base|) 0)))} is VALID [2022-02-20 23:49:34,275 INFO L290 TraceCheckUtils]: 3: Hoare triple {2273#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_104 Int) (v_ArrVal_103 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_103) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_104) |#valid|)) (exists ((v_ArrVal_102 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_102) |ULTIMATE.start_main_~#mask~0#1.base|) 0)))} assume !!(foo_~i~0#1 <= foo_~size#1); {2273#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_104 Int) (v_ArrVal_103 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_103) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_104) |#valid|)) (exists ((v_ArrVal_102 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_102) |ULTIMATE.start_main_~#mask~0#1.base|) 0)))} is VALID [2022-02-20 23:49:34,276 INFO L290 TraceCheckUtils]: 4: Hoare triple {2273#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_104 Int) (v_ArrVal_103 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_103) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_104) |#valid|)) (exists ((v_ArrVal_102 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_102) |ULTIMATE.start_main_~#mask~0#1.base|) 0)))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {2273#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_104 Int) (v_ArrVal_103 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_103) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_104) |#valid|)) (exists ((v_ArrVal_102 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_102) |ULTIMATE.start_main_~#mask~0#1.base|) 0)))} is VALID [2022-02-20 23:49:34,277 INFO L290 TraceCheckUtils]: 5: Hoare triple {2273#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_104 Int) (v_ArrVal_103 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_103) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_104) |#valid|)) (exists ((v_ArrVal_102 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_102) |ULTIMATE.start_main_~#mask~0#1.base|) 0)))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {2273#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_104 Int) (v_ArrVal_103 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_103) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_104) |#valid|)) (exists ((v_ArrVal_102 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_102) |ULTIMATE.start_main_~#mask~0#1.base|) 0)))} is VALID [2022-02-20 23:49:34,278 INFO L290 TraceCheckUtils]: 6: Hoare triple {2273#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_104 Int) (v_ArrVal_103 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_103) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_104) |#valid|)) (exists ((v_ArrVal_102 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_102) |ULTIMATE.start_main_~#mask~0#1.base|) 0)))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {2273#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_104 Int) (v_ArrVal_103 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_103) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_104) |#valid|)) (exists ((v_ArrVal_102 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_102) |ULTIMATE.start_main_~#mask~0#1.base|) 0)))} is VALID [2022-02-20 23:49:34,278 INFO L290 TraceCheckUtils]: 7: Hoare triple {2273#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_104 Int) (v_ArrVal_103 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_103) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_104) |#valid|)) (exists ((v_ArrVal_102 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_102) |ULTIMATE.start_main_~#mask~0#1.base|) 0)))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {2273#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_104 Int) (v_ArrVal_103 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_103) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_104) |#valid|)) (exists ((v_ArrVal_102 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_102) |ULTIMATE.start_main_~#mask~0#1.base|) 0)))} is VALID [2022-02-20 23:49:34,279 INFO L290 TraceCheckUtils]: 8: Hoare triple {2273#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_104 Int) (v_ArrVal_103 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_103) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_104) |#valid|)) (exists ((v_ArrVal_102 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_102) |ULTIMATE.start_main_~#mask~0#1.base|) 0)))} assume !(foo_~i~0#1 <= foo_~size#1); {2273#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_104 Int) (v_ArrVal_103 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_103) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_104) |#valid|)) (exists ((v_ArrVal_102 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_102) |ULTIMATE.start_main_~#mask~0#1.base|) 0)))} is VALID [2022-02-20 23:49:34,280 INFO L290 TraceCheckUtils]: 9: Hoare triple {2273#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_104 Int) (v_ArrVal_103 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_103) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_104) |#valid|)) (exists ((v_ArrVal_102 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_102) |ULTIMATE.start_main_~#mask~0#1.base|) 0)))} foo_#res#1 := foo_~i~0#1; {2273#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_104 Int) (v_ArrVal_103 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_103) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_104) |#valid|)) (exists ((v_ArrVal_102 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_102) |ULTIMATE.start_main_~#mask~0#1.base|) 0)))} is VALID [2022-02-20 23:49:34,280 INFO L290 TraceCheckUtils]: 10: Hoare triple {2273#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_104 Int) (v_ArrVal_103 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_103) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_104) |#valid|)) (exists ((v_ArrVal_102 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_102) |ULTIMATE.start_main_~#mask~0#1.base|) 0)))} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {2273#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_104 Int) (v_ArrVal_103 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_103) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_104) |#valid|)) (exists ((v_ArrVal_102 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_102) |ULTIMATE.start_main_~#mask~0#1.base|) 0)))} is VALID [2022-02-20 23:49:34,281 INFO L290 TraceCheckUtils]: 11: Hoare triple {2273#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_104 Int) (v_ArrVal_103 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_103) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_104) |#valid|)) (exists ((v_ArrVal_102 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_102) |ULTIMATE.start_main_~#mask~0#1.base|) 0)))} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {2273#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_104 Int) (v_ArrVal_103 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_103) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_104) |#valid|)) (exists ((v_ArrVal_102 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_102) |ULTIMATE.start_main_~#mask~0#1.base|) 0)))} is VALID [2022-02-20 23:49:34,282 INFO L290 TraceCheckUtils]: 12: Hoare triple {2273#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_104 Int) (v_ArrVal_103 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_103) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_104) |#valid|)) (exists ((v_ArrVal_102 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_102) |ULTIMATE.start_main_~#mask~0#1.base|) 0)))} havoc main_#t~ret3#1; {2273#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_104 Int) (v_ArrVal_103 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_103) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_104) |#valid|)) (exists ((v_ArrVal_102 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_102) |ULTIMATE.start_main_~#mask~0#1.base|) 0)))} is VALID [2022-02-20 23:49:34,283 INFO L290 TraceCheckUtils]: 13: Hoare triple {2273#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_104 Int) (v_ArrVal_103 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_103) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_104) |#valid|)) (exists ((v_ArrVal_102 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_102) |ULTIMATE.start_main_~#mask~0#1.base|) 0)))} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2273#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_104 Int) (v_ArrVal_103 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_103) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_104) |#valid|)) (exists ((v_ArrVal_102 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_102) |ULTIMATE.start_main_~#mask~0#1.base|) 0)))} is VALID [2022-02-20 23:49:34,283 INFO L290 TraceCheckUtils]: 14: Hoare triple {2273#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_104 Int) (v_ArrVal_103 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_103) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_104) |#valid|)) (exists ((v_ArrVal_102 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_102) |ULTIMATE.start_main_~#mask~0#1.base|) 0)))} assume !(main_~i~1#1 % 4294967296 < 32); {2273#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_104 Int) (v_ArrVal_103 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_103) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_104) |#valid|)) (exists ((v_ArrVal_102 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_102) |ULTIMATE.start_main_~#mask~0#1.base|) 0)))} is VALID [2022-02-20 23:49:34,284 INFO L290 TraceCheckUtils]: 15: Hoare triple {2273#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_104 Int) (v_ArrVal_103 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_103) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_104) |#valid|)) (exists ((v_ArrVal_102 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_102) |ULTIMATE.start_main_~#mask~0#1.base|) 0)))} main_~i~1#1 := 0; {2273#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_104 Int) (v_ArrVal_103 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_103) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_104) |#valid|)) (exists ((v_ArrVal_102 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_102) |ULTIMATE.start_main_~#mask~0#1.base|) 0)))} is VALID [2022-02-20 23:49:34,285 INFO L290 TraceCheckUtils]: 16: Hoare triple {2273#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_104 Int) (v_ArrVal_103 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_103) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_104) |#valid|)) (exists ((v_ArrVal_102 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_102) |ULTIMATE.start_main_~#mask~0#1.base|) 0)))} assume !!(main_~i~1#1 % 4294967296 < 32); {2273#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_104 Int) (v_ArrVal_103 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_103) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_104) |#valid|)) (exists ((v_ArrVal_102 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_102) |ULTIMATE.start_main_~#mask~0#1.base|) 0)))} is VALID [2022-02-20 23:49:34,286 INFO L290 TraceCheckUtils]: 17: Hoare triple {2273#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_104 Int) (v_ArrVal_103 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_103) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_104) |#valid|)) (exists ((v_ArrVal_102 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_102) |ULTIMATE.start_main_~#mask~0#1.base|) 0)))} SUMMARY for call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L30 {2273#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_104 Int) (v_ArrVal_103 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_103) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_104) |#valid|)) (exists ((v_ArrVal_102 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_102) |ULTIMATE.start_main_~#mask~0#1.base|) 0)))} is VALID [2022-02-20 23:49:34,286 INFO L290 TraceCheckUtils]: 18: Hoare triple {2273#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_104 Int) (v_ArrVal_103 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_103) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_104) |#valid|)) (exists ((v_ArrVal_102 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_102) |ULTIMATE.start_main_~#mask~0#1.base|) 0)))} assume main_#t~mem5#1 != main_~i~1#1;havoc main_#t~mem5#1; {2273#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_104 Int) (v_ArrVal_103 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_103) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_104) |#valid|)) (exists ((v_ArrVal_102 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_102) |ULTIMATE.start_main_~#mask~0#1.base|) 0)))} is VALID [2022-02-20 23:49:34,287 INFO L290 TraceCheckUtils]: 19: Hoare triple {2273#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_104 Int) (v_ArrVal_103 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_103) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_104) |#valid|)) (exists ((v_ArrVal_102 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_102) |ULTIMATE.start_main_~#mask~0#1.base|) 0)))} main_#res#1 := 1;call ULTIMATE.dealloc(main_~#b~0#1.base, main_~#b~0#1.offset);havoc main_~#b~0#1.base, main_~#b~0#1.offset;call ULTIMATE.dealloc(main_~#mask~0#1.base, main_~#mask~0#1.offset);havoc main_~#mask~0#1.base, main_~#mask~0#1.offset; {2328#(exists ((v_ArrVal_104 Int) (v_ArrVal_103 Int) (v_ArrVal_102 Int) (|v_ULTIMATE.start_main_~#b~0#1.base_15| Int) (|v_ULTIMATE.start_main_~#mask~0#1.base_10| Int)) (and (= (select (store |ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#b~0#1.base_15| v_ArrVal_102) |v_ULTIMATE.start_main_~#mask~0#1.base_10|) 0) (= (store (store (store (store |ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#b~0#1.base_15| v_ArrVal_103) |v_ULTIMATE.start_main_~#mask~0#1.base_10| v_ArrVal_104) |v_ULTIMATE.start_main_~#b~0#1.base_15| 0) |v_ULTIMATE.start_main_~#mask~0#1.base_10| 0) |#valid|) (= (select |ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#b~0#1.base_15|) 0)))} is VALID [2022-02-20 23:49:34,288 INFO L290 TraceCheckUtils]: 20: Hoare triple {2328#(exists ((v_ArrVal_104 Int) (v_ArrVal_103 Int) (v_ArrVal_102 Int) (|v_ULTIMATE.start_main_~#b~0#1.base_15| Int) (|v_ULTIMATE.start_main_~#mask~0#1.base_10| Int)) (and (= (select (store |ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#b~0#1.base_15| v_ArrVal_102) |v_ULTIMATE.start_main_~#mask~0#1.base_10|) 0) (= (store (store (store (store |ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#b~0#1.base_15| v_ArrVal_103) |v_ULTIMATE.start_main_~#mask~0#1.base_10| v_ArrVal_104) |v_ULTIMATE.start_main_~#b~0#1.base_15| 0) |v_ULTIMATE.start_main_~#mask~0#1.base_10| 0) |#valid|) (= (select |ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#b~0#1.base_15|) 0)))} assume !(#valid == main_old_#valid#1); {2264#false} is VALID [2022-02-20 23:49:34,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:49:34,289 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:49:34,289 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56135225] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:49:34,289 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:49:34,289 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-02-20 23:49:34,289 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221942262] [2022-02-20 23:49:34,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:49:34,290 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 23:49:34,290 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:34,290 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:34,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:34,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:49:34,310 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:34,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:49:34,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:49:34,311 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:34,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:34,343 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2022-02-20 23:49:34,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:49:34,343 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 23:49:34,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:34,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:34,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-02-20 23:49:34,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:34,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-02-20 23:49:34,345 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 30 transitions. [2022-02-20 23:49:34,372 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:34,372 INFO L225 Difference]: With dead ends: 45 [2022-02-20 23:49:34,372 INFO L226 Difference]: Without dead ends: 43 [2022-02-20 23:49:34,373 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:49:34,373 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 5 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:34,373 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 39 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 13 Unchecked, 0.0s Time] [2022-02-20 23:49:34,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-02-20 23:49:34,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-02-20 23:49:34,375 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:34,375 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 42 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:34,375 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 42 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:34,375 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 42 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:34,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:34,375 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2022-02-20 23:49:34,375 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2022-02-20 23:49:34,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:34,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:34,376 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 42 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 43 states. [2022-02-20 23:49:34,376 INFO L87 Difference]: Start difference. First operand has 43 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 42 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 43 states. [2022-02-20 23:49:34,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:34,377 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2022-02-20 23:49:34,377 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2022-02-20 23:49:34,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:34,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:34,377 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:34,377 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:34,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 42 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:34,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2022-02-20 23:49:34,378 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 21 [2022-02-20 23:49:34,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:34,378 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2022-02-20 23:49:34,378 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:34,378 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2022-02-20 23:49:34,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:49:34,379 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:34,379 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:34,395 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 23:49:34,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:49:34,595 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2022-02-20 23:49:34,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:34,596 INFO L85 PathProgramCache]: Analyzing trace with hash -9763705, now seen corresponding path program 1 times [2022-02-20 23:49:34,596 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:34,596 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092666119] [2022-02-20 23:49:34,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:34,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:34,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:34,636 INFO L290 TraceCheckUtils]: 0: Hoare triple {2505#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2505#true} is VALID [2022-02-20 23:49:34,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {2505#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(128);call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; {2507#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:34,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {2507#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {2507#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:34,637 INFO L290 TraceCheckUtils]: 3: Hoare triple {2507#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(foo_~i~0#1 <= foo_~size#1); {2507#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:34,638 INFO L290 TraceCheckUtils]: 4: Hoare triple {2507#(= |ULTIMATE.start_main_~i~1#1| 0)} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {2507#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:34,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {2507#(= |ULTIMATE.start_main_~i~1#1| 0)} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {2507#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:34,638 INFO L290 TraceCheckUtils]: 6: Hoare triple {2507#(= |ULTIMATE.start_main_~i~1#1| 0)} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {2507#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:34,639 INFO L290 TraceCheckUtils]: 7: Hoare triple {2507#(= |ULTIMATE.start_main_~i~1#1| 0)} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {2507#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:34,639 INFO L290 TraceCheckUtils]: 8: Hoare triple {2507#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !(foo_~i~0#1 <= foo_~size#1); {2507#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:34,639 INFO L290 TraceCheckUtils]: 9: Hoare triple {2507#(= |ULTIMATE.start_main_~i~1#1| 0)} foo_#res#1 := foo_~i~0#1; {2507#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:34,640 INFO L290 TraceCheckUtils]: 10: Hoare triple {2507#(= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {2507#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:34,640 INFO L290 TraceCheckUtils]: 11: Hoare triple {2507#(= |ULTIMATE.start_main_~i~1#1| 0)} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {2507#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:34,640 INFO L290 TraceCheckUtils]: 12: Hoare triple {2507#(= |ULTIMATE.start_main_~i~1#1| 0)} havoc main_#t~ret3#1; {2507#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:34,641 INFO L290 TraceCheckUtils]: 13: Hoare triple {2507#(= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2508#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (not (<= (+ (div |ULTIMATE.start_main_~i~1#1| 4294967296) 1) 0)))} is VALID [2022-02-20 23:49:34,641 INFO L290 TraceCheckUtils]: 14: Hoare triple {2508#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (not (<= (+ (div |ULTIMATE.start_main_~i~1#1| 4294967296) 1) 0)))} assume !(main_~i~1#1 % 4294967296 < 32); {2506#false} is VALID [2022-02-20 23:49:34,641 INFO L290 TraceCheckUtils]: 15: Hoare triple {2506#false} main_~i~1#1 := 0; {2506#false} is VALID [2022-02-20 23:49:34,641 INFO L290 TraceCheckUtils]: 16: Hoare triple {2506#false} assume !!(main_~i~1#1 % 4294967296 < 32); {2506#false} is VALID [2022-02-20 23:49:34,642 INFO L290 TraceCheckUtils]: 17: Hoare triple {2506#false} SUMMARY for call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L30 {2506#false} is VALID [2022-02-20 23:49:34,642 INFO L290 TraceCheckUtils]: 18: Hoare triple {2506#false} assume !(main_#t~mem5#1 != main_~i~1#1);havoc main_#t~mem5#1; {2506#false} is VALID [2022-02-20 23:49:34,642 INFO L290 TraceCheckUtils]: 19: Hoare triple {2506#false} main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2506#false} is VALID [2022-02-20 23:49:34,642 INFO L290 TraceCheckUtils]: 20: Hoare triple {2506#false} assume !!(main_~i~1#1 % 4294967296 < 32); {2506#false} is VALID [2022-02-20 23:49:34,642 INFO L290 TraceCheckUtils]: 21: Hoare triple {2506#false} assume !(4 + (main_~#b~0#1.offset + 4 * main_~i~1#1) <= #length[main_~#b~0#1.base] && 0 <= main_~#b~0#1.offset + 4 * main_~i~1#1); {2506#false} is VALID [2022-02-20 23:49:34,642 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 23:49:34,643 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:49:34,643 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092666119] [2022-02-20 23:49:34,643 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092666119] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:49:34,643 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526366111] [2022-02-20 23:49:34,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:34,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:49:34,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:49:34,656 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 23:49:34,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-20 23:49:34,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:34,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 22 conjunts are in the unsatisfiable core [2022-02-20 23:49:34,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:34,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:49:34,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:49:34,935 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:49:34,936 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:49:34,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2022-02-20 23:49:34,949 INFO L290 TraceCheckUtils]: 0: Hoare triple {2505#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2505#true} is VALID [2022-02-20 23:49:34,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {2505#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(128);call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; {2515#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0))} is VALID [2022-02-20 23:49:34,950 INFO L290 TraceCheckUtils]: 2: Hoare triple {2515#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0))} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {2519#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:49:34,951 INFO L290 TraceCheckUtils]: 3: Hoare triple {2519#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} assume !!(foo_~i~0#1 <= foo_~size#1); {2519#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:49:34,951 INFO L290 TraceCheckUtils]: 4: Hoare triple {2519#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {2519#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:49:34,952 INFO L290 TraceCheckUtils]: 5: Hoare triple {2519#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {2519#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:49:34,952 INFO L290 TraceCheckUtils]: 6: Hoare triple {2519#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {2519#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:49:34,953 INFO L290 TraceCheckUtils]: 7: Hoare triple {2519#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {2535#(and (= (+ (- 1) |ULTIMATE.start_foo_~i~0#1|) 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0))} is VALID [2022-02-20 23:49:34,953 INFO L290 TraceCheckUtils]: 8: Hoare triple {2535#(and (= (+ (- 1) |ULTIMATE.start_foo_~i~0#1|) 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0))} assume !(foo_~i~0#1 <= foo_~size#1); {2535#(and (= (+ (- 1) |ULTIMATE.start_foo_~i~0#1|) 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0))} is VALID [2022-02-20 23:49:34,953 INFO L290 TraceCheckUtils]: 9: Hoare triple {2535#(and (= (+ (- 1) |ULTIMATE.start_foo_~i~0#1|) 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0))} foo_#res#1 := foo_~i~0#1; {2542#(and (= |ULTIMATE.start_foo_#res#1| 1) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0))} is VALID [2022-02-20 23:49:34,954 INFO L290 TraceCheckUtils]: 10: Hoare triple {2542#(and (= |ULTIMATE.start_foo_#res#1| 1) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0))} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {2546#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (= |ULTIMATE.start_main_#t~ret3#1| 1))} is VALID [2022-02-20 23:49:34,954 INFO L290 TraceCheckUtils]: 11: Hoare triple {2546#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (= |ULTIMATE.start_main_#t~ret3#1| 1))} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {2550#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|) 1))} is VALID [2022-02-20 23:49:34,955 INFO L290 TraceCheckUtils]: 12: Hoare triple {2550#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|) 1))} havoc main_#t~ret3#1; {2550#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|) 1))} is VALID [2022-02-20 23:49:34,955 INFO L290 TraceCheckUtils]: 13: Hoare triple {2550#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|) 1))} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2550#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|) 1))} is VALID [2022-02-20 23:49:34,956 INFO L290 TraceCheckUtils]: 14: Hoare triple {2550#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|) 1))} assume !(main_~i~1#1 % 4294967296 < 32); {2550#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|) 1))} is VALID [2022-02-20 23:49:34,956 INFO L290 TraceCheckUtils]: 15: Hoare triple {2550#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|) 1))} main_~i~1#1 := 0; {2563#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|) 1))} is VALID [2022-02-20 23:49:34,956 INFO L290 TraceCheckUtils]: 16: Hoare triple {2563#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|) 1))} assume !!(main_~i~1#1 % 4294967296 < 32); {2563#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|) 1))} is VALID [2022-02-20 23:49:34,957 INFO L290 TraceCheckUtils]: 17: Hoare triple {2563#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|) 1))} SUMMARY for call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L30 {2570#(and (= |ULTIMATE.start_main_~i~1#1| 0) (= |ULTIMATE.start_main_#t~mem5#1| 1))} is VALID [2022-02-20 23:49:34,957 INFO L290 TraceCheckUtils]: 18: Hoare triple {2570#(and (= |ULTIMATE.start_main_~i~1#1| 0) (= |ULTIMATE.start_main_#t~mem5#1| 1))} assume !(main_#t~mem5#1 != main_~i~1#1);havoc main_#t~mem5#1; {2506#false} is VALID [2022-02-20 23:49:34,957 INFO L290 TraceCheckUtils]: 19: Hoare triple {2506#false} main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2506#false} is VALID [2022-02-20 23:49:34,958 INFO L290 TraceCheckUtils]: 20: Hoare triple {2506#false} assume !!(main_~i~1#1 % 4294967296 < 32); {2506#false} is VALID [2022-02-20 23:49:34,958 INFO L290 TraceCheckUtils]: 21: Hoare triple {2506#false} assume !(4 + (main_~#b~0#1.offset + 4 * main_~i~1#1) <= #length[main_~#b~0#1.base] && 0 <= main_~#b~0#1.offset + 4 * main_~i~1#1); {2506#false} is VALID [2022-02-20 23:49:34,958 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:49:34,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:49:35,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2022-02-20 23:49:35,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2022-02-20 23:49:35,121 INFO L290 TraceCheckUtils]: 21: Hoare triple {2506#false} assume !(4 + (main_~#b~0#1.offset + 4 * main_~i~1#1) <= #length[main_~#b~0#1.base] && 0 <= main_~#b~0#1.offset + 4 * main_~i~1#1); {2506#false} is VALID [2022-02-20 23:49:35,122 INFO L290 TraceCheckUtils]: 20: Hoare triple {2506#false} assume !!(main_~i~1#1 % 4294967296 < 32); {2506#false} is VALID [2022-02-20 23:49:35,122 INFO L290 TraceCheckUtils]: 19: Hoare triple {2506#false} main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2506#false} is VALID [2022-02-20 23:49:35,122 INFO L290 TraceCheckUtils]: 18: Hoare triple {2592#(not (= |ULTIMATE.start_main_#t~mem5#1| |ULTIMATE.start_main_~i~1#1|))} assume !(main_#t~mem5#1 != main_~i~1#1);havoc main_#t~mem5#1; {2506#false} is VALID [2022-02-20 23:49:35,123 INFO L290 TraceCheckUtils]: 17: Hoare triple {2596#(not (= |ULTIMATE.start_main_~i~1#1| (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4)))))} SUMMARY for call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L30 {2592#(not (= |ULTIMATE.start_main_#t~mem5#1| |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:35,123 INFO L290 TraceCheckUtils]: 16: Hoare triple {2596#(not (= |ULTIMATE.start_main_~i~1#1| (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4)))))} assume !!(main_~i~1#1 % 4294967296 < 32); {2596#(not (= |ULTIMATE.start_main_~i~1#1| (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4)))))} is VALID [2022-02-20 23:49:35,124 INFO L290 TraceCheckUtils]: 15: Hoare triple {2603#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|) 0))} main_~i~1#1 := 0; {2596#(not (= |ULTIMATE.start_main_~i~1#1| (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4)))))} is VALID [2022-02-20 23:49:35,124 INFO L290 TraceCheckUtils]: 14: Hoare triple {2603#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|) 0))} assume !(main_~i~1#1 % 4294967296 < 32); {2603#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|) 0))} is VALID [2022-02-20 23:49:35,124 INFO L290 TraceCheckUtils]: 13: Hoare triple {2603#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|) 0))} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2603#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|) 0))} is VALID [2022-02-20 23:49:35,125 INFO L290 TraceCheckUtils]: 12: Hoare triple {2603#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|) 0))} havoc main_#t~ret3#1; {2603#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|) 0))} is VALID [2022-02-20 23:49:35,126 INFO L290 TraceCheckUtils]: 11: Hoare triple {2616#(and (not (= |ULTIMATE.start_main_#t~ret3#1| 0)) (= (* |ULTIMATE.start_main_~i~1#1| 4) 0))} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {2603#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|) 0))} is VALID [2022-02-20 23:49:35,126 INFO L290 TraceCheckUtils]: 10: Hoare triple {2620#(and (not (= |ULTIMATE.start_foo_#res#1| 0)) (= (* |ULTIMATE.start_main_~i~1#1| 4) 0))} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {2616#(and (not (= |ULTIMATE.start_main_#t~ret3#1| 0)) (= (* |ULTIMATE.start_main_~i~1#1| 4) 0))} is VALID [2022-02-20 23:49:35,127 INFO L290 TraceCheckUtils]: 9: Hoare triple {2624#(and (not (= |ULTIMATE.start_foo_~i~0#1| 0)) (= (* |ULTIMATE.start_main_~i~1#1| 4) 0))} foo_#res#1 := foo_~i~0#1; {2620#(and (not (= |ULTIMATE.start_foo_#res#1| 0)) (= (* |ULTIMATE.start_main_~i~1#1| 4) 0))} is VALID [2022-02-20 23:49:35,127 INFO L290 TraceCheckUtils]: 8: Hoare triple {2624#(and (not (= |ULTIMATE.start_foo_~i~0#1| 0)) (= (* |ULTIMATE.start_main_~i~1#1| 4) 0))} assume !(foo_~i~0#1 <= foo_~size#1); {2624#(and (not (= |ULTIMATE.start_foo_~i~0#1| 0)) (= (* |ULTIMATE.start_main_~i~1#1| 4) 0))} is VALID [2022-02-20 23:49:35,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {2631#(and (not (= (+ |ULTIMATE.start_foo_~i~0#1| 1) 0)) (= (* |ULTIMATE.start_main_~i~1#1| 4) 0))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {2624#(and (not (= |ULTIMATE.start_foo_~i~0#1| 0)) (= (* |ULTIMATE.start_main_~i~1#1| 4) 0))} is VALID [2022-02-20 23:49:35,128 INFO L290 TraceCheckUtils]: 6: Hoare triple {2631#(and (not (= (+ |ULTIMATE.start_foo_~i~0#1| 1) 0)) (= (* |ULTIMATE.start_main_~i~1#1| 4) 0))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {2631#(and (not (= (+ |ULTIMATE.start_foo_~i~0#1| 1) 0)) (= (* |ULTIMATE.start_main_~i~1#1| 4) 0))} is VALID [2022-02-20 23:49:35,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {2631#(and (not (= (+ |ULTIMATE.start_foo_~i~0#1| 1) 0)) (= (* |ULTIMATE.start_main_~i~1#1| 4) 0))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {2631#(and (not (= (+ |ULTIMATE.start_foo_~i~0#1| 1) 0)) (= (* |ULTIMATE.start_main_~i~1#1| 4) 0))} is VALID [2022-02-20 23:49:35,129 INFO L290 TraceCheckUtils]: 4: Hoare triple {2631#(and (not (= (+ |ULTIMATE.start_foo_~i~0#1| 1) 0)) (= (* |ULTIMATE.start_main_~i~1#1| 4) 0))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {2631#(and (not (= (+ |ULTIMATE.start_foo_~i~0#1| 1) 0)) (= (* |ULTIMATE.start_main_~i~1#1| 4) 0))} is VALID [2022-02-20 23:49:35,129 INFO L290 TraceCheckUtils]: 3: Hoare triple {2631#(and (not (= (+ |ULTIMATE.start_foo_~i~0#1| 1) 0)) (= (* |ULTIMATE.start_main_~i~1#1| 4) 0))} assume !!(foo_~i~0#1 <= foo_~size#1); {2631#(and (not (= (+ |ULTIMATE.start_foo_~i~0#1| 1) 0)) (= (* |ULTIMATE.start_main_~i~1#1| 4) 0))} is VALID [2022-02-20 23:49:35,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {2507#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {2631#(and (not (= (+ |ULTIMATE.start_foo_~i~0#1| 1) 0)) (= (* |ULTIMATE.start_main_~i~1#1| 4) 0))} is VALID [2022-02-20 23:49:35,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {2505#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(128);call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; {2507#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:35,130 INFO L290 TraceCheckUtils]: 0: Hoare triple {2505#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2505#true} is VALID [2022-02-20 23:49:35,132 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:49:35,132 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526366111] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:49:35,132 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:49:35,132 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 10, 10] total 19 [2022-02-20 23:49:35,134 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907184232] [2022-02-20 23:49:35,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:49:35,135 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-20 23:49:35,136 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:35,136 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:35,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:35,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-20 23:49:35,179 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:35,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-20 23:49:35,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-02-20 23:49:35,180 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:35,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:35,800 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2022-02-20 23:49:35,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 23:49:35,801 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-20 23:49:35,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:35,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:35,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 65 transitions. [2022-02-20 23:49:35,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:35,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 65 transitions. [2022-02-20 23:49:35,802 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 65 transitions. [2022-02-20 23:49:35,860 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 23:49:35,860 INFO L225 Difference]: With dead ends: 72 [2022-02-20 23:49:35,860 INFO L226 Difference]: Without dead ends: 72 [2022-02-20 23:49:35,861 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=414, Unknown=0, NotChecked=0, Total=552 [2022-02-20 23:49:35,861 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 55 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:35,861 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 132 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:49:35,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-02-20 23:49:35,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 49. [2022-02-20 23:49:35,863 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:35,863 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 49 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 48 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:35,863 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 49 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 48 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:35,863 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 49 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 48 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:35,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:35,864 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2022-02-20 23:49:35,864 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2022-02-20 23:49:35,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:35,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:35,864 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 48 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 72 states. [2022-02-20 23:49:35,864 INFO L87 Difference]: Start difference. First operand has 49 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 48 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 72 states. [2022-02-20 23:49:35,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:35,865 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2022-02-20 23:49:35,865 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2022-02-20 23:49:35,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:35,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:35,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:35,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:35,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 48 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:35,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2022-02-20 23:49:35,867 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 22 [2022-02-20 23:49:35,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:35,867 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2022-02-20 23:49:35,867 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:35,867 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2022-02-20 23:49:35,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:49:35,867 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:35,868 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:35,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-20 23:49:36,076 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-02-20 23:49:36,076 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2022-02-20 23:49:36,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:36,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1532050453, now seen corresponding path program 1 times [2022-02-20 23:49:36,077 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:36,077 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411451085] [2022-02-20 23:49:36,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:36,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:36,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:36,118 INFO L290 TraceCheckUtils]: 0: Hoare triple {2927#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2927#true} is VALID [2022-02-20 23:49:36,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {2927#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(128);call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; {2927#true} is VALID [2022-02-20 23:49:36,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {2927#true} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {2927#true} is VALID [2022-02-20 23:49:36,118 INFO L290 TraceCheckUtils]: 3: Hoare triple {2927#true} assume !!(foo_~i~0#1 <= foo_~size#1); {2927#true} is VALID [2022-02-20 23:49:36,118 INFO L290 TraceCheckUtils]: 4: Hoare triple {2927#true} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {2927#true} is VALID [2022-02-20 23:49:36,119 INFO L290 TraceCheckUtils]: 5: Hoare triple {2927#true} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {2927#true} is VALID [2022-02-20 23:49:36,119 INFO L290 TraceCheckUtils]: 6: Hoare triple {2927#true} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {2927#true} is VALID [2022-02-20 23:49:36,119 INFO L290 TraceCheckUtils]: 7: Hoare triple {2927#true} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {2927#true} is VALID [2022-02-20 23:49:36,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {2927#true} assume !(foo_~i~0#1 <= foo_~size#1); {2927#true} is VALID [2022-02-20 23:49:36,119 INFO L290 TraceCheckUtils]: 9: Hoare triple {2927#true} foo_#res#1 := foo_~i~0#1; {2927#true} is VALID [2022-02-20 23:49:36,119 INFO L290 TraceCheckUtils]: 10: Hoare triple {2927#true} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {2927#true} is VALID [2022-02-20 23:49:36,119 INFO L290 TraceCheckUtils]: 11: Hoare triple {2927#true} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {2927#true} is VALID [2022-02-20 23:49:36,120 INFO L290 TraceCheckUtils]: 12: Hoare triple {2927#true} havoc main_#t~ret3#1; {2927#true} is VALID [2022-02-20 23:49:36,120 INFO L290 TraceCheckUtils]: 13: Hoare triple {2927#true} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2927#true} is VALID [2022-02-20 23:49:36,120 INFO L290 TraceCheckUtils]: 14: Hoare triple {2927#true} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {2929#(= |ULTIMATE.start_foo_~i~0#1| 0)} is VALID [2022-02-20 23:49:36,120 INFO L290 TraceCheckUtils]: 15: Hoare triple {2929#(= |ULTIMATE.start_foo_~i~0#1| 0)} assume !!(foo_~i~0#1 <= foo_~size#1); {2929#(= |ULTIMATE.start_foo_~i~0#1| 0)} is VALID [2022-02-20 23:49:36,121 INFO L290 TraceCheckUtils]: 16: Hoare triple {2929#(= |ULTIMATE.start_foo_~i~0#1| 0)} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {2929#(= |ULTIMATE.start_foo_~i~0#1| 0)} is VALID [2022-02-20 23:49:36,121 INFO L290 TraceCheckUtils]: 17: Hoare triple {2929#(= |ULTIMATE.start_foo_~i~0#1| 0)} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {2929#(= |ULTIMATE.start_foo_~i~0#1| 0)} is VALID [2022-02-20 23:49:36,121 INFO L290 TraceCheckUtils]: 18: Hoare triple {2929#(= |ULTIMATE.start_foo_~i~0#1| 0)} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {2929#(= |ULTIMATE.start_foo_~i~0#1| 0)} is VALID [2022-02-20 23:49:36,122 INFO L290 TraceCheckUtils]: 19: Hoare triple {2929#(= |ULTIMATE.start_foo_~i~0#1| 0)} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {2930#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:49:36,122 INFO L290 TraceCheckUtils]: 20: Hoare triple {2930#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} assume !!(foo_~i~0#1 <= foo_~size#1); {2930#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:49:36,122 INFO L290 TraceCheckUtils]: 21: Hoare triple {2930#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} assume !(0 <= foo_~i~0#1 && foo_~i~0#1 < 32); {2928#false} is VALID [2022-02-20 23:49:36,123 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:49:36,123 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:49:36,123 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411451085] [2022-02-20 23:49:36,123 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411451085] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:49:36,123 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139617280] [2022-02-20 23:49:36,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:36,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:49:36,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:49:36,125 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:49:36,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-20 23:49:36,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:36,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:49:36,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:36,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:49:36,214 INFO L290 TraceCheckUtils]: 0: Hoare triple {2927#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2927#true} is VALID [2022-02-20 23:49:36,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {2927#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(128);call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; {2927#true} is VALID [2022-02-20 23:49:36,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {2927#true} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {2927#true} is VALID [2022-02-20 23:49:36,214 INFO L290 TraceCheckUtils]: 3: Hoare triple {2927#true} assume !!(foo_~i~0#1 <= foo_~size#1); {2927#true} is VALID [2022-02-20 23:49:36,214 INFO L290 TraceCheckUtils]: 4: Hoare triple {2927#true} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {2927#true} is VALID [2022-02-20 23:49:36,214 INFO L290 TraceCheckUtils]: 5: Hoare triple {2927#true} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {2927#true} is VALID [2022-02-20 23:49:36,215 INFO L290 TraceCheckUtils]: 6: Hoare triple {2927#true} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {2927#true} is VALID [2022-02-20 23:49:36,215 INFO L290 TraceCheckUtils]: 7: Hoare triple {2927#true} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {2927#true} is VALID [2022-02-20 23:49:36,215 INFO L290 TraceCheckUtils]: 8: Hoare triple {2927#true} assume !(foo_~i~0#1 <= foo_~size#1); {2927#true} is VALID [2022-02-20 23:49:36,215 INFO L290 TraceCheckUtils]: 9: Hoare triple {2927#true} foo_#res#1 := foo_~i~0#1; {2927#true} is VALID [2022-02-20 23:49:36,215 INFO L290 TraceCheckUtils]: 10: Hoare triple {2927#true} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {2927#true} is VALID [2022-02-20 23:49:36,215 INFO L290 TraceCheckUtils]: 11: Hoare triple {2927#true} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {2927#true} is VALID [2022-02-20 23:49:36,215 INFO L290 TraceCheckUtils]: 12: Hoare triple {2927#true} havoc main_#t~ret3#1; {2927#true} is VALID [2022-02-20 23:49:36,215 INFO L290 TraceCheckUtils]: 13: Hoare triple {2927#true} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2927#true} is VALID [2022-02-20 23:49:36,216 INFO L290 TraceCheckUtils]: 14: Hoare triple {2927#true} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {2929#(= |ULTIMATE.start_foo_~i~0#1| 0)} is VALID [2022-02-20 23:49:36,216 INFO L290 TraceCheckUtils]: 15: Hoare triple {2929#(= |ULTIMATE.start_foo_~i~0#1| 0)} assume !!(foo_~i~0#1 <= foo_~size#1); {2929#(= |ULTIMATE.start_foo_~i~0#1| 0)} is VALID [2022-02-20 23:49:36,216 INFO L290 TraceCheckUtils]: 16: Hoare triple {2929#(= |ULTIMATE.start_foo_~i~0#1| 0)} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {2929#(= |ULTIMATE.start_foo_~i~0#1| 0)} is VALID [2022-02-20 23:49:36,217 INFO L290 TraceCheckUtils]: 17: Hoare triple {2929#(= |ULTIMATE.start_foo_~i~0#1| 0)} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {2929#(= |ULTIMATE.start_foo_~i~0#1| 0)} is VALID [2022-02-20 23:49:36,217 INFO L290 TraceCheckUtils]: 18: Hoare triple {2929#(= |ULTIMATE.start_foo_~i~0#1| 0)} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {2929#(= |ULTIMATE.start_foo_~i~0#1| 0)} is VALID [2022-02-20 23:49:36,217 INFO L290 TraceCheckUtils]: 19: Hoare triple {2929#(= |ULTIMATE.start_foo_~i~0#1| 0)} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {2930#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:49:36,218 INFO L290 TraceCheckUtils]: 20: Hoare triple {2930#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} assume !!(foo_~i~0#1 <= foo_~size#1); {2930#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:49:36,218 INFO L290 TraceCheckUtils]: 21: Hoare triple {2930#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} assume !(0 <= foo_~i~0#1 && foo_~i~0#1 < 32); {2928#false} is VALID [2022-02-20 23:49:36,218 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:49:36,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:49:36,288 INFO L290 TraceCheckUtils]: 21: Hoare triple {2997#(and (< |ULTIMATE.start_foo_~i~0#1| 32) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} assume !(0 <= foo_~i~0#1 && foo_~i~0#1 < 32); {2928#false} is VALID [2022-02-20 23:49:36,289 INFO L290 TraceCheckUtils]: 20: Hoare triple {2997#(and (< |ULTIMATE.start_foo_~i~0#1| 32) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} assume !!(foo_~i~0#1 <= foo_~size#1); {2997#(and (< |ULTIMATE.start_foo_~i~0#1| 32) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:49:36,289 INFO L290 TraceCheckUtils]: 19: Hoare triple {3004#(and (<= 0 (+ |ULTIMATE.start_foo_~i~0#1| 1)) (< |ULTIMATE.start_foo_~i~0#1| 31))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {2997#(and (< |ULTIMATE.start_foo_~i~0#1| 32) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:49:36,290 INFO L290 TraceCheckUtils]: 18: Hoare triple {3004#(and (<= 0 (+ |ULTIMATE.start_foo_~i~0#1| 1)) (< |ULTIMATE.start_foo_~i~0#1| 31))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {3004#(and (<= 0 (+ |ULTIMATE.start_foo_~i~0#1| 1)) (< |ULTIMATE.start_foo_~i~0#1| 31))} is VALID [2022-02-20 23:49:36,290 INFO L290 TraceCheckUtils]: 17: Hoare triple {3004#(and (<= 0 (+ |ULTIMATE.start_foo_~i~0#1| 1)) (< |ULTIMATE.start_foo_~i~0#1| 31))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {3004#(and (<= 0 (+ |ULTIMATE.start_foo_~i~0#1| 1)) (< |ULTIMATE.start_foo_~i~0#1| 31))} is VALID [2022-02-20 23:49:36,290 INFO L290 TraceCheckUtils]: 16: Hoare triple {3004#(and (<= 0 (+ |ULTIMATE.start_foo_~i~0#1| 1)) (< |ULTIMATE.start_foo_~i~0#1| 31))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {3004#(and (<= 0 (+ |ULTIMATE.start_foo_~i~0#1| 1)) (< |ULTIMATE.start_foo_~i~0#1| 31))} is VALID [2022-02-20 23:49:36,291 INFO L290 TraceCheckUtils]: 15: Hoare triple {3004#(and (<= 0 (+ |ULTIMATE.start_foo_~i~0#1| 1)) (< |ULTIMATE.start_foo_~i~0#1| 31))} assume !!(foo_~i~0#1 <= foo_~size#1); {3004#(and (<= 0 (+ |ULTIMATE.start_foo_~i~0#1| 1)) (< |ULTIMATE.start_foo_~i~0#1| 31))} is VALID [2022-02-20 23:49:36,291 INFO L290 TraceCheckUtils]: 14: Hoare triple {2927#true} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {3004#(and (<= 0 (+ |ULTIMATE.start_foo_~i~0#1| 1)) (< |ULTIMATE.start_foo_~i~0#1| 31))} is VALID [2022-02-20 23:49:36,291 INFO L290 TraceCheckUtils]: 13: Hoare triple {2927#true} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2927#true} is VALID [2022-02-20 23:49:36,292 INFO L290 TraceCheckUtils]: 12: Hoare triple {2927#true} havoc main_#t~ret3#1; {2927#true} is VALID [2022-02-20 23:49:36,292 INFO L290 TraceCheckUtils]: 11: Hoare triple {2927#true} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {2927#true} is VALID [2022-02-20 23:49:36,292 INFO L290 TraceCheckUtils]: 10: Hoare triple {2927#true} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {2927#true} is VALID [2022-02-20 23:49:36,292 INFO L290 TraceCheckUtils]: 9: Hoare triple {2927#true} foo_#res#1 := foo_~i~0#1; {2927#true} is VALID [2022-02-20 23:49:36,292 INFO L290 TraceCheckUtils]: 8: Hoare triple {2927#true} assume !(foo_~i~0#1 <= foo_~size#1); {2927#true} is VALID [2022-02-20 23:49:36,292 INFO L290 TraceCheckUtils]: 7: Hoare triple {2927#true} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {2927#true} is VALID [2022-02-20 23:49:36,292 INFO L290 TraceCheckUtils]: 6: Hoare triple {2927#true} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {2927#true} is VALID [2022-02-20 23:49:36,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {2927#true} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {2927#true} is VALID [2022-02-20 23:49:36,293 INFO L290 TraceCheckUtils]: 4: Hoare triple {2927#true} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {2927#true} is VALID [2022-02-20 23:49:36,293 INFO L290 TraceCheckUtils]: 3: Hoare triple {2927#true} assume !!(foo_~i~0#1 <= foo_~size#1); {2927#true} is VALID [2022-02-20 23:49:36,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {2927#true} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {2927#true} is VALID [2022-02-20 23:49:36,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {2927#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(128);call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; {2927#true} is VALID [2022-02-20 23:49:36,293 INFO L290 TraceCheckUtils]: 0: Hoare triple {2927#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2927#true} is VALID [2022-02-20 23:49:36,293 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:49:36,294 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139617280] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:49:36,294 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:49:36,294 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-02-20 23:49:36,294 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320450188] [2022-02-20 23:49:36,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:49:36,294 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-20 23:49:36,295 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:36,295 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:36,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:36,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:49:36,310 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:36,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:49:36,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:49:36,311 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:36,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:36,437 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2022-02-20 23:49:36,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:49:36,437 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-20 23:49:36,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:36,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:36,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions. [2022-02-20 23:49:36,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:36,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions. [2022-02-20 23:49:36,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 92 transitions. [2022-02-20 23:49:36,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:36,501 INFO L225 Difference]: With dead ends: 104 [2022-02-20 23:49:36,501 INFO L226 Difference]: Without dead ends: 104 [2022-02-20 23:49:36,502 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:49:36,502 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 80 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:36,502 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 84 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:49:36,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-02-20 23:49:36,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 60. [2022-02-20 23:49:36,504 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:36,505 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand has 60 states, 55 states have (on average 1.2) internal successors, (66), 59 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:36,505 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand has 60 states, 55 states have (on average 1.2) internal successors, (66), 59 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:36,505 INFO L87 Difference]: Start difference. First operand 104 states. Second operand has 60 states, 55 states have (on average 1.2) internal successors, (66), 59 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:36,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:36,506 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2022-02-20 23:49:36,506 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 110 transitions. [2022-02-20 23:49:36,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:36,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:36,507 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 55 states have (on average 1.2) internal successors, (66), 59 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 104 states. [2022-02-20 23:49:36,507 INFO L87 Difference]: Start difference. First operand has 60 states, 55 states have (on average 1.2) internal successors, (66), 59 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 104 states. [2022-02-20 23:49:36,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:36,508 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2022-02-20 23:49:36,508 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 110 transitions. [2022-02-20 23:49:36,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:36,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:36,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:36,509 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:36,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 55 states have (on average 1.2) internal successors, (66), 59 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:36,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2022-02-20 23:49:36,509 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 22 [2022-02-20 23:49:36,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:36,510 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2022-02-20 23:49:36,510 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:36,510 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2022-02-20 23:49:36,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 23:49:36,510 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:36,510 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:36,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-20 23:49:36,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:49:36,727 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2022-02-20 23:49:36,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:36,727 INFO L85 PathProgramCache]: Analyzing trace with hash -248923733, now seen corresponding path program 1 times [2022-02-20 23:49:36,727 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:36,728 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732691409] [2022-02-20 23:49:36,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:36,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:36,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:36,788 INFO L290 TraceCheckUtils]: 0: Hoare triple {3436#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {3436#true} is VALID [2022-02-20 23:49:36,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {3436#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(128);call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; {3438#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:36,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {3438#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {3438#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:36,790 INFO L290 TraceCheckUtils]: 3: Hoare triple {3438#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} assume !!(foo_~i~0#1 <= foo_~size#1); {3438#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:36,790 INFO L290 TraceCheckUtils]: 4: Hoare triple {3438#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {3438#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:36,791 INFO L290 TraceCheckUtils]: 5: Hoare triple {3438#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {3438#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:36,791 INFO L290 TraceCheckUtils]: 6: Hoare triple {3438#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {3438#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:36,791 INFO L290 TraceCheckUtils]: 7: Hoare triple {3438#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {3438#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:36,792 INFO L290 TraceCheckUtils]: 8: Hoare triple {3438#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} assume !(foo_~i~0#1 <= foo_~size#1); {3438#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:36,792 INFO L290 TraceCheckUtils]: 9: Hoare triple {3438#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} foo_#res#1 := foo_~i~0#1; {3438#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:36,793 INFO L290 TraceCheckUtils]: 10: Hoare triple {3438#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {3438#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:36,793 INFO L290 TraceCheckUtils]: 11: Hoare triple {3438#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {3438#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:36,793 INFO L290 TraceCheckUtils]: 12: Hoare triple {3438#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} havoc main_#t~ret3#1; {3438#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:36,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {3438#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3438#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:36,794 INFO L290 TraceCheckUtils]: 14: Hoare triple {3438#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {3439#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:49:36,795 INFO L290 TraceCheckUtils]: 15: Hoare triple {3439#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} assume !!(foo_~i~0#1 <= foo_~size#1); {3439#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:49:36,797 INFO L290 TraceCheckUtils]: 16: Hoare triple {3439#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {3439#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:49:36,798 INFO L290 TraceCheckUtils]: 17: Hoare triple {3439#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {3439#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:49:36,804 INFO L290 TraceCheckUtils]: 18: Hoare triple {3439#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {3439#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:49:36,804 INFO L290 TraceCheckUtils]: 19: Hoare triple {3439#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {3440#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (<= |ULTIMATE.start_foo_~i~0#1| 1) (= |ULTIMATE.start_foo_~b#1.offset| 0))} is VALID [2022-02-20 23:49:36,805 INFO L290 TraceCheckUtils]: 20: Hoare triple {3440#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (<= |ULTIMATE.start_foo_~i~0#1| 1) (= |ULTIMATE.start_foo_~b#1.offset| 0))} assume !!(foo_~i~0#1 <= foo_~size#1); {3440#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (<= |ULTIMATE.start_foo_~i~0#1| 1) (= |ULTIMATE.start_foo_~b#1.offset| 0))} is VALID [2022-02-20 23:49:36,805 INFO L290 TraceCheckUtils]: 21: Hoare triple {3440#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (<= |ULTIMATE.start_foo_~i~0#1| 1) (= |ULTIMATE.start_foo_~b#1.offset| 0))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {3441#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (<= |ULTIMATE.start_foo_~i~0#1| 1) (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:49:36,806 INFO L290 TraceCheckUtils]: 22: Hoare triple {3441#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (<= |ULTIMATE.start_foo_~i~0#1| 1) (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} assume !(1 + (foo_~b#1.offset + foo_~i~0#1) <= #length[foo_~b#1.base] && 0 <= foo_~b#1.offset + foo_~i~0#1); {3437#false} is VALID [2022-02-20 23:49:36,806 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:49:36,806 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:49:36,806 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732691409] [2022-02-20 23:49:36,806 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732691409] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:49:36,806 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491668032] [2022-02-20 23:49:36,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:36,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:49:36,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:49:36,808 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:49:36,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-20 23:49:36,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:36,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 21 conjunts are in the unsatisfiable core [2022-02-20 23:49:36,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:36,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:49:36,912 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-20 23:49:36,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-02-20 23:49:37,121 INFO L290 TraceCheckUtils]: 0: Hoare triple {3436#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {3436#true} is VALID [2022-02-20 23:49:37,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {3436#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(128);call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; {3448#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:37,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {3448#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {3448#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:37,123 INFO L290 TraceCheckUtils]: 3: Hoare triple {3448#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} assume !!(foo_~i~0#1 <= foo_~size#1); {3448#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:37,123 INFO L290 TraceCheckUtils]: 4: Hoare triple {3448#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {3448#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:37,123 INFO L290 TraceCheckUtils]: 5: Hoare triple {3448#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {3448#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:37,124 INFO L290 TraceCheckUtils]: 6: Hoare triple {3448#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {3448#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:37,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {3448#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {3448#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:37,125 INFO L290 TraceCheckUtils]: 8: Hoare triple {3448#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} assume !(foo_~i~0#1 <= foo_~size#1); {3448#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:37,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {3448#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} foo_#res#1 := foo_~i~0#1; {3448#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:37,126 INFO L290 TraceCheckUtils]: 10: Hoare triple {3448#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {3448#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:37,126 INFO L290 TraceCheckUtils]: 11: Hoare triple {3448#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {3448#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:37,126 INFO L290 TraceCheckUtils]: 12: Hoare triple {3448#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} havoc main_#t~ret3#1; {3448#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:37,127 INFO L290 TraceCheckUtils]: 13: Hoare triple {3448#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3448#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:37,127 INFO L290 TraceCheckUtils]: 14: Hoare triple {3448#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {3488#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} is VALID [2022-02-20 23:49:37,128 INFO L290 TraceCheckUtils]: 15: Hoare triple {3488#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} assume !!(foo_~i~0#1 <= foo_~size#1); {3488#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} is VALID [2022-02-20 23:49:37,128 INFO L290 TraceCheckUtils]: 16: Hoare triple {3488#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {3488#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} is VALID [2022-02-20 23:49:37,129 INFO L290 TraceCheckUtils]: 17: Hoare triple {3488#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {3488#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} is VALID [2022-02-20 23:49:37,129 INFO L290 TraceCheckUtils]: 18: Hoare triple {3488#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {3488#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} is VALID [2022-02-20 23:49:37,130 INFO L290 TraceCheckUtils]: 19: Hoare triple {3488#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (= |ULTIMATE.start_foo_~i~0#1| 0) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {3504#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (= |ULTIMATE.start_foo_~i~0#1| 1) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} is VALID [2022-02-20 23:49:37,130 INFO L290 TraceCheckUtils]: 20: Hoare triple {3504#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (= |ULTIMATE.start_foo_~i~0#1| 1) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} assume !!(foo_~i~0#1 <= foo_~size#1); {3504#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (= |ULTIMATE.start_foo_~i~0#1| 1) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} is VALID [2022-02-20 23:49:37,130 INFO L290 TraceCheckUtils]: 21: Hoare triple {3504#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (= |ULTIMATE.start_foo_~i~0#1| 1) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {3504#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (= |ULTIMATE.start_foo_~i~0#1| 1) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} is VALID [2022-02-20 23:49:37,131 INFO L290 TraceCheckUtils]: 22: Hoare triple {3504#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (= |ULTIMATE.start_foo_~i~0#1| 1) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} assume !(1 + (foo_~b#1.offset + foo_~i~0#1) <= #length[foo_~b#1.base] && 0 <= foo_~b#1.offset + foo_~i~0#1); {3437#false} is VALID [2022-02-20 23:49:37,131 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:49:37,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:49:37,364 INFO L290 TraceCheckUtils]: 22: Hoare triple {3514#(and (<= 0 (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset|)) (<= (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1) (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} assume !(1 + (foo_~b#1.offset + foo_~i~0#1) <= #length[foo_~b#1.base] && 0 <= foo_~b#1.offset + foo_~i~0#1); {3437#false} is VALID [2022-02-20 23:49:37,364 INFO L290 TraceCheckUtils]: 21: Hoare triple {3514#(and (<= 0 (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset|)) (<= (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1) (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {3514#(and (<= 0 (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset|)) (<= (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1) (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} is VALID [2022-02-20 23:49:37,365 INFO L290 TraceCheckUtils]: 20: Hoare triple {3514#(and (<= 0 (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset|)) (<= (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1) (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} assume !!(foo_~i~0#1 <= foo_~size#1); {3514#(and (<= 0 (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset|)) (<= (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1) (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} is VALID [2022-02-20 23:49:37,365 INFO L290 TraceCheckUtils]: 19: Hoare triple {3524#(and (<= (+ |ULTIMATE.start_foo_~i~0#1| 2 |ULTIMATE.start_foo_~b#1.offset|) (select |#length| |ULTIMATE.start_foo_~b#1.base|)) (<= 0 (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1)))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {3514#(and (<= 0 (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset|)) (<= (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1) (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} is VALID [2022-02-20 23:49:37,366 INFO L290 TraceCheckUtils]: 18: Hoare triple {3524#(and (<= (+ |ULTIMATE.start_foo_~i~0#1| 2 |ULTIMATE.start_foo_~b#1.offset|) (select |#length| |ULTIMATE.start_foo_~b#1.base|)) (<= 0 (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1)))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {3524#(and (<= (+ |ULTIMATE.start_foo_~i~0#1| 2 |ULTIMATE.start_foo_~b#1.offset|) (select |#length| |ULTIMATE.start_foo_~b#1.base|)) (<= 0 (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1)))} is VALID [2022-02-20 23:49:37,366 INFO L290 TraceCheckUtils]: 17: Hoare triple {3524#(and (<= (+ |ULTIMATE.start_foo_~i~0#1| 2 |ULTIMATE.start_foo_~b#1.offset|) (select |#length| |ULTIMATE.start_foo_~b#1.base|)) (<= 0 (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1)))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {3524#(and (<= (+ |ULTIMATE.start_foo_~i~0#1| 2 |ULTIMATE.start_foo_~b#1.offset|) (select |#length| |ULTIMATE.start_foo_~b#1.base|)) (<= 0 (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1)))} is VALID [2022-02-20 23:49:37,367 INFO L290 TraceCheckUtils]: 16: Hoare triple {3524#(and (<= (+ |ULTIMATE.start_foo_~i~0#1| 2 |ULTIMATE.start_foo_~b#1.offset|) (select |#length| |ULTIMATE.start_foo_~b#1.base|)) (<= 0 (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1)))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {3524#(and (<= (+ |ULTIMATE.start_foo_~i~0#1| 2 |ULTIMATE.start_foo_~b#1.offset|) (select |#length| |ULTIMATE.start_foo_~b#1.base|)) (<= 0 (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1)))} is VALID [2022-02-20 23:49:37,367 INFO L290 TraceCheckUtils]: 15: Hoare triple {3524#(and (<= (+ |ULTIMATE.start_foo_~i~0#1| 2 |ULTIMATE.start_foo_~b#1.offset|) (select |#length| |ULTIMATE.start_foo_~b#1.base|)) (<= 0 (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1)))} assume !!(foo_~i~0#1 <= foo_~size#1); {3524#(and (<= (+ |ULTIMATE.start_foo_~i~0#1| 2 |ULTIMATE.start_foo_~b#1.offset|) (select |#length| |ULTIMATE.start_foo_~b#1.base|)) (<= 0 (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1)))} is VALID [2022-02-20 23:49:37,368 INFO L290 TraceCheckUtils]: 14: Hoare triple {3540#(and (<= 0 (+ |ULTIMATE.start_main_~#mask~0#1.offset| 1)) (<= (+ 2 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {3524#(and (<= (+ |ULTIMATE.start_foo_~i~0#1| 2 |ULTIMATE.start_foo_~b#1.offset|) (select |#length| |ULTIMATE.start_foo_~b#1.base|)) (<= 0 (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1)))} is VALID [2022-02-20 23:49:37,368 INFO L290 TraceCheckUtils]: 13: Hoare triple {3540#(and (<= 0 (+ |ULTIMATE.start_main_~#mask~0#1.offset| 1)) (<= (+ 2 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3540#(and (<= 0 (+ |ULTIMATE.start_main_~#mask~0#1.offset| 1)) (<= (+ 2 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:37,368 INFO L290 TraceCheckUtils]: 12: Hoare triple {3540#(and (<= 0 (+ |ULTIMATE.start_main_~#mask~0#1.offset| 1)) (<= (+ 2 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} havoc main_#t~ret3#1; {3540#(and (<= 0 (+ |ULTIMATE.start_main_~#mask~0#1.offset| 1)) (<= (+ 2 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:37,369 INFO L290 TraceCheckUtils]: 11: Hoare triple {3540#(and (<= 0 (+ |ULTIMATE.start_main_~#mask~0#1.offset| 1)) (<= (+ 2 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {3540#(and (<= 0 (+ |ULTIMATE.start_main_~#mask~0#1.offset| 1)) (<= (+ 2 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:37,369 INFO L290 TraceCheckUtils]: 10: Hoare triple {3540#(and (<= 0 (+ |ULTIMATE.start_main_~#mask~0#1.offset| 1)) (<= (+ 2 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {3540#(and (<= 0 (+ |ULTIMATE.start_main_~#mask~0#1.offset| 1)) (<= (+ 2 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:37,370 INFO L290 TraceCheckUtils]: 9: Hoare triple {3540#(and (<= 0 (+ |ULTIMATE.start_main_~#mask~0#1.offset| 1)) (<= (+ 2 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} foo_#res#1 := foo_~i~0#1; {3540#(and (<= 0 (+ |ULTIMATE.start_main_~#mask~0#1.offset| 1)) (<= (+ 2 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:37,370 INFO L290 TraceCheckUtils]: 8: Hoare triple {3540#(and (<= 0 (+ |ULTIMATE.start_main_~#mask~0#1.offset| 1)) (<= (+ 2 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} assume !(foo_~i~0#1 <= foo_~size#1); {3540#(and (<= 0 (+ |ULTIMATE.start_main_~#mask~0#1.offset| 1)) (<= (+ 2 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:37,371 INFO L290 TraceCheckUtils]: 7: Hoare triple {3540#(and (<= 0 (+ |ULTIMATE.start_main_~#mask~0#1.offset| 1)) (<= (+ 2 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {3540#(and (<= 0 (+ |ULTIMATE.start_main_~#mask~0#1.offset| 1)) (<= (+ 2 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:37,371 INFO L290 TraceCheckUtils]: 6: Hoare triple {3540#(and (<= 0 (+ |ULTIMATE.start_main_~#mask~0#1.offset| 1)) (<= (+ 2 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {3540#(and (<= 0 (+ |ULTIMATE.start_main_~#mask~0#1.offset| 1)) (<= (+ 2 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:37,372 INFO L290 TraceCheckUtils]: 5: Hoare triple {3540#(and (<= 0 (+ |ULTIMATE.start_main_~#mask~0#1.offset| 1)) (<= (+ 2 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {3540#(and (<= 0 (+ |ULTIMATE.start_main_~#mask~0#1.offset| 1)) (<= (+ 2 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:37,372 INFO L290 TraceCheckUtils]: 4: Hoare triple {3540#(and (<= 0 (+ |ULTIMATE.start_main_~#mask~0#1.offset| 1)) (<= (+ 2 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {3540#(and (<= 0 (+ |ULTIMATE.start_main_~#mask~0#1.offset| 1)) (<= (+ 2 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:37,372 INFO L290 TraceCheckUtils]: 3: Hoare triple {3540#(and (<= 0 (+ |ULTIMATE.start_main_~#mask~0#1.offset| 1)) (<= (+ 2 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} assume !!(foo_~i~0#1 <= foo_~size#1); {3540#(and (<= 0 (+ |ULTIMATE.start_main_~#mask~0#1.offset| 1)) (<= (+ 2 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:37,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {3540#(and (<= 0 (+ |ULTIMATE.start_main_~#mask~0#1.offset| 1)) (<= (+ 2 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {3540#(and (<= 0 (+ |ULTIMATE.start_main_~#mask~0#1.offset| 1)) (<= (+ 2 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:37,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {3436#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(128);call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; {3540#(and (<= 0 (+ |ULTIMATE.start_main_~#mask~0#1.offset| 1)) (<= (+ 2 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:37,374 INFO L290 TraceCheckUtils]: 0: Hoare triple {3436#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {3436#true} is VALID [2022-02-20 23:49:37,374 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:49:37,374 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491668032] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:49:37,374 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:49:37,374 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2022-02-20 23:49:37,375 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006135311] [2022-02-20 23:49:37,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:49:37,375 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.090909090909091) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-02-20 23:49:37,375 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:37,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 6.090909090909091) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:37,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:37,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 23:49:37,423 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:37,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 23:49:37,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:49:37,424 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand has 12 states, 11 states have (on average 6.090909090909091) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:37,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:37,714 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2022-02-20 23:49:37,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:49:37,714 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.090909090909091) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-02-20 23:49:37,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:37,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 6.090909090909091) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:37,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 91 transitions. [2022-02-20 23:49:37,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 6.090909090909091) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:37,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 91 transitions. [2022-02-20 23:49:37,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 91 transitions. [2022-02-20 23:49:37,784 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:37,785 INFO L225 Difference]: With dead ends: 103 [2022-02-20 23:49:37,785 INFO L226 Difference]: Without dead ends: 103 [2022-02-20 23:49:37,785 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2022-02-20 23:49:37,785 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 142 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:37,786 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 72 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:49:37,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-02-20 23:49:37,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 61. [2022-02-20 23:49:37,788 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:37,788 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 61 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 60 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:37,788 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 61 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 60 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:37,788 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 61 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 60 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:37,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:37,789 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2022-02-20 23:49:37,789 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 109 transitions. [2022-02-20 23:49:37,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:37,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:37,790 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 60 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 103 states. [2022-02-20 23:49:37,790 INFO L87 Difference]: Start difference. First operand has 61 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 60 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 103 states. [2022-02-20 23:49:37,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:37,791 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2022-02-20 23:49:37,791 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 109 transitions. [2022-02-20 23:49:37,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:37,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:37,791 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:37,791 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:37,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 60 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:37,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2022-02-20 23:49:37,792 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 23 [2022-02-20 23:49:37,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:37,793 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2022-02-20 23:49:37,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.090909090909091) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:37,793 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2022-02-20 23:49:37,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 23:49:37,794 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:37,794 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:37,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-20 23:49:38,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:49:38,008 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2022-02-20 23:49:38,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:38,008 INFO L85 PathProgramCache]: Analyzing trace with hash 631407484, now seen corresponding path program 2 times [2022-02-20 23:49:38,008 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:38,008 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922951410] [2022-02-20 23:49:38,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:38,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:38,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:38,135 INFO L290 TraceCheckUtils]: 0: Hoare triple {3962#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {3962#true} is VALID [2022-02-20 23:49:38,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {3962#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(128);call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; {3964#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:38,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {3964#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {3964#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:38,137 INFO L290 TraceCheckUtils]: 3: Hoare triple {3964#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} assume !!(foo_~i~0#1 <= foo_~size#1); {3964#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:38,138 INFO L290 TraceCheckUtils]: 4: Hoare triple {3964#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {3964#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:38,139 INFO L290 TraceCheckUtils]: 5: Hoare triple {3964#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {3964#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:38,139 INFO L290 TraceCheckUtils]: 6: Hoare triple {3964#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {3964#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:38,139 INFO L290 TraceCheckUtils]: 7: Hoare triple {3964#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {3964#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:38,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {3964#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} assume !(foo_~i~0#1 <= foo_~size#1); {3964#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:38,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {3964#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} foo_#res#1 := foo_~i~0#1; {3964#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:38,141 INFO L290 TraceCheckUtils]: 10: Hoare triple {3964#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {3964#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:38,141 INFO L290 TraceCheckUtils]: 11: Hoare triple {3964#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {3964#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:38,142 INFO L290 TraceCheckUtils]: 12: Hoare triple {3964#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} havoc main_#t~ret3#1; {3964#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:38,142 INFO L290 TraceCheckUtils]: 13: Hoare triple {3964#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3965#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (+ (* |ULTIMATE.start_main_~i~1#1| 4) 124) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 1 |ULTIMATE.start_main_~i~1#1|) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:38,143 INFO L290 TraceCheckUtils]: 14: Hoare triple {3965#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (+ (* |ULTIMATE.start_main_~i~1#1| 4) 124) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 1 |ULTIMATE.start_main_~i~1#1|) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)))} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {3966#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (+ (* |ULTIMATE.start_main_~i~1#1| 4) 124) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 1 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:38,143 INFO L290 TraceCheckUtils]: 15: Hoare triple {3966#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (+ (* |ULTIMATE.start_main_~i~1#1| 4) 124) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 1 |ULTIMATE.start_main_~i~1#1|))} assume !!(foo_~i~0#1 <= foo_~size#1); {3966#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (+ (* |ULTIMATE.start_main_~i~1#1| 4) 124) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 1 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:38,143 INFO L290 TraceCheckUtils]: 16: Hoare triple {3966#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (+ (* |ULTIMATE.start_main_~i~1#1| 4) 124) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 1 |ULTIMATE.start_main_~i~1#1|))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {3966#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (+ (* |ULTIMATE.start_main_~i~1#1| 4) 124) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 1 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:38,144 INFO L290 TraceCheckUtils]: 17: Hoare triple {3966#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (+ (* |ULTIMATE.start_main_~i~1#1| 4) 124) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 1 |ULTIMATE.start_main_~i~1#1|))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {3966#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (+ (* |ULTIMATE.start_main_~i~1#1| 4) 124) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 1 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:38,144 INFO L290 TraceCheckUtils]: 18: Hoare triple {3966#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (+ (* |ULTIMATE.start_main_~i~1#1| 4) 124) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 1 |ULTIMATE.start_main_~i~1#1|))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {3966#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (+ (* |ULTIMATE.start_main_~i~1#1| 4) 124) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 1 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:38,145 INFO L290 TraceCheckUtils]: 19: Hoare triple {3966#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (+ (* |ULTIMATE.start_main_~i~1#1| 4) 124) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 1 |ULTIMATE.start_main_~i~1#1|))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {3966#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (+ (* |ULTIMATE.start_main_~i~1#1| 4) 124) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 1 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:38,145 INFO L290 TraceCheckUtils]: 20: Hoare triple {3966#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (+ (* |ULTIMATE.start_main_~i~1#1| 4) 124) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 1 |ULTIMATE.start_main_~i~1#1|))} assume !!(foo_~i~0#1 <= foo_~size#1); {3966#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (+ (* |ULTIMATE.start_main_~i~1#1| 4) 124) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 1 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:38,146 INFO L290 TraceCheckUtils]: 21: Hoare triple {3966#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (+ (* |ULTIMATE.start_main_~i~1#1| 4) 124) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 1 |ULTIMATE.start_main_~i~1#1|))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {3966#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (+ (* |ULTIMATE.start_main_~i~1#1| 4) 124) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 1 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:38,146 INFO L290 TraceCheckUtils]: 22: Hoare triple {3966#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (+ (* |ULTIMATE.start_main_~i~1#1| 4) 124) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 1 |ULTIMATE.start_main_~i~1#1|))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {3966#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (+ (* |ULTIMATE.start_main_~i~1#1| 4) 124) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 1 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:38,146 INFO L290 TraceCheckUtils]: 23: Hoare triple {3966#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (+ (* |ULTIMATE.start_main_~i~1#1| 4) 124) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 1 |ULTIMATE.start_main_~i~1#1|))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {3966#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (+ (* |ULTIMATE.start_main_~i~1#1| 4) 124) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 1 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:38,147 INFO L290 TraceCheckUtils]: 24: Hoare triple {3966#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (+ (* |ULTIMATE.start_main_~i~1#1| 4) 124) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 1 |ULTIMATE.start_main_~i~1#1|))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {3966#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (+ (* |ULTIMATE.start_main_~i~1#1| 4) 124) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 1 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:38,147 INFO L290 TraceCheckUtils]: 25: Hoare triple {3966#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (+ (* |ULTIMATE.start_main_~i~1#1| 4) 124) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 1 |ULTIMATE.start_main_~i~1#1|))} assume !(foo_~i~0#1 <= foo_~size#1); {3966#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (+ (* |ULTIMATE.start_main_~i~1#1| 4) 124) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 1 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:38,148 INFO L290 TraceCheckUtils]: 26: Hoare triple {3966#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (+ (* |ULTIMATE.start_main_~i~1#1| 4) 124) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 1 |ULTIMATE.start_main_~i~1#1|))} foo_#res#1 := foo_~i~0#1; {3966#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (+ (* |ULTIMATE.start_main_~i~1#1| 4) 124) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 1 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:38,148 INFO L290 TraceCheckUtils]: 27: Hoare triple {3966#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (+ (* |ULTIMATE.start_main_~i~1#1| 4) 124) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 1 |ULTIMATE.start_main_~i~1#1|))} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {3966#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (+ (* |ULTIMATE.start_main_~i~1#1| 4) 124) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 1 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:38,149 INFO L290 TraceCheckUtils]: 28: Hoare triple {3966#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (+ (* |ULTIMATE.start_main_~i~1#1| 4) 124) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 1 |ULTIMATE.start_main_~i~1#1|))} assume !(4 + (main_~#b~0#1.offset + 4 * main_~i~1#1) <= #length[main_~#b~0#1.base] && 0 <= main_~#b~0#1.offset + 4 * main_~i~1#1); {3963#false} is VALID [2022-02-20 23:49:38,149 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 23:49:38,149 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:49:38,149 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922951410] [2022-02-20 23:49:38,149 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922951410] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:49:38,149 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044584216] [2022-02-20 23:49:38,149 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 23:49:38,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:49:38,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:49:38,151 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:49:38,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-20 23:49:38,199 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 23:49:38,199 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:49:38,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-20 23:49:38,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:38,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:49:38,250 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-20 23:49:38,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-02-20 23:49:38,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-02-20 23:49:38,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {3962#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {3962#true} is VALID [2022-02-20 23:49:38,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {3962#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(128);call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; {3964#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:38,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {3964#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {3976#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:38,553 INFO L290 TraceCheckUtils]: 3: Hoare triple {3976#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} assume !!(foo_~i~0#1 <= foo_~size#1); {3976#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:38,554 INFO L290 TraceCheckUtils]: 4: Hoare triple {3976#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {3976#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:38,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {3976#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {3976#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:38,555 INFO L290 TraceCheckUtils]: 6: Hoare triple {3976#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {3976#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:38,555 INFO L290 TraceCheckUtils]: 7: Hoare triple {3976#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {3976#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:38,560 INFO L290 TraceCheckUtils]: 8: Hoare triple {3976#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} assume !(foo_~i~0#1 <= foo_~size#1); {3976#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:38,561 INFO L290 TraceCheckUtils]: 9: Hoare triple {3976#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} foo_#res#1 := foo_~i~0#1; {3976#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:38,561 INFO L290 TraceCheckUtils]: 10: Hoare triple {3976#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {3976#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:38,562 INFO L290 TraceCheckUtils]: 11: Hoare triple {3976#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {3976#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:38,562 INFO L290 TraceCheckUtils]: 12: Hoare triple {3976#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} havoc main_#t~ret3#1; {3976#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:38,562 INFO L290 TraceCheckUtils]: 13: Hoare triple {3976#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4010#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 1) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:38,563 INFO L290 TraceCheckUtils]: 14: Hoare triple {4010#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 1) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {4010#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 1) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:38,563 INFO L290 TraceCheckUtils]: 15: Hoare triple {4010#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 1) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} assume !!(foo_~i~0#1 <= foo_~size#1); {4010#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 1) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:38,563 INFO L290 TraceCheckUtils]: 16: Hoare triple {4010#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 1) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {4010#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 1) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:38,564 INFO L290 TraceCheckUtils]: 17: Hoare triple {4010#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 1) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {4010#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 1) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:38,564 INFO L290 TraceCheckUtils]: 18: Hoare triple {4010#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 1) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {4010#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 1) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:38,564 INFO L290 TraceCheckUtils]: 19: Hoare triple {4010#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 1) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {4010#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 1) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:38,565 INFO L290 TraceCheckUtils]: 20: Hoare triple {4010#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 1) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} assume !!(foo_~i~0#1 <= foo_~size#1); {4010#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 1) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:38,565 INFO L290 TraceCheckUtils]: 21: Hoare triple {4010#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 1) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {4010#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 1) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:38,566 INFO L290 TraceCheckUtils]: 22: Hoare triple {4010#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 1) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {4010#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 1) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:38,566 INFO L290 TraceCheckUtils]: 23: Hoare triple {4010#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 1) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {4010#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 1) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:38,566 INFO L290 TraceCheckUtils]: 24: Hoare triple {4010#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 1) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {4010#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 1) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:38,567 INFO L290 TraceCheckUtils]: 25: Hoare triple {4010#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 1) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} assume !(foo_~i~0#1 <= foo_~size#1); {4010#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 1) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:38,567 INFO L290 TraceCheckUtils]: 26: Hoare triple {4010#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 1) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} foo_#res#1 := foo_~i~0#1; {4010#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 1) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:38,567 INFO L290 TraceCheckUtils]: 27: Hoare triple {4010#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 1) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {4010#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 1) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:38,568 INFO L290 TraceCheckUtils]: 28: Hoare triple {4010#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 1) (<= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} assume !(4 + (main_~#b~0#1.offset + 4 * main_~i~1#1) <= #length[main_~#b~0#1.base] && 0 <= main_~#b~0#1.offset + 4 * main_~i~1#1); {3963#false} is VALID [2022-02-20 23:49:38,568 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 23:49:38,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:49:38,874 INFO L290 TraceCheckUtils]: 28: Hoare triple {4056#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} assume !(4 + (main_~#b~0#1.offset + 4 * main_~i~1#1) <= #length[main_~#b~0#1.base] && 0 <= main_~#b~0#1.offset + 4 * main_~i~1#1); {3963#false} is VALID [2022-02-20 23:49:38,875 INFO L290 TraceCheckUtils]: 27: Hoare triple {4056#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {4056#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:38,875 INFO L290 TraceCheckUtils]: 26: Hoare triple {4056#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} foo_#res#1 := foo_~i~0#1; {4056#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:38,876 INFO L290 TraceCheckUtils]: 25: Hoare triple {4056#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} assume !(foo_~i~0#1 <= foo_~size#1); {4056#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:38,876 INFO L290 TraceCheckUtils]: 24: Hoare triple {4056#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {4056#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:38,877 INFO L290 TraceCheckUtils]: 23: Hoare triple {4056#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {4056#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:38,877 INFO L290 TraceCheckUtils]: 22: Hoare triple {4056#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {4056#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:38,877 INFO L290 TraceCheckUtils]: 21: Hoare triple {4056#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {4056#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:38,878 INFO L290 TraceCheckUtils]: 20: Hoare triple {4056#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} assume !!(foo_~i~0#1 <= foo_~size#1); {4056#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:38,878 INFO L290 TraceCheckUtils]: 19: Hoare triple {4056#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {4056#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:38,879 INFO L290 TraceCheckUtils]: 18: Hoare triple {4056#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {4056#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:38,879 INFO L290 TraceCheckUtils]: 17: Hoare triple {4056#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {4056#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:38,879 INFO L290 TraceCheckUtils]: 16: Hoare triple {4056#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {4056#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:38,880 INFO L290 TraceCheckUtils]: 15: Hoare triple {4056#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} assume !!(foo_~i~0#1 <= foo_~size#1); {4056#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:38,880 INFO L290 TraceCheckUtils]: 14: Hoare triple {4056#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {4056#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:38,881 INFO L290 TraceCheckUtils]: 13: Hoare triple {4102#(and (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 8) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4)))} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4056#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:38,881 INFO L290 TraceCheckUtils]: 12: Hoare triple {4102#(and (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 8) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4)))} havoc main_#t~ret3#1; {4102#(and (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 8) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4)))} is VALID [2022-02-20 23:49:38,883 INFO L290 TraceCheckUtils]: 11: Hoare triple {4102#(and (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 8) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4)))} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {4102#(and (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 8) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4)))} is VALID [2022-02-20 23:49:38,883 INFO L290 TraceCheckUtils]: 10: Hoare triple {4102#(and (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 8) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4)))} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {4102#(and (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 8) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4)))} is VALID [2022-02-20 23:49:38,884 INFO L290 TraceCheckUtils]: 9: Hoare triple {4102#(and (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 8) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4)))} foo_#res#1 := foo_~i~0#1; {4102#(and (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 8) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4)))} is VALID [2022-02-20 23:49:38,885 INFO L290 TraceCheckUtils]: 8: Hoare triple {4102#(and (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 8) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4)))} assume !(foo_~i~0#1 <= foo_~size#1); {4102#(and (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 8) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4)))} is VALID [2022-02-20 23:49:38,886 INFO L290 TraceCheckUtils]: 7: Hoare triple {4102#(and (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 8) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4)))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {4102#(and (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 8) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4)))} is VALID [2022-02-20 23:49:38,886 INFO L290 TraceCheckUtils]: 6: Hoare triple {4102#(and (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 8) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4)))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {4102#(and (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 8) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4)))} is VALID [2022-02-20 23:49:38,886 INFO L290 TraceCheckUtils]: 5: Hoare triple {4102#(and (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 8) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4)))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {4102#(and (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 8) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4)))} is VALID [2022-02-20 23:49:38,887 INFO L290 TraceCheckUtils]: 4: Hoare triple {4102#(and (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 8) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4)))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {4102#(and (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 8) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4)))} is VALID [2022-02-20 23:49:38,887 INFO L290 TraceCheckUtils]: 3: Hoare triple {4102#(and (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 8) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4)))} assume !!(foo_~i~0#1 <= foo_~size#1); {4102#(and (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 8) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4)))} is VALID [2022-02-20 23:49:38,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {4102#(and (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 8) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4)))} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {4102#(and (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 8) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4)))} is VALID [2022-02-20 23:49:38,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {3962#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(128);call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; {4102#(and (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 8) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4)))} is VALID [2022-02-20 23:49:38,888 INFO L290 TraceCheckUtils]: 0: Hoare triple {3962#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {3962#true} is VALID [2022-02-20 23:49:38,889 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 23:49:38,889 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044584216] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:49:38,889 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:49:38,889 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 8 [2022-02-20 23:49:38,889 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076945684] [2022-02-20 23:49:38,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:49:38,889 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.625) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-02-20 23:49:38,890 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:38,890 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 8.625) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:38,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:38,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:49:38,933 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:38,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:49:38,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:49:38,934 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand has 9 states, 8 states have (on average 8.625) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:39,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:39,180 INFO L93 Difference]: Finished difference Result 153 states and 168 transitions. [2022-02-20 23:49:39,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:49:39,180 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.625) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-02-20 23:49:39,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:39,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 8.625) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:39,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2022-02-20 23:49:39,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 8.625) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:39,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2022-02-20 23:49:39,181 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 86 transitions. [2022-02-20 23:49:39,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:39,278 INFO L225 Difference]: With dead ends: 153 [2022-02-20 23:49:39,278 INFO L226 Difference]: Without dead ends: 153 [2022-02-20 23:49:39,279 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:49:39,279 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 33 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:39,279 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 88 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:49:39,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-02-20 23:49:39,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 145. [2022-02-20 23:49:39,281 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:39,282 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand has 145 states, 140 states have (on average 1.1857142857142857) internal successors, (166), 144 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:39,282 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand has 145 states, 140 states have (on average 1.1857142857142857) internal successors, (166), 144 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:39,282 INFO L87 Difference]: Start difference. First operand 153 states. Second operand has 145 states, 140 states have (on average 1.1857142857142857) internal successors, (166), 144 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:39,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:39,283 INFO L93 Difference]: Finished difference Result 153 states and 168 transitions. [2022-02-20 23:49:39,283 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 168 transitions. [2022-02-20 23:49:39,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:39,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:39,284 INFO L74 IsIncluded]: Start isIncluded. First operand has 145 states, 140 states have (on average 1.1857142857142857) internal successors, (166), 144 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 153 states. [2022-02-20 23:49:39,284 INFO L87 Difference]: Start difference. First operand has 145 states, 140 states have (on average 1.1857142857142857) internal successors, (166), 144 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 153 states. [2022-02-20 23:49:39,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:39,292 INFO L93 Difference]: Finished difference Result 153 states and 168 transitions. [2022-02-20 23:49:39,293 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 168 transitions. [2022-02-20 23:49:39,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:39,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:39,293 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:39,293 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:39,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 140 states have (on average 1.1857142857142857) internal successors, (166), 144 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:39,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 166 transitions. [2022-02-20 23:49:39,295 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 166 transitions. Word has length 29 [2022-02-20 23:49:39,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:39,295 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 166 transitions. [2022-02-20 23:49:39,295 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.625) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:39,295 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 166 transitions. [2022-02-20 23:49:39,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 23:49:39,295 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:39,295 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:39,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-02-20 23:49:39,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-02-20 23:49:39,513 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2022-02-20 23:49:39,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:39,513 INFO L85 PathProgramCache]: Analyzing trace with hash 39048524, now seen corresponding path program 2 times [2022-02-20 23:49:39,513 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:39,513 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57720266] [2022-02-20 23:49:39,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:39,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:39,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:39,574 INFO L290 TraceCheckUtils]: 0: Hoare triple {4749#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {4749#true} is VALID [2022-02-20 23:49:39,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {4749#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(128);call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; {4751#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:39,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {4751#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {4751#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:39,576 INFO L290 TraceCheckUtils]: 3: Hoare triple {4751#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(foo_~i~0#1 <= foo_~size#1); {4751#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:39,576 INFO L290 TraceCheckUtils]: 4: Hoare triple {4751#(= |ULTIMATE.start_main_~i~1#1| 0)} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {4751#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:39,576 INFO L290 TraceCheckUtils]: 5: Hoare triple {4751#(= |ULTIMATE.start_main_~i~1#1| 0)} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {4751#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:39,576 INFO L290 TraceCheckUtils]: 6: Hoare triple {4751#(= |ULTIMATE.start_main_~i~1#1| 0)} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {4751#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:39,577 INFO L290 TraceCheckUtils]: 7: Hoare triple {4751#(= |ULTIMATE.start_main_~i~1#1| 0)} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {4751#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:39,577 INFO L290 TraceCheckUtils]: 8: Hoare triple {4751#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !(foo_~i~0#1 <= foo_~size#1); {4751#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:39,577 INFO L290 TraceCheckUtils]: 9: Hoare triple {4751#(= |ULTIMATE.start_main_~i~1#1| 0)} foo_#res#1 := foo_~i~0#1; {4751#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:39,577 INFO L290 TraceCheckUtils]: 10: Hoare triple {4751#(= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {4751#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:39,578 INFO L290 TraceCheckUtils]: 11: Hoare triple {4751#(= |ULTIMATE.start_main_~i~1#1| 0)} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {4751#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:39,578 INFO L290 TraceCheckUtils]: 12: Hoare triple {4751#(= |ULTIMATE.start_main_~i~1#1| 0)} havoc main_#t~ret3#1; {4751#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:39,578 INFO L290 TraceCheckUtils]: 13: Hoare triple {4751#(= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4752#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 23:49:39,579 INFO L290 TraceCheckUtils]: 14: Hoare triple {4752#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {4753#(<= |ULTIMATE.start_foo_~size#1| 1)} is VALID [2022-02-20 23:49:39,579 INFO L290 TraceCheckUtils]: 15: Hoare triple {4753#(<= |ULTIMATE.start_foo_~size#1| 1)} assume !!(foo_~i~0#1 <= foo_~size#1); {4753#(<= |ULTIMATE.start_foo_~size#1| 1)} is VALID [2022-02-20 23:49:39,579 INFO L290 TraceCheckUtils]: 16: Hoare triple {4753#(<= |ULTIMATE.start_foo_~size#1| 1)} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {4753#(<= |ULTIMATE.start_foo_~size#1| 1)} is VALID [2022-02-20 23:49:39,580 INFO L290 TraceCheckUtils]: 17: Hoare triple {4753#(<= |ULTIMATE.start_foo_~size#1| 1)} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {4753#(<= |ULTIMATE.start_foo_~size#1| 1)} is VALID [2022-02-20 23:49:39,580 INFO L290 TraceCheckUtils]: 18: Hoare triple {4753#(<= |ULTIMATE.start_foo_~size#1| 1)} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {4753#(<= |ULTIMATE.start_foo_~size#1| 1)} is VALID [2022-02-20 23:49:39,580 INFO L290 TraceCheckUtils]: 19: Hoare triple {4753#(<= |ULTIMATE.start_foo_~size#1| 1)} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {4753#(<= |ULTIMATE.start_foo_~size#1| 1)} is VALID [2022-02-20 23:49:39,581 INFO L290 TraceCheckUtils]: 20: Hoare triple {4753#(<= |ULTIMATE.start_foo_~size#1| 1)} assume !!(foo_~i~0#1 <= foo_~size#1); {4753#(<= |ULTIMATE.start_foo_~size#1| 1)} is VALID [2022-02-20 23:49:39,581 INFO L290 TraceCheckUtils]: 21: Hoare triple {4753#(<= |ULTIMATE.start_foo_~size#1| 1)} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {4753#(<= |ULTIMATE.start_foo_~size#1| 1)} is VALID [2022-02-20 23:49:39,581 INFO L290 TraceCheckUtils]: 22: Hoare triple {4753#(<= |ULTIMATE.start_foo_~size#1| 1)} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {4753#(<= |ULTIMATE.start_foo_~size#1| 1)} is VALID [2022-02-20 23:49:39,581 INFO L290 TraceCheckUtils]: 23: Hoare triple {4753#(<= |ULTIMATE.start_foo_~size#1| 1)} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {4753#(<= |ULTIMATE.start_foo_~size#1| 1)} is VALID [2022-02-20 23:49:39,582 INFO L290 TraceCheckUtils]: 24: Hoare triple {4753#(<= |ULTIMATE.start_foo_~size#1| 1)} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {4753#(<= |ULTIMATE.start_foo_~size#1| 1)} is VALID [2022-02-20 23:49:39,582 INFO L290 TraceCheckUtils]: 25: Hoare triple {4753#(<= |ULTIMATE.start_foo_~size#1| 1)} assume !!(foo_~i~0#1 <= foo_~size#1); {4753#(<= |ULTIMATE.start_foo_~size#1| 1)} is VALID [2022-02-20 23:49:39,582 INFO L290 TraceCheckUtils]: 26: Hoare triple {4753#(<= |ULTIMATE.start_foo_~size#1| 1)} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {4754#(<= |ULTIMATE.start_foo_~size#1| (+ |ULTIMATE.start_foo_~i~0#1| 1))} is VALID [2022-02-20 23:49:39,583 INFO L290 TraceCheckUtils]: 27: Hoare triple {4754#(<= |ULTIMATE.start_foo_~size#1| (+ |ULTIMATE.start_foo_~i~0#1| 1))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {4754#(<= |ULTIMATE.start_foo_~size#1| (+ |ULTIMATE.start_foo_~i~0#1| 1))} is VALID [2022-02-20 23:49:39,583 INFO L290 TraceCheckUtils]: 28: Hoare triple {4754#(<= |ULTIMATE.start_foo_~size#1| (+ |ULTIMATE.start_foo_~i~0#1| 1))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {4754#(<= |ULTIMATE.start_foo_~size#1| (+ |ULTIMATE.start_foo_~i~0#1| 1))} is VALID [2022-02-20 23:49:39,583 INFO L290 TraceCheckUtils]: 29: Hoare triple {4754#(<= |ULTIMATE.start_foo_~size#1| (+ |ULTIMATE.start_foo_~i~0#1| 1))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {4755#(<= |ULTIMATE.start_foo_~size#1| |ULTIMATE.start_foo_~i~0#1|)} is VALID [2022-02-20 23:49:39,584 INFO L290 TraceCheckUtils]: 30: Hoare triple {4755#(<= |ULTIMATE.start_foo_~size#1| |ULTIMATE.start_foo_~i~0#1|)} assume !!(foo_~i~0#1 <= foo_~size#1); {4755#(<= |ULTIMATE.start_foo_~size#1| |ULTIMATE.start_foo_~i~0#1|)} is VALID [2022-02-20 23:49:39,584 INFO L290 TraceCheckUtils]: 31: Hoare triple {4755#(<= |ULTIMATE.start_foo_~size#1| |ULTIMATE.start_foo_~i~0#1|)} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {4755#(<= |ULTIMATE.start_foo_~size#1| |ULTIMATE.start_foo_~i~0#1|)} is VALID [2022-02-20 23:49:39,584 INFO L290 TraceCheckUtils]: 32: Hoare triple {4755#(<= |ULTIMATE.start_foo_~size#1| |ULTIMATE.start_foo_~i~0#1|)} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {4755#(<= |ULTIMATE.start_foo_~size#1| |ULTIMATE.start_foo_~i~0#1|)} is VALID [2022-02-20 23:49:39,585 INFO L290 TraceCheckUtils]: 33: Hoare triple {4755#(<= |ULTIMATE.start_foo_~size#1| |ULTIMATE.start_foo_~i~0#1|)} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {4755#(<= |ULTIMATE.start_foo_~size#1| |ULTIMATE.start_foo_~i~0#1|)} is VALID [2022-02-20 23:49:39,585 INFO L290 TraceCheckUtils]: 34: Hoare triple {4755#(<= |ULTIMATE.start_foo_~size#1| |ULTIMATE.start_foo_~i~0#1|)} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {4756#(<= (+ |ULTIMATE.start_foo_~size#1| 1) |ULTIMATE.start_foo_~i~0#1|)} is VALID [2022-02-20 23:49:39,585 INFO L290 TraceCheckUtils]: 35: Hoare triple {4756#(<= (+ |ULTIMATE.start_foo_~size#1| 1) |ULTIMATE.start_foo_~i~0#1|)} assume !!(foo_~i~0#1 <= foo_~size#1); {4750#false} is VALID [2022-02-20 23:49:39,585 INFO L290 TraceCheckUtils]: 36: Hoare triple {4750#false} assume !(0 <= foo_~i~0#1 && foo_~i~0#1 < 32); {4750#false} is VALID [2022-02-20 23:49:39,586 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-20 23:49:39,586 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:49:39,586 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57720266] [2022-02-20 23:49:39,586 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57720266] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:49:39,586 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348905572] [2022-02-20 23:49:39,586 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 23:49:39,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:49:39,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:49:39,598 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:49:39,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-02-20 23:49:39,653 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 23:49:39,653 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:49:39,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 23:49:39,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:39,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:49:39,896 INFO L290 TraceCheckUtils]: 0: Hoare triple {4749#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {4749#true} is VALID [2022-02-20 23:49:39,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {4749#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(128);call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; {4763#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:39,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {4763#(<= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {4763#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:39,897 INFO L290 TraceCheckUtils]: 3: Hoare triple {4763#(<= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(foo_~i~0#1 <= foo_~size#1); {4763#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:39,897 INFO L290 TraceCheckUtils]: 4: Hoare triple {4763#(<= |ULTIMATE.start_main_~i~1#1| 0)} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {4763#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:39,897 INFO L290 TraceCheckUtils]: 5: Hoare triple {4763#(<= |ULTIMATE.start_main_~i~1#1| 0)} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {4763#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:39,898 INFO L290 TraceCheckUtils]: 6: Hoare triple {4763#(<= |ULTIMATE.start_main_~i~1#1| 0)} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {4763#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:39,898 INFO L290 TraceCheckUtils]: 7: Hoare triple {4763#(<= |ULTIMATE.start_main_~i~1#1| 0)} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {4763#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:39,898 INFO L290 TraceCheckUtils]: 8: Hoare triple {4763#(<= |ULTIMATE.start_main_~i~1#1| 0)} assume !(foo_~i~0#1 <= foo_~size#1); {4763#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:39,899 INFO L290 TraceCheckUtils]: 9: Hoare triple {4763#(<= |ULTIMATE.start_main_~i~1#1| 0)} foo_#res#1 := foo_~i~0#1; {4763#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:39,899 INFO L290 TraceCheckUtils]: 10: Hoare triple {4763#(<= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {4763#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:39,899 INFO L290 TraceCheckUtils]: 11: Hoare triple {4763#(<= |ULTIMATE.start_main_~i~1#1| 0)} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {4763#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:39,899 INFO L290 TraceCheckUtils]: 12: Hoare triple {4763#(<= |ULTIMATE.start_main_~i~1#1| 0)} havoc main_#t~ret3#1; {4763#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:39,900 INFO L290 TraceCheckUtils]: 13: Hoare triple {4763#(<= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4752#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 23:49:39,900 INFO L290 TraceCheckUtils]: 14: Hoare triple {4752#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {4803#(and (<= |ULTIMATE.start_foo_~size#1| 1) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:49:39,901 INFO L290 TraceCheckUtils]: 15: Hoare triple {4803#(and (<= |ULTIMATE.start_foo_~size#1| 1) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} assume !!(foo_~i~0#1 <= foo_~size#1); {4803#(and (<= |ULTIMATE.start_foo_~size#1| 1) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:49:39,901 INFO L290 TraceCheckUtils]: 16: Hoare triple {4803#(and (<= |ULTIMATE.start_foo_~size#1| 1) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {4803#(and (<= |ULTIMATE.start_foo_~size#1| 1) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:49:39,901 INFO L290 TraceCheckUtils]: 17: Hoare triple {4803#(and (<= |ULTIMATE.start_foo_~size#1| 1) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {4803#(and (<= |ULTIMATE.start_foo_~size#1| 1) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:49:39,902 INFO L290 TraceCheckUtils]: 18: Hoare triple {4803#(and (<= |ULTIMATE.start_foo_~size#1| 1) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {4803#(and (<= |ULTIMATE.start_foo_~size#1| 1) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:49:39,902 INFO L290 TraceCheckUtils]: 19: Hoare triple {4803#(and (<= |ULTIMATE.start_foo_~size#1| 1) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {4819#(and (<= |ULTIMATE.start_foo_~size#1| 1) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:49:39,903 INFO L290 TraceCheckUtils]: 20: Hoare triple {4819#(and (<= |ULTIMATE.start_foo_~size#1| 1) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} assume !!(foo_~i~0#1 <= foo_~size#1); {4819#(and (<= |ULTIMATE.start_foo_~size#1| 1) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:49:39,903 INFO L290 TraceCheckUtils]: 21: Hoare triple {4819#(and (<= |ULTIMATE.start_foo_~size#1| 1) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {4819#(and (<= |ULTIMATE.start_foo_~size#1| 1) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:49:39,904 INFO L290 TraceCheckUtils]: 22: Hoare triple {4819#(and (<= |ULTIMATE.start_foo_~size#1| 1) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {4819#(and (<= |ULTIMATE.start_foo_~size#1| 1) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:49:39,904 INFO L290 TraceCheckUtils]: 23: Hoare triple {4819#(and (<= |ULTIMATE.start_foo_~size#1| 1) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {4819#(and (<= |ULTIMATE.start_foo_~size#1| 1) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:49:39,904 INFO L290 TraceCheckUtils]: 24: Hoare triple {4819#(and (<= |ULTIMATE.start_foo_~size#1| 1) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {4835#(and (<= |ULTIMATE.start_foo_~size#1| 1) (<= 2 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:49:39,905 INFO L290 TraceCheckUtils]: 25: Hoare triple {4835#(and (<= |ULTIMATE.start_foo_~size#1| 1) (<= 2 |ULTIMATE.start_foo_~i~0#1|))} assume !!(foo_~i~0#1 <= foo_~size#1); {4750#false} is VALID [2022-02-20 23:49:39,905 INFO L290 TraceCheckUtils]: 26: Hoare triple {4750#false} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {4750#false} is VALID [2022-02-20 23:49:39,905 INFO L290 TraceCheckUtils]: 27: Hoare triple {4750#false} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {4750#false} is VALID [2022-02-20 23:49:39,905 INFO L290 TraceCheckUtils]: 28: Hoare triple {4750#false} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {4750#false} is VALID [2022-02-20 23:49:39,905 INFO L290 TraceCheckUtils]: 29: Hoare triple {4750#false} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {4750#false} is VALID [2022-02-20 23:49:39,905 INFO L290 TraceCheckUtils]: 30: Hoare triple {4750#false} assume !!(foo_~i~0#1 <= foo_~size#1); {4750#false} is VALID [2022-02-20 23:49:39,905 INFO L290 TraceCheckUtils]: 31: Hoare triple {4750#false} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {4750#false} is VALID [2022-02-20 23:49:39,905 INFO L290 TraceCheckUtils]: 32: Hoare triple {4750#false} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {4750#false} is VALID [2022-02-20 23:49:39,905 INFO L290 TraceCheckUtils]: 33: Hoare triple {4750#false} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {4750#false} is VALID [2022-02-20 23:49:39,905 INFO L290 TraceCheckUtils]: 34: Hoare triple {4750#false} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {4750#false} is VALID [2022-02-20 23:49:39,905 INFO L290 TraceCheckUtils]: 35: Hoare triple {4750#false} assume !!(foo_~i~0#1 <= foo_~size#1); {4750#false} is VALID [2022-02-20 23:49:39,906 INFO L290 TraceCheckUtils]: 36: Hoare triple {4750#false} assume !(0 <= foo_~i~0#1 && foo_~i~0#1 < 32); {4750#false} is VALID [2022-02-20 23:49:39,906 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 44 proven. 15 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 23:49:39,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:49:40,088 INFO L290 TraceCheckUtils]: 36: Hoare triple {4750#false} assume !(0 <= foo_~i~0#1 && foo_~i~0#1 < 32); {4750#false} is VALID [2022-02-20 23:49:40,089 INFO L290 TraceCheckUtils]: 35: Hoare triple {4750#false} assume !!(foo_~i~0#1 <= foo_~size#1); {4750#false} is VALID [2022-02-20 23:49:40,089 INFO L290 TraceCheckUtils]: 34: Hoare triple {4750#false} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {4750#false} is VALID [2022-02-20 23:49:40,089 INFO L290 TraceCheckUtils]: 33: Hoare triple {4750#false} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {4750#false} is VALID [2022-02-20 23:49:40,089 INFO L290 TraceCheckUtils]: 32: Hoare triple {4750#false} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {4750#false} is VALID [2022-02-20 23:49:40,089 INFO L290 TraceCheckUtils]: 31: Hoare triple {4750#false} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {4750#false} is VALID [2022-02-20 23:49:40,089 INFO L290 TraceCheckUtils]: 30: Hoare triple {4750#false} assume !!(foo_~i~0#1 <= foo_~size#1); {4750#false} is VALID [2022-02-20 23:49:40,089 INFO L290 TraceCheckUtils]: 29: Hoare triple {4750#false} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {4750#false} is VALID [2022-02-20 23:49:40,089 INFO L290 TraceCheckUtils]: 28: Hoare triple {4750#false} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {4750#false} is VALID [2022-02-20 23:49:40,089 INFO L290 TraceCheckUtils]: 27: Hoare triple {4750#false} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {4750#false} is VALID [2022-02-20 23:49:40,089 INFO L290 TraceCheckUtils]: 26: Hoare triple {4750#false} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {4750#false} is VALID [2022-02-20 23:49:40,090 INFO L290 TraceCheckUtils]: 25: Hoare triple {4756#(<= (+ |ULTIMATE.start_foo_~size#1| 1) |ULTIMATE.start_foo_~i~0#1|)} assume !!(foo_~i~0#1 <= foo_~size#1); {4750#false} is VALID [2022-02-20 23:49:40,090 INFO L290 TraceCheckUtils]: 24: Hoare triple {4755#(<= |ULTIMATE.start_foo_~size#1| |ULTIMATE.start_foo_~i~0#1|)} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {4756#(<= (+ |ULTIMATE.start_foo_~size#1| 1) |ULTIMATE.start_foo_~i~0#1|)} is VALID [2022-02-20 23:49:40,090 INFO L290 TraceCheckUtils]: 23: Hoare triple {4755#(<= |ULTIMATE.start_foo_~size#1| |ULTIMATE.start_foo_~i~0#1|)} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {4755#(<= |ULTIMATE.start_foo_~size#1| |ULTIMATE.start_foo_~i~0#1|)} is VALID [2022-02-20 23:49:40,091 INFO L290 TraceCheckUtils]: 22: Hoare triple {4755#(<= |ULTIMATE.start_foo_~size#1| |ULTIMATE.start_foo_~i~0#1|)} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {4755#(<= |ULTIMATE.start_foo_~size#1| |ULTIMATE.start_foo_~i~0#1|)} is VALID [2022-02-20 23:49:40,091 INFO L290 TraceCheckUtils]: 21: Hoare triple {4755#(<= |ULTIMATE.start_foo_~size#1| |ULTIMATE.start_foo_~i~0#1|)} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {4755#(<= |ULTIMATE.start_foo_~size#1| |ULTIMATE.start_foo_~i~0#1|)} is VALID [2022-02-20 23:49:40,091 INFO L290 TraceCheckUtils]: 20: Hoare triple {4755#(<= |ULTIMATE.start_foo_~size#1| |ULTIMATE.start_foo_~i~0#1|)} assume !!(foo_~i~0#1 <= foo_~size#1); {4755#(<= |ULTIMATE.start_foo_~size#1| |ULTIMATE.start_foo_~i~0#1|)} is VALID [2022-02-20 23:49:40,092 INFO L290 TraceCheckUtils]: 19: Hoare triple {4754#(<= |ULTIMATE.start_foo_~size#1| (+ |ULTIMATE.start_foo_~i~0#1| 1))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {4755#(<= |ULTIMATE.start_foo_~size#1| |ULTIMATE.start_foo_~i~0#1|)} is VALID [2022-02-20 23:49:40,092 INFO L290 TraceCheckUtils]: 18: Hoare triple {4754#(<= |ULTIMATE.start_foo_~size#1| (+ |ULTIMATE.start_foo_~i~0#1| 1))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {4754#(<= |ULTIMATE.start_foo_~size#1| (+ |ULTIMATE.start_foo_~i~0#1| 1))} is VALID [2022-02-20 23:49:40,092 INFO L290 TraceCheckUtils]: 17: Hoare triple {4754#(<= |ULTIMATE.start_foo_~size#1| (+ |ULTIMATE.start_foo_~i~0#1| 1))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {4754#(<= |ULTIMATE.start_foo_~size#1| (+ |ULTIMATE.start_foo_~i~0#1| 1))} is VALID [2022-02-20 23:49:40,093 INFO L290 TraceCheckUtils]: 16: Hoare triple {4754#(<= |ULTIMATE.start_foo_~size#1| (+ |ULTIMATE.start_foo_~i~0#1| 1))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {4754#(<= |ULTIMATE.start_foo_~size#1| (+ |ULTIMATE.start_foo_~i~0#1| 1))} is VALID [2022-02-20 23:49:40,093 INFO L290 TraceCheckUtils]: 15: Hoare triple {4754#(<= |ULTIMATE.start_foo_~size#1| (+ |ULTIMATE.start_foo_~i~0#1| 1))} assume !!(foo_~i~0#1 <= foo_~size#1); {4754#(<= |ULTIMATE.start_foo_~size#1| (+ |ULTIMATE.start_foo_~i~0#1| 1))} is VALID [2022-02-20 23:49:40,093 INFO L290 TraceCheckUtils]: 14: Hoare triple {4752#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {4754#(<= |ULTIMATE.start_foo_~size#1| (+ |ULTIMATE.start_foo_~i~0#1| 1))} is VALID [2022-02-20 23:49:40,094 INFO L290 TraceCheckUtils]: 13: Hoare triple {4763#(<= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4752#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 23:49:40,094 INFO L290 TraceCheckUtils]: 12: Hoare triple {4763#(<= |ULTIMATE.start_main_~i~1#1| 0)} havoc main_#t~ret3#1; {4763#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:40,094 INFO L290 TraceCheckUtils]: 11: Hoare triple {4763#(<= |ULTIMATE.start_main_~i~1#1| 0)} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {4763#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:40,095 INFO L290 TraceCheckUtils]: 10: Hoare triple {4763#(<= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {4763#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:40,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {4763#(<= |ULTIMATE.start_main_~i~1#1| 0)} foo_#res#1 := foo_~i~0#1; {4763#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:40,095 INFO L290 TraceCheckUtils]: 8: Hoare triple {4763#(<= |ULTIMATE.start_main_~i~1#1| 0)} assume !(foo_~i~0#1 <= foo_~size#1); {4763#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:40,096 INFO L290 TraceCheckUtils]: 7: Hoare triple {4763#(<= |ULTIMATE.start_main_~i~1#1| 0)} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {4763#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:40,096 INFO L290 TraceCheckUtils]: 6: Hoare triple {4763#(<= |ULTIMATE.start_main_~i~1#1| 0)} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {4763#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:40,096 INFO L290 TraceCheckUtils]: 5: Hoare triple {4763#(<= |ULTIMATE.start_main_~i~1#1| 0)} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {4763#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:40,096 INFO L290 TraceCheckUtils]: 4: Hoare triple {4763#(<= |ULTIMATE.start_main_~i~1#1| 0)} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {4763#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:40,097 INFO L290 TraceCheckUtils]: 3: Hoare triple {4763#(<= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(foo_~i~0#1 <= foo_~size#1); {4763#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:40,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {4763#(<= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {4763#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:40,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {4749#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(128);call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; {4763#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:40,098 INFO L290 TraceCheckUtils]: 0: Hoare triple {4749#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {4749#true} is VALID [2022-02-20 23:49:40,098 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 44 proven. 15 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 23:49:40,098 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348905572] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:49:40,098 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:49:40,098 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-02-20 23:49:40,098 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637301546] [2022-02-20 23:49:40,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:49:40,099 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-02-20 23:49:40,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:40,100 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:40,163 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:40,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 23:49:40,163 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:40,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 23:49:40,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:49:40,164 INFO L87 Difference]: Start difference. First operand 145 states and 166 transitions. Second operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:40,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:40,493 INFO L93 Difference]: Finished difference Result 155 states and 171 transitions. [2022-02-20 23:49:40,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 23:49:40,493 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-02-20 23:49:40,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:40,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:40,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 86 transitions. [2022-02-20 23:49:40,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:40,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 86 transitions. [2022-02-20 23:49:40,495 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 86 transitions. [2022-02-20 23:49:40,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:40,554 INFO L225 Difference]: With dead ends: 155 [2022-02-20 23:49:40,554 INFO L226 Difference]: Without dead ends: 155 [2022-02-20 23:49:40,554 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=142, Invalid=278, Unknown=0, NotChecked=0, Total=420 [2022-02-20 23:49:40,554 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 177 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:40,555 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 62 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:49:40,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-02-20 23:49:40,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 133. [2022-02-20 23:49:40,557 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:40,557 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand has 133 states, 128 states have (on average 1.1640625) internal successors, (149), 132 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:40,557 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand has 133 states, 128 states have (on average 1.1640625) internal successors, (149), 132 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:40,557 INFO L87 Difference]: Start difference. First operand 155 states. Second operand has 133 states, 128 states have (on average 1.1640625) internal successors, (149), 132 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:40,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:40,559 INFO L93 Difference]: Finished difference Result 155 states and 171 transitions. [2022-02-20 23:49:40,559 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 171 transitions. [2022-02-20 23:49:40,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:40,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:40,559 INFO L74 IsIncluded]: Start isIncluded. First operand has 133 states, 128 states have (on average 1.1640625) internal successors, (149), 132 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 155 states. [2022-02-20 23:49:40,559 INFO L87 Difference]: Start difference. First operand has 133 states, 128 states have (on average 1.1640625) internal successors, (149), 132 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 155 states. [2022-02-20 23:49:40,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:40,561 INFO L93 Difference]: Finished difference Result 155 states and 171 transitions. [2022-02-20 23:49:40,561 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 171 transitions. [2022-02-20 23:49:40,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:40,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:40,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:40,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:40,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 128 states have (on average 1.1640625) internal successors, (149), 132 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:40,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 149 transitions. [2022-02-20 23:49:40,563 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 149 transitions. Word has length 37 [2022-02-20 23:49:40,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:40,563 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 149 transitions. [2022-02-20 23:49:40,563 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:40,563 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 149 transitions. [2022-02-20 23:49:40,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-20 23:49:40,563 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:40,563 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:40,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-02-20 23:49:40,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-02-20 23:49:40,780 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2022-02-20 23:49:40,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:40,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1591695324, now seen corresponding path program 2 times [2022-02-20 23:49:40,780 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:40,780 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324390065] [2022-02-20 23:49:40,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:40,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:40,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:40,834 INFO L290 TraceCheckUtils]: 0: Hoare triple {5595#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {5595#true} is VALID [2022-02-20 23:49:40,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {5595#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(128);call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; {5597#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:40,834 INFO L290 TraceCheckUtils]: 2: Hoare triple {5597#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {5597#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:40,835 INFO L290 TraceCheckUtils]: 3: Hoare triple {5597#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(foo_~i~0#1 <= foo_~size#1); {5597#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:40,835 INFO L290 TraceCheckUtils]: 4: Hoare triple {5597#(= |ULTIMATE.start_main_~i~1#1| 0)} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {5597#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:40,835 INFO L290 TraceCheckUtils]: 5: Hoare triple {5597#(= |ULTIMATE.start_main_~i~1#1| 0)} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {5597#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:40,835 INFO L290 TraceCheckUtils]: 6: Hoare triple {5597#(= |ULTIMATE.start_main_~i~1#1| 0)} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {5597#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:40,836 INFO L290 TraceCheckUtils]: 7: Hoare triple {5597#(= |ULTIMATE.start_main_~i~1#1| 0)} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {5597#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:40,836 INFO L290 TraceCheckUtils]: 8: Hoare triple {5597#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !(foo_~i~0#1 <= foo_~size#1); {5597#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:40,836 INFO L290 TraceCheckUtils]: 9: Hoare triple {5597#(= |ULTIMATE.start_main_~i~1#1| 0)} foo_#res#1 := foo_~i~0#1; {5597#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:40,836 INFO L290 TraceCheckUtils]: 10: Hoare triple {5597#(= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {5597#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:40,837 INFO L290 TraceCheckUtils]: 11: Hoare triple {5597#(= |ULTIMATE.start_main_~i~1#1| 0)} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {5597#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:40,837 INFO L290 TraceCheckUtils]: 12: Hoare triple {5597#(= |ULTIMATE.start_main_~i~1#1| 0)} havoc main_#t~ret3#1; {5597#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:40,837 INFO L290 TraceCheckUtils]: 13: Hoare triple {5597#(= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {5598#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:40,838 INFO L290 TraceCheckUtils]: 14: Hoare triple {5598#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {5598#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:40,838 INFO L290 TraceCheckUtils]: 15: Hoare triple {5598#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} assume !!(foo_~i~0#1 <= foo_~size#1); {5598#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:40,838 INFO L290 TraceCheckUtils]: 16: Hoare triple {5598#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {5598#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:40,839 INFO L290 TraceCheckUtils]: 17: Hoare triple {5598#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {5598#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:40,839 INFO L290 TraceCheckUtils]: 18: Hoare triple {5598#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {5598#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:40,839 INFO L290 TraceCheckUtils]: 19: Hoare triple {5598#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {5598#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:40,840 INFO L290 TraceCheckUtils]: 20: Hoare triple {5598#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} assume !!(foo_~i~0#1 <= foo_~size#1); {5598#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:40,840 INFO L290 TraceCheckUtils]: 21: Hoare triple {5598#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {5598#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:40,840 INFO L290 TraceCheckUtils]: 22: Hoare triple {5598#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {5598#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:40,841 INFO L290 TraceCheckUtils]: 23: Hoare triple {5598#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {5598#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:40,841 INFO L290 TraceCheckUtils]: 24: Hoare triple {5598#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {5598#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:40,841 INFO L290 TraceCheckUtils]: 25: Hoare triple {5598#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} assume !(foo_~i~0#1 <= foo_~size#1); {5598#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:40,842 INFO L290 TraceCheckUtils]: 26: Hoare triple {5598#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} foo_#res#1 := foo_~i~0#1; {5598#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:40,842 INFO L290 TraceCheckUtils]: 27: Hoare triple {5598#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {5598#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:40,842 INFO L290 TraceCheckUtils]: 28: Hoare triple {5598#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {5598#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:40,843 INFO L290 TraceCheckUtils]: 29: Hoare triple {5598#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} havoc main_#t~ret3#1; {5598#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:40,843 INFO L290 TraceCheckUtils]: 30: Hoare triple {5598#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {5599#(and (<= |ULTIMATE.start_main_~i~1#1| 2) (not (<= (+ (div |ULTIMATE.start_main_~i~1#1| 4294967296) 1) 0)))} is VALID [2022-02-20 23:49:40,844 INFO L290 TraceCheckUtils]: 31: Hoare triple {5599#(and (<= |ULTIMATE.start_main_~i~1#1| 2) (not (<= (+ (div |ULTIMATE.start_main_~i~1#1| 4294967296) 1) 0)))} assume !(main_~i~1#1 % 4294967296 < 32); {5596#false} is VALID [2022-02-20 23:49:40,844 INFO L290 TraceCheckUtils]: 32: Hoare triple {5596#false} main_~i~1#1 := 0; {5596#false} is VALID [2022-02-20 23:49:40,844 INFO L290 TraceCheckUtils]: 33: Hoare triple {5596#false} assume !!(main_~i~1#1 % 4294967296 < 32); {5596#false} is VALID [2022-02-20 23:49:40,844 INFO L290 TraceCheckUtils]: 34: Hoare triple {5596#false} SUMMARY for call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L30 {5596#false} is VALID [2022-02-20 23:49:40,844 INFO L290 TraceCheckUtils]: 35: Hoare triple {5596#false} assume !(main_#t~mem5#1 != main_~i~1#1);havoc main_#t~mem5#1; {5596#false} is VALID [2022-02-20 23:49:40,844 INFO L290 TraceCheckUtils]: 36: Hoare triple {5596#false} main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {5596#false} is VALID [2022-02-20 23:49:40,844 INFO L290 TraceCheckUtils]: 37: Hoare triple {5596#false} assume !!(main_~i~1#1 % 4294967296 < 32); {5596#false} is VALID [2022-02-20 23:49:40,844 INFO L290 TraceCheckUtils]: 38: Hoare triple {5596#false} assume !(4 + (main_~#b~0#1.offset + 4 * main_~i~1#1) <= #length[main_~#b~0#1.base] && 0 <= main_~#b~0#1.offset + 4 * main_~i~1#1); {5596#false} is VALID [2022-02-20 23:49:40,844 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-20 23:49:40,844 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:49:40,844 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324390065] [2022-02-20 23:49:40,844 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324390065] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:49:40,844 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793566215] [2022-02-20 23:49:40,844 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 23:49:40,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:49:40,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:49:40,868 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:49:40,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-02-20 23:49:40,923 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 23:49:40,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:49:40,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 23:49:40,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:40,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:49:41,318 INFO L290 TraceCheckUtils]: 0: Hoare triple {5595#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {5595#true} is VALID [2022-02-20 23:49:41,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {5595#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(128);call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; {5606#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:41,319 INFO L290 TraceCheckUtils]: 2: Hoare triple {5606#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {5606#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:41,319 INFO L290 TraceCheckUtils]: 3: Hoare triple {5606#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} assume !!(foo_~i~0#1 <= foo_~size#1); {5606#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:41,320 INFO L290 TraceCheckUtils]: 4: Hoare triple {5606#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {5606#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:41,320 INFO L290 TraceCheckUtils]: 5: Hoare triple {5606#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {5606#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:41,320 INFO L290 TraceCheckUtils]: 6: Hoare triple {5606#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {5606#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:41,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {5606#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {5606#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:41,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {5606#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} assume !(foo_~i~0#1 <= foo_~size#1); {5606#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:41,322 INFO L290 TraceCheckUtils]: 9: Hoare triple {5606#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} foo_#res#1 := foo_~i~0#1; {5606#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:41,322 INFO L290 TraceCheckUtils]: 10: Hoare triple {5606#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {5606#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:41,322 INFO L290 TraceCheckUtils]: 11: Hoare triple {5606#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {5606#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:41,323 INFO L290 TraceCheckUtils]: 12: Hoare triple {5606#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} havoc main_#t~ret3#1; {5606#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:41,323 INFO L290 TraceCheckUtils]: 13: Hoare triple {5606#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {5643#(and (<= 1 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:41,324 INFO L290 TraceCheckUtils]: 14: Hoare triple {5643#(and (<= 1 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {5643#(and (<= 1 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:41,324 INFO L290 TraceCheckUtils]: 15: Hoare triple {5643#(and (<= 1 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} assume !!(foo_~i~0#1 <= foo_~size#1); {5643#(and (<= 1 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:41,325 INFO L290 TraceCheckUtils]: 16: Hoare triple {5643#(and (<= 1 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {5643#(and (<= 1 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:41,325 INFO L290 TraceCheckUtils]: 17: Hoare triple {5643#(and (<= 1 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {5643#(and (<= 1 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:41,325 INFO L290 TraceCheckUtils]: 18: Hoare triple {5643#(and (<= 1 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {5643#(and (<= 1 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:41,326 INFO L290 TraceCheckUtils]: 19: Hoare triple {5643#(and (<= 1 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {5643#(and (<= 1 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:41,326 INFO L290 TraceCheckUtils]: 20: Hoare triple {5643#(and (<= 1 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} assume !!(foo_~i~0#1 <= foo_~size#1); {5643#(and (<= 1 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:41,327 INFO L290 TraceCheckUtils]: 21: Hoare triple {5643#(and (<= 1 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {5643#(and (<= 1 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:41,327 INFO L290 TraceCheckUtils]: 22: Hoare triple {5643#(and (<= 1 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {5643#(and (<= 1 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:41,327 INFO L290 TraceCheckUtils]: 23: Hoare triple {5643#(and (<= 1 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {5643#(and (<= 1 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:41,328 INFO L290 TraceCheckUtils]: 24: Hoare triple {5643#(and (<= 1 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {5643#(and (<= 1 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:41,328 INFO L290 TraceCheckUtils]: 25: Hoare triple {5643#(and (<= 1 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} assume !(foo_~i~0#1 <= foo_~size#1); {5643#(and (<= 1 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:41,329 INFO L290 TraceCheckUtils]: 26: Hoare triple {5643#(and (<= 1 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} foo_#res#1 := foo_~i~0#1; {5643#(and (<= 1 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:41,329 INFO L290 TraceCheckUtils]: 27: Hoare triple {5643#(and (<= 1 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {5643#(and (<= 1 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:41,330 INFO L290 TraceCheckUtils]: 28: Hoare triple {5643#(and (<= 1 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {5689#(and (<= 1 (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:41,330 INFO L290 TraceCheckUtils]: 29: Hoare triple {5689#(and (<= 1 (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} havoc main_#t~ret3#1; {5689#(and (<= 1 (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:41,331 INFO L290 TraceCheckUtils]: 30: Hoare triple {5689#(and (<= 1 (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {5689#(and (<= 1 (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:41,331 INFO L290 TraceCheckUtils]: 31: Hoare triple {5689#(and (<= 1 (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} assume !(main_~i~1#1 % 4294967296 < 32); {5689#(and (<= 1 (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:41,331 INFO L290 TraceCheckUtils]: 32: Hoare triple {5689#(and (<= 1 (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} main_~i~1#1 := 0; {5702#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:41,332 INFO L290 TraceCheckUtils]: 33: Hoare triple {5702#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} assume !!(main_~i~1#1 % 4294967296 < 32); {5702#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:41,332 INFO L290 TraceCheckUtils]: 34: Hoare triple {5702#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} SUMMARY for call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L30 {5702#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:41,333 INFO L290 TraceCheckUtils]: 35: Hoare triple {5702#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} assume !(main_#t~mem5#1 != main_~i~1#1);havoc main_#t~mem5#1; {5702#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:41,333 INFO L290 TraceCheckUtils]: 36: Hoare triple {5702#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {5715#(and (= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:41,334 INFO L290 TraceCheckUtils]: 37: Hoare triple {5715#(and (= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} assume !!(main_~i~1#1 % 4294967296 < 32); {5715#(and (= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:41,334 INFO L290 TraceCheckUtils]: 38: Hoare triple {5715#(and (= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} assume !(4 + (main_~#b~0#1.offset + 4 * main_~i~1#1) <= #length[main_~#b~0#1.base] && 0 <= main_~#b~0#1.offset + 4 * main_~i~1#1); {5596#false} is VALID [2022-02-20 23:49:41,335 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 23:49:41,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:49:41,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2022-02-20 23:49:41,805 INFO L290 TraceCheckUtils]: 38: Hoare triple {5722#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} assume !(4 + (main_~#b~0#1.offset + 4 * main_~i~1#1) <= #length[main_~#b~0#1.base] && 0 <= main_~#b~0#1.offset + 4 * main_~i~1#1); {5596#false} is VALID [2022-02-20 23:49:41,815 INFO L290 TraceCheckUtils]: 37: Hoare triple {5722#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} assume !!(main_~i~1#1 % 4294967296 < 32); {5722#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:41,816 INFO L290 TraceCheckUtils]: 36: Hoare triple {5729#(and (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 8) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4)))} main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {5722#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:41,817 INFO L290 TraceCheckUtils]: 35: Hoare triple {5729#(and (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 8) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4)))} assume !(main_#t~mem5#1 != main_~i~1#1);havoc main_#t~mem5#1; {5729#(and (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 8) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4)))} is VALID [2022-02-20 23:49:41,817 INFO L290 TraceCheckUtils]: 34: Hoare triple {5729#(and (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 8) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4)))} SUMMARY for call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L30 {5729#(and (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 8) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4)))} is VALID [2022-02-20 23:49:41,817 INFO L290 TraceCheckUtils]: 33: Hoare triple {5729#(and (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 8) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4)))} assume !!(main_~i~1#1 % 4294967296 < 32); {5729#(and (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 8) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4)))} is VALID [2022-02-20 23:49:41,818 INFO L290 TraceCheckUtils]: 32: Hoare triple {5742#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| 8) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} main_~i~1#1 := 0; {5729#(and (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 8) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4)))} is VALID [2022-02-20 23:49:41,818 INFO L290 TraceCheckUtils]: 31: Hoare triple {5742#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| 8) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} assume !(main_~i~1#1 % 4294967296 < 32); {5742#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| 8) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:41,819 INFO L290 TraceCheckUtils]: 30: Hoare triple {5742#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| 8) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {5742#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| 8) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:41,819 INFO L290 TraceCheckUtils]: 29: Hoare triple {5742#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| 8) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} havoc main_#t~ret3#1; {5742#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| 8) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:41,820 INFO L290 TraceCheckUtils]: 28: Hoare triple {5755#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)) (<= 4 (* |ULTIMATE.start_main_~i~1#1| 4)))} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {5742#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| 8) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:41,820 INFO L290 TraceCheckUtils]: 27: Hoare triple {5755#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)) (<= 4 (* |ULTIMATE.start_main_~i~1#1| 4)))} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {5755#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)) (<= 4 (* |ULTIMATE.start_main_~i~1#1| 4)))} is VALID [2022-02-20 23:49:41,820 INFO L290 TraceCheckUtils]: 26: Hoare triple {5755#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)) (<= 4 (* |ULTIMATE.start_main_~i~1#1| 4)))} foo_#res#1 := foo_~i~0#1; {5755#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)) (<= 4 (* |ULTIMATE.start_main_~i~1#1| 4)))} is VALID [2022-02-20 23:49:41,821 INFO L290 TraceCheckUtils]: 25: Hoare triple {5755#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)) (<= 4 (* |ULTIMATE.start_main_~i~1#1| 4)))} assume !(foo_~i~0#1 <= foo_~size#1); {5755#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)) (<= 4 (* |ULTIMATE.start_main_~i~1#1| 4)))} is VALID [2022-02-20 23:49:41,821 INFO L290 TraceCheckUtils]: 24: Hoare triple {5755#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)) (<= 4 (* |ULTIMATE.start_main_~i~1#1| 4)))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {5755#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)) (<= 4 (* |ULTIMATE.start_main_~i~1#1| 4)))} is VALID [2022-02-20 23:49:41,821 INFO L290 TraceCheckUtils]: 23: Hoare triple {5755#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)) (<= 4 (* |ULTIMATE.start_main_~i~1#1| 4)))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {5755#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)) (<= 4 (* |ULTIMATE.start_main_~i~1#1| 4)))} is VALID [2022-02-20 23:49:41,822 INFO L290 TraceCheckUtils]: 22: Hoare triple {5755#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)) (<= 4 (* |ULTIMATE.start_main_~i~1#1| 4)))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {5755#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)) (<= 4 (* |ULTIMATE.start_main_~i~1#1| 4)))} is VALID [2022-02-20 23:49:41,822 INFO L290 TraceCheckUtils]: 21: Hoare triple {5755#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)) (<= 4 (* |ULTIMATE.start_main_~i~1#1| 4)))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {5755#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)) (<= 4 (* |ULTIMATE.start_main_~i~1#1| 4)))} is VALID [2022-02-20 23:49:41,823 INFO L290 TraceCheckUtils]: 20: Hoare triple {5755#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)) (<= 4 (* |ULTIMATE.start_main_~i~1#1| 4)))} assume !!(foo_~i~0#1 <= foo_~size#1); {5755#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)) (<= 4 (* |ULTIMATE.start_main_~i~1#1| 4)))} is VALID [2022-02-20 23:49:41,823 INFO L290 TraceCheckUtils]: 19: Hoare triple {5755#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)) (<= 4 (* |ULTIMATE.start_main_~i~1#1| 4)))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {5755#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)) (<= 4 (* |ULTIMATE.start_main_~i~1#1| 4)))} is VALID [2022-02-20 23:49:41,823 INFO L290 TraceCheckUtils]: 18: Hoare triple {5755#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)) (<= 4 (* |ULTIMATE.start_main_~i~1#1| 4)))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {5755#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)) (<= 4 (* |ULTIMATE.start_main_~i~1#1| 4)))} is VALID [2022-02-20 23:49:41,824 INFO L290 TraceCheckUtils]: 17: Hoare triple {5755#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)) (<= 4 (* |ULTIMATE.start_main_~i~1#1| 4)))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {5755#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)) (<= 4 (* |ULTIMATE.start_main_~i~1#1| 4)))} is VALID [2022-02-20 23:49:41,824 INFO L290 TraceCheckUtils]: 16: Hoare triple {5755#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)) (<= 4 (* |ULTIMATE.start_main_~i~1#1| 4)))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {5755#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)) (<= 4 (* |ULTIMATE.start_main_~i~1#1| 4)))} is VALID [2022-02-20 23:49:41,824 INFO L290 TraceCheckUtils]: 15: Hoare triple {5755#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)) (<= 4 (* |ULTIMATE.start_main_~i~1#1| 4)))} assume !!(foo_~i~0#1 <= foo_~size#1); {5755#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)) (<= 4 (* |ULTIMATE.start_main_~i~1#1| 4)))} is VALID [2022-02-20 23:49:41,825 INFO L290 TraceCheckUtils]: 14: Hoare triple {5755#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)) (<= 4 (* |ULTIMATE.start_main_~i~1#1| 4)))} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {5755#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)) (<= 4 (* |ULTIMATE.start_main_~i~1#1| 4)))} is VALID [2022-02-20 23:49:41,825 INFO L290 TraceCheckUtils]: 13: Hoare triple {5801#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)))} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {5755#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)) (<= 4 (* |ULTIMATE.start_main_~i~1#1| 4)))} is VALID [2022-02-20 23:49:41,826 INFO L290 TraceCheckUtils]: 12: Hoare triple {5801#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)))} havoc main_#t~ret3#1; {5801#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)))} is VALID [2022-02-20 23:49:41,826 INFO L290 TraceCheckUtils]: 11: Hoare triple {5801#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)))} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {5801#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)))} is VALID [2022-02-20 23:49:41,826 INFO L290 TraceCheckUtils]: 10: Hoare triple {5801#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)))} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {5801#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)))} is VALID [2022-02-20 23:49:41,827 INFO L290 TraceCheckUtils]: 9: Hoare triple {5801#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)))} foo_#res#1 := foo_~i~0#1; {5801#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)))} is VALID [2022-02-20 23:49:41,827 INFO L290 TraceCheckUtils]: 8: Hoare triple {5801#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)))} assume !(foo_~i~0#1 <= foo_~size#1); {5801#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)))} is VALID [2022-02-20 23:49:41,828 INFO L290 TraceCheckUtils]: 7: Hoare triple {5801#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {5801#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)))} is VALID [2022-02-20 23:49:41,828 INFO L290 TraceCheckUtils]: 6: Hoare triple {5801#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {5801#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)))} is VALID [2022-02-20 23:49:41,828 INFO L290 TraceCheckUtils]: 5: Hoare triple {5801#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {5801#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)))} is VALID [2022-02-20 23:49:41,829 INFO L290 TraceCheckUtils]: 4: Hoare triple {5801#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {5801#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)))} is VALID [2022-02-20 23:49:41,829 INFO L290 TraceCheckUtils]: 3: Hoare triple {5801#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)))} assume !!(foo_~i~0#1 <= foo_~size#1); {5801#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)))} is VALID [2022-02-20 23:49:41,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {5801#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)))} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {5801#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)))} is VALID [2022-02-20 23:49:41,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {5595#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(128);call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; {5801#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)))} is VALID [2022-02-20 23:49:41,830 INFO L290 TraceCheckUtils]: 0: Hoare triple {5595#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {5595#true} is VALID [2022-02-20 23:49:41,831 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 23:49:41,831 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793566215] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:49:41,831 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:49:41,831 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2022-02-20 23:49:41,831 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553017845] [2022-02-20 23:49:41,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:49:41,832 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.6) internal successors, (99), 15 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-02-20 23:49:41,832 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:41,832 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 6.6) internal successors, (99), 15 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:41,903 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:41,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 23:49:41,904 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:41,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 23:49:41,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-02-20 23:49:41,904 INFO L87 Difference]: Start difference. First operand 133 states and 149 transitions. Second operand has 15 states, 15 states have (on average 6.6) internal successors, (99), 15 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:42,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:42,336 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2022-02-20 23:49:42,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:49:42,337 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.6) internal successors, (99), 15 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-02-20 23:49:42,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:42,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 6.6) internal successors, (99), 15 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:42,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2022-02-20 23:49:42,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 6.6) internal successors, (99), 15 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:42,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2022-02-20 23:49:42,338 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 81 transitions. [2022-02-20 23:49:42,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:42,402 INFO L225 Difference]: With dead ends: 143 [2022-02-20 23:49:42,402 INFO L226 Difference]: Without dead ends: 143 [2022-02-20 23:49:42,402 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2022-02-20 23:49:42,403 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 159 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:42,403 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 136 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:49:42,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-02-20 23:49:42,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 137. [2022-02-20 23:49:42,405 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:42,405 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand has 137 states, 132 states have (on average 1.1515151515151516) internal successors, (152), 136 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:42,405 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand has 137 states, 132 states have (on average 1.1515151515151516) internal successors, (152), 136 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:42,405 INFO L87 Difference]: Start difference. First operand 143 states. Second operand has 137 states, 132 states have (on average 1.1515151515151516) internal successors, (152), 136 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:42,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:42,407 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2022-02-20 23:49:42,407 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 156 transitions. [2022-02-20 23:49:42,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:42,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:42,407 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 132 states have (on average 1.1515151515151516) internal successors, (152), 136 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 143 states. [2022-02-20 23:49:42,407 INFO L87 Difference]: Start difference. First operand has 137 states, 132 states have (on average 1.1515151515151516) internal successors, (152), 136 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 143 states. [2022-02-20 23:49:42,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:42,409 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2022-02-20 23:49:42,409 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 156 transitions. [2022-02-20 23:49:42,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:42,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:42,409 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:42,409 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:42,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 132 states have (on average 1.1515151515151516) internal successors, (152), 136 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:42,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 152 transitions. [2022-02-20 23:49:42,417 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 152 transitions. Word has length 39 [2022-02-20 23:49:42,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:42,417 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 152 transitions. [2022-02-20 23:49:42,417 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.6) internal successors, (99), 15 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:42,417 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 152 transitions. [2022-02-20 23:49:42,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 23:49:42,417 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:42,417 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2022-02-20 23:49:42,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-02-20 23:49:42,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-02-20 23:49:42,632 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2022-02-20 23:49:42,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:42,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1454957583, now seen corresponding path program 3 times [2022-02-20 23:49:42,632 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:42,632 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941420847] [2022-02-20 23:49:42,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:42,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:42,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:42,751 INFO L290 TraceCheckUtils]: 0: Hoare triple {6414#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {6414#true} is VALID [2022-02-20 23:49:42,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {6414#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(128);call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; {6416#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:42,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {6416#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {6416#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:42,752 INFO L290 TraceCheckUtils]: 3: Hoare triple {6416#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(foo_~i~0#1 <= foo_~size#1); {6416#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:42,752 INFO L290 TraceCheckUtils]: 4: Hoare triple {6416#(= |ULTIMATE.start_main_~i~1#1| 0)} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {6416#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:42,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {6416#(= |ULTIMATE.start_main_~i~1#1| 0)} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {6416#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:42,753 INFO L290 TraceCheckUtils]: 6: Hoare triple {6416#(= |ULTIMATE.start_main_~i~1#1| 0)} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {6416#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:42,753 INFO L290 TraceCheckUtils]: 7: Hoare triple {6416#(= |ULTIMATE.start_main_~i~1#1| 0)} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {6416#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:42,753 INFO L290 TraceCheckUtils]: 8: Hoare triple {6416#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !(foo_~i~0#1 <= foo_~size#1); {6416#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:42,753 INFO L290 TraceCheckUtils]: 9: Hoare triple {6416#(= |ULTIMATE.start_main_~i~1#1| 0)} foo_#res#1 := foo_~i~0#1; {6416#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:42,754 INFO L290 TraceCheckUtils]: 10: Hoare triple {6416#(= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {6416#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:42,754 INFO L290 TraceCheckUtils]: 11: Hoare triple {6416#(= |ULTIMATE.start_main_~i~1#1| 0)} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {6416#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:42,754 INFO L290 TraceCheckUtils]: 12: Hoare triple {6416#(= |ULTIMATE.start_main_~i~1#1| 0)} havoc main_#t~ret3#1; {6416#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:42,754 INFO L290 TraceCheckUtils]: 13: Hoare triple {6416#(= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {6417#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 23:49:42,755 INFO L290 TraceCheckUtils]: 14: Hoare triple {6417#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {6417#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 23:49:42,755 INFO L290 TraceCheckUtils]: 15: Hoare triple {6417#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume !!(foo_~i~0#1 <= foo_~size#1); {6417#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 23:49:42,755 INFO L290 TraceCheckUtils]: 16: Hoare triple {6417#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {6417#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 23:49:42,755 INFO L290 TraceCheckUtils]: 17: Hoare triple {6417#(<= |ULTIMATE.start_main_~i~1#1| 1)} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {6417#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 23:49:42,756 INFO L290 TraceCheckUtils]: 18: Hoare triple {6417#(<= |ULTIMATE.start_main_~i~1#1| 1)} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {6417#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 23:49:42,756 INFO L290 TraceCheckUtils]: 19: Hoare triple {6417#(<= |ULTIMATE.start_main_~i~1#1| 1)} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {6417#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 23:49:42,756 INFO L290 TraceCheckUtils]: 20: Hoare triple {6417#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume !!(foo_~i~0#1 <= foo_~size#1); {6417#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 23:49:42,756 INFO L290 TraceCheckUtils]: 21: Hoare triple {6417#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {6417#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 23:49:42,757 INFO L290 TraceCheckUtils]: 22: Hoare triple {6417#(<= |ULTIMATE.start_main_~i~1#1| 1)} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {6417#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 23:49:42,757 INFO L290 TraceCheckUtils]: 23: Hoare triple {6417#(<= |ULTIMATE.start_main_~i~1#1| 1)} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {6417#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 23:49:42,757 INFO L290 TraceCheckUtils]: 24: Hoare triple {6417#(<= |ULTIMATE.start_main_~i~1#1| 1)} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {6417#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 23:49:42,757 INFO L290 TraceCheckUtils]: 25: Hoare triple {6417#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume !(foo_~i~0#1 <= foo_~size#1); {6417#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 23:49:42,758 INFO L290 TraceCheckUtils]: 26: Hoare triple {6417#(<= |ULTIMATE.start_main_~i~1#1| 1)} foo_#res#1 := foo_~i~0#1; {6417#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 23:49:42,758 INFO L290 TraceCheckUtils]: 27: Hoare triple {6417#(<= |ULTIMATE.start_main_~i~1#1| 1)} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {6417#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 23:49:42,758 INFO L290 TraceCheckUtils]: 28: Hoare triple {6417#(<= |ULTIMATE.start_main_~i~1#1| 1)} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {6417#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 23:49:42,758 INFO L290 TraceCheckUtils]: 29: Hoare triple {6417#(<= |ULTIMATE.start_main_~i~1#1| 1)} havoc main_#t~ret3#1; {6417#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 23:49:42,759 INFO L290 TraceCheckUtils]: 30: Hoare triple {6417#(<= |ULTIMATE.start_main_~i~1#1| 1)} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {6418#(<= |ULTIMATE.start_main_~i~1#1| 2)} is VALID [2022-02-20 23:49:42,759 INFO L290 TraceCheckUtils]: 31: Hoare triple {6418#(<= |ULTIMATE.start_main_~i~1#1| 2)} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {6419#(<= |ULTIMATE.start_foo_~size#1| 2)} is VALID [2022-02-20 23:49:42,760 INFO L290 TraceCheckUtils]: 32: Hoare triple {6419#(<= |ULTIMATE.start_foo_~size#1| 2)} assume !!(foo_~i~0#1 <= foo_~size#1); {6419#(<= |ULTIMATE.start_foo_~size#1| 2)} is VALID [2022-02-20 23:49:42,760 INFO L290 TraceCheckUtils]: 33: Hoare triple {6419#(<= |ULTIMATE.start_foo_~size#1| 2)} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {6419#(<= |ULTIMATE.start_foo_~size#1| 2)} is VALID [2022-02-20 23:49:42,760 INFO L290 TraceCheckUtils]: 34: Hoare triple {6419#(<= |ULTIMATE.start_foo_~size#1| 2)} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {6419#(<= |ULTIMATE.start_foo_~size#1| 2)} is VALID [2022-02-20 23:49:42,760 INFO L290 TraceCheckUtils]: 35: Hoare triple {6419#(<= |ULTIMATE.start_foo_~size#1| 2)} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {6419#(<= |ULTIMATE.start_foo_~size#1| 2)} is VALID [2022-02-20 23:49:42,761 INFO L290 TraceCheckUtils]: 36: Hoare triple {6419#(<= |ULTIMATE.start_foo_~size#1| 2)} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {6419#(<= |ULTIMATE.start_foo_~size#1| 2)} is VALID [2022-02-20 23:49:42,761 INFO L290 TraceCheckUtils]: 37: Hoare triple {6419#(<= |ULTIMATE.start_foo_~size#1| 2)} assume !!(foo_~i~0#1 <= foo_~size#1); {6419#(<= |ULTIMATE.start_foo_~size#1| 2)} is VALID [2022-02-20 23:49:42,761 INFO L290 TraceCheckUtils]: 38: Hoare triple {6419#(<= |ULTIMATE.start_foo_~size#1| 2)} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {6420#(<= |ULTIMATE.start_foo_~size#1| (+ |ULTIMATE.start_foo_~i~0#1| 2))} is VALID [2022-02-20 23:49:42,762 INFO L290 TraceCheckUtils]: 39: Hoare triple {6420#(<= |ULTIMATE.start_foo_~size#1| (+ |ULTIMATE.start_foo_~i~0#1| 2))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {6420#(<= |ULTIMATE.start_foo_~size#1| (+ |ULTIMATE.start_foo_~i~0#1| 2))} is VALID [2022-02-20 23:49:42,762 INFO L290 TraceCheckUtils]: 40: Hoare triple {6420#(<= |ULTIMATE.start_foo_~size#1| (+ |ULTIMATE.start_foo_~i~0#1| 2))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {6420#(<= |ULTIMATE.start_foo_~size#1| (+ |ULTIMATE.start_foo_~i~0#1| 2))} is VALID [2022-02-20 23:49:42,762 INFO L290 TraceCheckUtils]: 41: Hoare triple {6420#(<= |ULTIMATE.start_foo_~size#1| (+ |ULTIMATE.start_foo_~i~0#1| 2))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {6421#(<= |ULTIMATE.start_foo_~size#1| (+ |ULTIMATE.start_foo_~i~0#1| 1))} is VALID [2022-02-20 23:49:42,762 INFO L290 TraceCheckUtils]: 42: Hoare triple {6421#(<= |ULTIMATE.start_foo_~size#1| (+ |ULTIMATE.start_foo_~i~0#1| 1))} assume !!(foo_~i~0#1 <= foo_~size#1); {6421#(<= |ULTIMATE.start_foo_~size#1| (+ |ULTIMATE.start_foo_~i~0#1| 1))} is VALID [2022-02-20 23:49:42,763 INFO L290 TraceCheckUtils]: 43: Hoare triple {6421#(<= |ULTIMATE.start_foo_~size#1| (+ |ULTIMATE.start_foo_~i~0#1| 1))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {6421#(<= |ULTIMATE.start_foo_~size#1| (+ |ULTIMATE.start_foo_~i~0#1| 1))} is VALID [2022-02-20 23:49:42,763 INFO L290 TraceCheckUtils]: 44: Hoare triple {6421#(<= |ULTIMATE.start_foo_~size#1| (+ |ULTIMATE.start_foo_~i~0#1| 1))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {6421#(<= |ULTIMATE.start_foo_~size#1| (+ |ULTIMATE.start_foo_~i~0#1| 1))} is VALID [2022-02-20 23:49:42,763 INFO L290 TraceCheckUtils]: 45: Hoare triple {6421#(<= |ULTIMATE.start_foo_~size#1| (+ |ULTIMATE.start_foo_~i~0#1| 1))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {6421#(<= |ULTIMATE.start_foo_~size#1| (+ |ULTIMATE.start_foo_~i~0#1| 1))} is VALID [2022-02-20 23:49:42,764 INFO L290 TraceCheckUtils]: 46: Hoare triple {6421#(<= |ULTIMATE.start_foo_~size#1| (+ |ULTIMATE.start_foo_~i~0#1| 1))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {6422#(<= |ULTIMATE.start_foo_~size#1| |ULTIMATE.start_foo_~i~0#1|)} is VALID [2022-02-20 23:49:42,764 INFO L290 TraceCheckUtils]: 47: Hoare triple {6422#(<= |ULTIMATE.start_foo_~size#1| |ULTIMATE.start_foo_~i~0#1|)} assume !!(foo_~i~0#1 <= foo_~size#1); {6422#(<= |ULTIMATE.start_foo_~size#1| |ULTIMATE.start_foo_~i~0#1|)} is VALID [2022-02-20 23:49:42,764 INFO L290 TraceCheckUtils]: 48: Hoare triple {6422#(<= |ULTIMATE.start_foo_~size#1| |ULTIMATE.start_foo_~i~0#1|)} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {6422#(<= |ULTIMATE.start_foo_~size#1| |ULTIMATE.start_foo_~i~0#1|)} is VALID [2022-02-20 23:49:42,764 INFO L290 TraceCheckUtils]: 49: Hoare triple {6422#(<= |ULTIMATE.start_foo_~size#1| |ULTIMATE.start_foo_~i~0#1|)} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {6422#(<= |ULTIMATE.start_foo_~size#1| |ULTIMATE.start_foo_~i~0#1|)} is VALID [2022-02-20 23:49:42,765 INFO L290 TraceCheckUtils]: 50: Hoare triple {6422#(<= |ULTIMATE.start_foo_~size#1| |ULTIMATE.start_foo_~i~0#1|)} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {6422#(<= |ULTIMATE.start_foo_~size#1| |ULTIMATE.start_foo_~i~0#1|)} is VALID [2022-02-20 23:49:42,765 INFO L290 TraceCheckUtils]: 51: Hoare triple {6422#(<= |ULTIMATE.start_foo_~size#1| |ULTIMATE.start_foo_~i~0#1|)} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {6423#(<= (+ |ULTIMATE.start_foo_~size#1| 1) |ULTIMATE.start_foo_~i~0#1|)} is VALID [2022-02-20 23:49:42,765 INFO L290 TraceCheckUtils]: 52: Hoare triple {6423#(<= (+ |ULTIMATE.start_foo_~size#1| 1) |ULTIMATE.start_foo_~i~0#1|)} assume !!(foo_~i~0#1 <= foo_~size#1); {6415#false} is VALID [2022-02-20 23:49:42,765 INFO L290 TraceCheckUtils]: 53: Hoare triple {6415#false} assume !(0 <= foo_~i~0#1 && foo_~i~0#1 < 32); {6415#false} is VALID [2022-02-20 23:49:42,766 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 20 proven. 114 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-20 23:49:42,766 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:49:42,767 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941420847] [2022-02-20 23:49:42,767 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941420847] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:49:42,767 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851066064] [2022-02-20 23:49:42,768 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 23:49:42,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:49:42,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:49:42,769 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:49:42,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-02-20 23:49:42,828 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-20 23:49:42,828 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:49:42,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 22 conjunts are in the unsatisfiable core [2022-02-20 23:49:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:42,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:49:42,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-02-20 23:49:42,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-02-20 23:49:43,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-02-20 23:49:43,722 INFO L290 TraceCheckUtils]: 0: Hoare triple {6414#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {6414#true} is VALID [2022-02-20 23:49:43,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {6414#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(128);call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; {6430#(and (<= (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) 128) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:43,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {6430#(and (<= (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) 128) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {6430#(and (<= (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) 128) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:43,724 INFO L290 TraceCheckUtils]: 3: Hoare triple {6430#(and (<= (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) 128) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} assume !!(foo_~i~0#1 <= foo_~size#1); {6430#(and (<= (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) 128) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:43,724 INFO L290 TraceCheckUtils]: 4: Hoare triple {6430#(and (<= (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) 128) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {6430#(and (<= (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) 128) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:43,725 INFO L290 TraceCheckUtils]: 5: Hoare triple {6430#(and (<= (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) 128) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {6430#(and (<= (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) 128) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:43,725 INFO L290 TraceCheckUtils]: 6: Hoare triple {6430#(and (<= (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) 128) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {6430#(and (<= (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) 128) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:43,725 INFO L290 TraceCheckUtils]: 7: Hoare triple {6430#(and (<= (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) 128) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {6430#(and (<= (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) 128) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:43,726 INFO L290 TraceCheckUtils]: 8: Hoare triple {6430#(and (<= (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) 128) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} assume !(foo_~i~0#1 <= foo_~size#1); {6430#(and (<= (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) 128) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:43,726 INFO L290 TraceCheckUtils]: 9: Hoare triple {6430#(and (<= (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) 128) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} foo_#res#1 := foo_~i~0#1; {6430#(and (<= (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) 128) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:43,726 INFO L290 TraceCheckUtils]: 10: Hoare triple {6430#(and (<= (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) 128) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {6430#(and (<= (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) 128) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:43,727 INFO L290 TraceCheckUtils]: 11: Hoare triple {6430#(and (<= (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) 128) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {6430#(and (<= (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) 128) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:43,727 INFO L290 TraceCheckUtils]: 12: Hoare triple {6430#(and (<= (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) 128) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} havoc main_#t~ret3#1; {6430#(and (<= (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) 128) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:43,727 INFO L290 TraceCheckUtils]: 13: Hoare triple {6430#(and (<= (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) 128) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {6430#(and (<= (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) 128) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:43,728 INFO L290 TraceCheckUtils]: 14: Hoare triple {6430#(and (<= (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) 128) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {6430#(and (<= (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) 128) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:43,728 INFO L290 TraceCheckUtils]: 15: Hoare triple {6430#(and (<= (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) 128) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} assume !!(foo_~i~0#1 <= foo_~size#1); {6430#(and (<= (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) 128) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:43,728 INFO L290 TraceCheckUtils]: 16: Hoare triple {6430#(and (<= (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) 128) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {6430#(and (<= (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) 128) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:43,729 INFO L290 TraceCheckUtils]: 17: Hoare triple {6430#(and (<= (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) 128) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {6430#(and (<= (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) 128) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:43,729 INFO L290 TraceCheckUtils]: 18: Hoare triple {6430#(and (<= (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) 128) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {6430#(and (<= (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) 128) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:43,729 INFO L290 TraceCheckUtils]: 19: Hoare triple {6430#(and (<= (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) 128) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {6430#(and (<= (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) 128) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:43,730 INFO L290 TraceCheckUtils]: 20: Hoare triple {6430#(and (<= (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) 128) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} assume !!(foo_~i~0#1 <= foo_~size#1); {6430#(and (<= (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) 128) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:43,730 INFO L290 TraceCheckUtils]: 21: Hoare triple {6430#(and (<= (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) 128) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {6430#(and (<= (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) 128) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:43,731 INFO L290 TraceCheckUtils]: 22: Hoare triple {6430#(and (<= (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) 128) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {6430#(and (<= (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) 128) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:43,731 INFO L290 TraceCheckUtils]: 23: Hoare triple {6430#(and (<= (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) 128) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {6430#(and (<= (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) 128) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:43,731 INFO L290 TraceCheckUtils]: 24: Hoare triple {6430#(and (<= (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) 128) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {6430#(and (<= (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) 128) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:43,732 INFO L290 TraceCheckUtils]: 25: Hoare triple {6430#(and (<= (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) 128) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} assume !(foo_~i~0#1 <= foo_~size#1); {6430#(and (<= (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) 128) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:43,732 INFO L290 TraceCheckUtils]: 26: Hoare triple {6430#(and (<= (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) 128) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} foo_#res#1 := foo_~i~0#1; {6430#(and (<= (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) 128) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:43,732 INFO L290 TraceCheckUtils]: 27: Hoare triple {6430#(and (<= (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) 128) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {6430#(and (<= (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) 128) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} is VALID [2022-02-20 23:49:43,733 INFO L290 TraceCheckUtils]: 28: Hoare triple {6430#(and (<= (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) 128) (not (= |ULTIMATE.start_main_~#mask~0#1.base| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|))} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {6512#(<= (* |ULTIMATE.start_main_~i~1#1| 4) 124)} is VALID [2022-02-20 23:49:43,733 INFO L290 TraceCheckUtils]: 29: Hoare triple {6512#(<= (* |ULTIMATE.start_main_~i~1#1| 4) 124)} havoc main_#t~ret3#1; {6512#(<= (* |ULTIMATE.start_main_~i~1#1| 4) 124)} is VALID [2022-02-20 23:49:43,733 INFO L290 TraceCheckUtils]: 30: Hoare triple {6512#(<= (* |ULTIMATE.start_main_~i~1#1| 4) 124)} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {6519#(<= |ULTIMATE.start_main_~i~1#1| 32)} is VALID [2022-02-20 23:49:43,734 INFO L290 TraceCheckUtils]: 31: Hoare triple {6519#(<= |ULTIMATE.start_main_~i~1#1| 32)} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} is VALID [2022-02-20 23:49:43,734 INFO L290 TraceCheckUtils]: 32: Hoare triple {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} assume !!(foo_~i~0#1 <= foo_~size#1); {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} is VALID [2022-02-20 23:49:43,735 INFO L290 TraceCheckUtils]: 33: Hoare triple {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} is VALID [2022-02-20 23:49:43,735 INFO L290 TraceCheckUtils]: 34: Hoare triple {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} is VALID [2022-02-20 23:49:43,735 INFO L290 TraceCheckUtils]: 35: Hoare triple {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} is VALID [2022-02-20 23:49:43,735 INFO L290 TraceCheckUtils]: 36: Hoare triple {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} is VALID [2022-02-20 23:49:43,736 INFO L290 TraceCheckUtils]: 37: Hoare triple {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} assume !!(foo_~i~0#1 <= foo_~size#1); {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} is VALID [2022-02-20 23:49:43,736 INFO L290 TraceCheckUtils]: 38: Hoare triple {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} is VALID [2022-02-20 23:49:43,736 INFO L290 TraceCheckUtils]: 39: Hoare triple {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} is VALID [2022-02-20 23:49:43,736 INFO L290 TraceCheckUtils]: 40: Hoare triple {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} is VALID [2022-02-20 23:49:43,737 INFO L290 TraceCheckUtils]: 41: Hoare triple {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} is VALID [2022-02-20 23:49:43,737 INFO L290 TraceCheckUtils]: 42: Hoare triple {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} assume !!(foo_~i~0#1 <= foo_~size#1); {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} is VALID [2022-02-20 23:49:43,737 INFO L290 TraceCheckUtils]: 43: Hoare triple {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} is VALID [2022-02-20 23:49:43,737 INFO L290 TraceCheckUtils]: 44: Hoare triple {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} is VALID [2022-02-20 23:49:43,738 INFO L290 TraceCheckUtils]: 45: Hoare triple {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} is VALID [2022-02-20 23:49:43,738 INFO L290 TraceCheckUtils]: 46: Hoare triple {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} is VALID [2022-02-20 23:49:43,738 INFO L290 TraceCheckUtils]: 47: Hoare triple {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} assume !!(foo_~i~0#1 <= foo_~size#1); {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} is VALID [2022-02-20 23:49:43,738 INFO L290 TraceCheckUtils]: 48: Hoare triple {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {6575#(and (< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:49:43,739 INFO L290 TraceCheckUtils]: 49: Hoare triple {6575#(and (< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {6575#(and (< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:49:43,739 INFO L290 TraceCheckUtils]: 50: Hoare triple {6575#(and (< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {6575#(and (< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:49:43,740 INFO L290 TraceCheckUtils]: 51: Hoare triple {6575#(and (< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {6585#(and (< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:49:43,740 INFO L290 TraceCheckUtils]: 52: Hoare triple {6585#(and (< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} assume !!(foo_~i~0#1 <= foo_~size#1); {6589#(and (< (div (+ (* (- 1) |ULTIMATE.start_foo_~i~0#1|) 31) (- 4294967296)) 1) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:49:43,741 INFO L290 TraceCheckUtils]: 53: Hoare triple {6589#(and (< (div (+ (* (- 1) |ULTIMATE.start_foo_~i~0#1|) 31) (- 4294967296)) 1) (<= 1 |ULTIMATE.start_foo_~i~0#1|))} assume !(0 <= foo_~i~0#1 && foo_~i~0#1 < 32); {6415#false} is VALID [2022-02-20 23:49:43,741 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 13 proven. 84 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-02-20 23:49:43,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:49:51,818 INFO L290 TraceCheckUtils]: 53: Hoare triple {6593#(and (< |ULTIMATE.start_foo_~i~0#1| 32) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} assume !(0 <= foo_~i~0#1 && foo_~i~0#1 < 32); {6415#false} is VALID [2022-02-20 23:49:51,819 INFO L290 TraceCheckUtils]: 52: Hoare triple {6597#(or (and (< |ULTIMATE.start_foo_~i~0#1| 32) (<= 0 |ULTIMATE.start_foo_~i~0#1|)) (not (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|)))} assume !!(foo_~i~0#1 <= foo_~size#1); {6593#(and (< |ULTIMATE.start_foo_~i~0#1| 32) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:49:51,820 INFO L290 TraceCheckUtils]: 51: Hoare triple {6601#(and (or (<= 0 (+ |ULTIMATE.start_foo_~i~0#1| 1)) (< |ULTIMATE.start_foo_~size#1| (+ |ULTIMATE.start_foo_~i~0#1| 1))) (or (< |ULTIMATE.start_foo_~size#1| 32) (< |ULTIMATE.start_foo_~size#1| (+ |ULTIMATE.start_foo_~i~0#1| 1))))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {6597#(or (and (< |ULTIMATE.start_foo_~i~0#1| 32) (<= 0 |ULTIMATE.start_foo_~i~0#1|)) (not (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|)))} is VALID [2022-02-20 23:49:51,820 INFO L290 TraceCheckUtils]: 50: Hoare triple {6601#(and (or (<= 0 (+ |ULTIMATE.start_foo_~i~0#1| 1)) (< |ULTIMATE.start_foo_~size#1| (+ |ULTIMATE.start_foo_~i~0#1| 1))) (or (< |ULTIMATE.start_foo_~size#1| 32) (< |ULTIMATE.start_foo_~size#1| (+ |ULTIMATE.start_foo_~i~0#1| 1))))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {6601#(and (or (<= 0 (+ |ULTIMATE.start_foo_~i~0#1| 1)) (< |ULTIMATE.start_foo_~size#1| (+ |ULTIMATE.start_foo_~i~0#1| 1))) (or (< |ULTIMATE.start_foo_~size#1| 32) (< |ULTIMATE.start_foo_~size#1| (+ |ULTIMATE.start_foo_~i~0#1| 1))))} is VALID [2022-02-20 23:49:51,821 INFO L290 TraceCheckUtils]: 49: Hoare triple {6601#(and (or (<= 0 (+ |ULTIMATE.start_foo_~i~0#1| 1)) (< |ULTIMATE.start_foo_~size#1| (+ |ULTIMATE.start_foo_~i~0#1| 1))) (or (< |ULTIMATE.start_foo_~size#1| 32) (< |ULTIMATE.start_foo_~size#1| (+ |ULTIMATE.start_foo_~i~0#1| 1))))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {6601#(and (or (<= 0 (+ |ULTIMATE.start_foo_~i~0#1| 1)) (< |ULTIMATE.start_foo_~size#1| (+ |ULTIMATE.start_foo_~i~0#1| 1))) (or (< |ULTIMATE.start_foo_~size#1| 32) (< |ULTIMATE.start_foo_~size#1| (+ |ULTIMATE.start_foo_~i~0#1| 1))))} is VALID [2022-02-20 23:49:51,821 INFO L290 TraceCheckUtils]: 48: Hoare triple {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {6601#(and (or (<= 0 (+ |ULTIMATE.start_foo_~i~0#1| 1)) (< |ULTIMATE.start_foo_~size#1| (+ |ULTIMATE.start_foo_~i~0#1| 1))) (or (< |ULTIMATE.start_foo_~size#1| 32) (< |ULTIMATE.start_foo_~size#1| (+ |ULTIMATE.start_foo_~i~0#1| 1))))} is VALID [2022-02-20 23:49:51,822 INFO L290 TraceCheckUtils]: 47: Hoare triple {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} assume !!(foo_~i~0#1 <= foo_~size#1); {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} is VALID [2022-02-20 23:49:51,822 INFO L290 TraceCheckUtils]: 46: Hoare triple {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} is VALID [2022-02-20 23:49:51,822 INFO L290 TraceCheckUtils]: 45: Hoare triple {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} is VALID [2022-02-20 23:49:51,823 INFO L290 TraceCheckUtils]: 44: Hoare triple {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} is VALID [2022-02-20 23:49:51,823 INFO L290 TraceCheckUtils]: 43: Hoare triple {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} is VALID [2022-02-20 23:49:51,823 INFO L290 TraceCheckUtils]: 42: Hoare triple {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} assume !!(foo_~i~0#1 <= foo_~size#1); {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} is VALID [2022-02-20 23:49:51,824 INFO L290 TraceCheckUtils]: 41: Hoare triple {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} is VALID [2022-02-20 23:49:51,824 INFO L290 TraceCheckUtils]: 40: Hoare triple {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} is VALID [2022-02-20 23:49:51,824 INFO L290 TraceCheckUtils]: 39: Hoare triple {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} is VALID [2022-02-20 23:49:51,825 INFO L290 TraceCheckUtils]: 38: Hoare triple {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} is VALID [2022-02-20 23:49:51,825 INFO L290 TraceCheckUtils]: 37: Hoare triple {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} assume !!(foo_~i~0#1 <= foo_~size#1); {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} is VALID [2022-02-20 23:49:51,825 INFO L290 TraceCheckUtils]: 36: Hoare triple {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} is VALID [2022-02-20 23:49:51,826 INFO L290 TraceCheckUtils]: 35: Hoare triple {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} is VALID [2022-02-20 23:49:51,826 INFO L290 TraceCheckUtils]: 34: Hoare triple {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} is VALID [2022-02-20 23:49:51,826 INFO L290 TraceCheckUtils]: 33: Hoare triple {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} is VALID [2022-02-20 23:49:51,827 INFO L290 TraceCheckUtils]: 32: Hoare triple {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} assume !!(foo_~i~0#1 <= foo_~size#1); {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} is VALID [2022-02-20 23:49:51,827 INFO L290 TraceCheckUtils]: 31: Hoare triple {6662#(or (<= (div (+ (* (- 1) |ULTIMATE.start_main_~i~1#1|) (- 4294967265)) (- 4294967296)) 1) (<= 32 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)))} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {6523#(< (div (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) 31) (- 4294967296)) 1)} is VALID [2022-02-20 23:49:51,831 INFO L290 TraceCheckUtils]: 30: Hoare triple {6666#(forall ((|aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| Int) (|aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| Int)) (or (<= |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 1) (not (<= (* |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (+ |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| |ULTIMATE.start_main_~i~1#1| 4294967266))) (> 0 |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83|) (>= |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (<= 32 (mod (+ 31 (* |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967295)) 4294967296))))} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {6662#(or (<= (div (+ (* (- 1) |ULTIMATE.start_main_~i~1#1|) (- 4294967265)) (- 4294967296)) 1) (<= 32 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)))} is VALID [2022-02-20 23:49:51,832 INFO L290 TraceCheckUtils]: 29: Hoare triple {6666#(forall ((|aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| Int) (|aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| Int)) (or (<= |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 1) (not (<= (* |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (+ |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| |ULTIMATE.start_main_~i~1#1| 4294967266))) (> 0 |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83|) (>= |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (<= 32 (mod (+ 31 (* |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967295)) 4294967296))))} havoc main_#t~ret3#1; {6666#(forall ((|aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| Int) (|aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| Int)) (or (<= |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 1) (not (<= (* |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (+ |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| |ULTIMATE.start_main_~i~1#1| 4294967266))) (> 0 |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83|) (>= |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (<= 32 (mod (+ 31 (* |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967295)) 4294967296))))} is VALID [2022-02-20 23:49:51,835 INFO L290 TraceCheckUtils]: 28: Hoare triple {6673#(forall ((|aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| Int) (|aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| Int)) (or (<= |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 1) (> 0 |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83|) (>= |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (< (+ (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4) |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967266) (* |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296)) (<= 32 (mod (+ 31 (* |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967295)) 4294967296))))} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {6666#(forall ((|aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| Int) (|aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| Int)) (or (<= |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 1) (not (<= (* |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (+ |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| |ULTIMATE.start_main_~i~1#1| 4294967266))) (> 0 |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83|) (>= |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (<= 32 (mod (+ 31 (* |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967295)) 4294967296))))} is VALID [2022-02-20 23:49:51,836 INFO L290 TraceCheckUtils]: 27: Hoare triple {6673#(forall ((|aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| Int) (|aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| Int)) (or (<= |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 1) (> 0 |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83|) (>= |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (< (+ (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4) |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967266) (* |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296)) (<= 32 (mod (+ 31 (* |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967295)) 4294967296))))} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {6673#(forall ((|aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| Int) (|aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| Int)) (or (<= |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 1) (> 0 |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83|) (>= |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (< (+ (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4) |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967266) (* |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296)) (<= 32 (mod (+ 31 (* |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967295)) 4294967296))))} is VALID [2022-02-20 23:49:51,836 INFO L290 TraceCheckUtils]: 26: Hoare triple {6673#(forall ((|aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| Int) (|aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| Int)) (or (<= |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 1) (> 0 |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83|) (>= |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (< (+ (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4) |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967266) (* |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296)) (<= 32 (mod (+ 31 (* |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967295)) 4294967296))))} foo_#res#1 := foo_~i~0#1; {6673#(forall ((|aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| Int) (|aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| Int)) (or (<= |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 1) (> 0 |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83|) (>= |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (< (+ (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4) |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967266) (* |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296)) (<= 32 (mod (+ 31 (* |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967295)) 4294967296))))} is VALID [2022-02-20 23:49:51,837 INFO L290 TraceCheckUtils]: 25: Hoare triple {6673#(forall ((|aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| Int) (|aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| Int)) (or (<= |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 1) (> 0 |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83|) (>= |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (< (+ (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4) |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967266) (* |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296)) (<= 32 (mod (+ 31 (* |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967295)) 4294967296))))} assume !(foo_~i~0#1 <= foo_~size#1); {6673#(forall ((|aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| Int) (|aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| Int)) (or (<= |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 1) (> 0 |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83|) (>= |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (< (+ (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4) |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967266) (* |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296)) (<= 32 (mod (+ 31 (* |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967295)) 4294967296))))} is VALID [2022-02-20 23:49:51,837 INFO L290 TraceCheckUtils]: 24: Hoare triple {6673#(forall ((|aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| Int) (|aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| Int)) (or (<= |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 1) (> 0 |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83|) (>= |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (< (+ (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4) |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967266) (* |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296)) (<= 32 (mod (+ 31 (* |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967295)) 4294967296))))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {6673#(forall ((|aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| Int) (|aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| Int)) (or (<= |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 1) (> 0 |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83|) (>= |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (< (+ (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4) |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967266) (* |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296)) (<= 32 (mod (+ 31 (* |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967295)) 4294967296))))} is VALID [2022-02-20 23:49:51,838 INFO L290 TraceCheckUtils]: 23: Hoare triple {6673#(forall ((|aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| Int) (|aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| Int)) (or (<= |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 1) (> 0 |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83|) (>= |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (< (+ (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4) |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967266) (* |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296)) (<= 32 (mod (+ 31 (* |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967295)) 4294967296))))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {6673#(forall ((|aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| Int) (|aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| Int)) (or (<= |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 1) (> 0 |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83|) (>= |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (< (+ (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4) |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967266) (* |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296)) (<= 32 (mod (+ 31 (* |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967295)) 4294967296))))} is VALID [2022-02-20 23:49:51,839 INFO L290 TraceCheckUtils]: 22: Hoare triple {6673#(forall ((|aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| Int) (|aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| Int)) (or (<= |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 1) (> 0 |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83|) (>= |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (< (+ (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4) |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967266) (* |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296)) (<= 32 (mod (+ 31 (* |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967295)) 4294967296))))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {6673#(forall ((|aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| Int) (|aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| Int)) (or (<= |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 1) (> 0 |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83|) (>= |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (< (+ (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4) |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967266) (* |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296)) (<= 32 (mod (+ 31 (* |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967295)) 4294967296))))} is VALID [2022-02-20 23:49:51,839 INFO L290 TraceCheckUtils]: 21: Hoare triple {6673#(forall ((|aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| Int) (|aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| Int)) (or (<= |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 1) (> 0 |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83|) (>= |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (< (+ (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4) |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967266) (* |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296)) (<= 32 (mod (+ 31 (* |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967295)) 4294967296))))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {6673#(forall ((|aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| Int) (|aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| Int)) (or (<= |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 1) (> 0 |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83|) (>= |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (< (+ (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4) |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967266) (* |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296)) (<= 32 (mod (+ 31 (* |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967295)) 4294967296))))} is VALID [2022-02-20 23:49:51,840 INFO L290 TraceCheckUtils]: 20: Hoare triple {6673#(forall ((|aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| Int) (|aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| Int)) (or (<= |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 1) (> 0 |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83|) (>= |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (< (+ (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4) |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967266) (* |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296)) (<= 32 (mod (+ 31 (* |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967295)) 4294967296))))} assume !!(foo_~i~0#1 <= foo_~size#1); {6673#(forall ((|aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| Int) (|aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| Int)) (or (<= |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 1) (> 0 |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83|) (>= |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (< (+ (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4) |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967266) (* |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296)) (<= 32 (mod (+ 31 (* |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967295)) 4294967296))))} is VALID [2022-02-20 23:49:51,841 INFO L290 TraceCheckUtils]: 19: Hoare triple {6673#(forall ((|aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| Int) (|aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| Int)) (or (<= |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 1) (> 0 |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83|) (>= |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (< (+ (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4) |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967266) (* |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296)) (<= 32 (mod (+ 31 (* |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967295)) 4294967296))))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {6673#(forall ((|aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| Int) (|aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| Int)) (or (<= |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 1) (> 0 |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83|) (>= |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (< (+ (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4) |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967266) (* |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296)) (<= 32 (mod (+ 31 (* |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967295)) 4294967296))))} is VALID [2022-02-20 23:49:51,841 INFO L290 TraceCheckUtils]: 18: Hoare triple {6673#(forall ((|aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| Int) (|aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| Int)) (or (<= |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 1) (> 0 |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83|) (>= |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (< (+ (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4) |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967266) (* |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296)) (<= 32 (mod (+ 31 (* |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967295)) 4294967296))))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {6673#(forall ((|aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| Int) (|aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| Int)) (or (<= |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 1) (> 0 |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83|) (>= |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (< (+ (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4) |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967266) (* |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296)) (<= 32 (mod (+ 31 (* |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967295)) 4294967296))))} is VALID [2022-02-20 23:49:51,842 INFO L290 TraceCheckUtils]: 17: Hoare triple {6673#(forall ((|aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| Int) (|aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| Int)) (or (<= |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 1) (> 0 |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83|) (>= |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (< (+ (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4) |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967266) (* |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296)) (<= 32 (mod (+ 31 (* |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967295)) 4294967296))))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {6673#(forall ((|aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| Int) (|aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| Int)) (or (<= |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 1) (> 0 |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83|) (>= |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (< (+ (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4) |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967266) (* |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296)) (<= 32 (mod (+ 31 (* |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967295)) 4294967296))))} is VALID [2022-02-20 23:49:51,843 INFO L290 TraceCheckUtils]: 16: Hoare triple {6673#(forall ((|aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| Int) (|aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| Int)) (or (<= |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 1) (> 0 |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83|) (>= |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (< (+ (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4) |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967266) (* |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296)) (<= 32 (mod (+ 31 (* |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967295)) 4294967296))))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {6673#(forall ((|aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| Int) (|aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| Int)) (or (<= |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 1) (> 0 |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83|) (>= |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (< (+ (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4) |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967266) (* |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296)) (<= 32 (mod (+ 31 (* |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967295)) 4294967296))))} is VALID [2022-02-20 23:49:51,843 INFO L290 TraceCheckUtils]: 15: Hoare triple {6673#(forall ((|aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| Int) (|aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| Int)) (or (<= |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 1) (> 0 |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83|) (>= |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (< (+ (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4) |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967266) (* |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296)) (<= 32 (mod (+ 31 (* |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967295)) 4294967296))))} assume !!(foo_~i~0#1 <= foo_~size#1); {6673#(forall ((|aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| Int) (|aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| Int)) (or (<= |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 1) (> 0 |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83|) (>= |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (< (+ (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4) |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967266) (* |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296)) (<= 32 (mod (+ 31 (* |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967295)) 4294967296))))} is VALID [2022-02-20 23:49:51,844 INFO L290 TraceCheckUtils]: 14: Hoare triple {6673#(forall ((|aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| Int) (|aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| Int)) (or (<= |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 1) (> 0 |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83|) (>= |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (< (+ (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4) |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967266) (* |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296)) (<= 32 (mod (+ 31 (* |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967295)) 4294967296))))} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {6673#(forall ((|aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| Int) (|aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| Int)) (or (<= |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 1) (> 0 |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83|) (>= |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (< (+ (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4) |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967266) (* |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296)) (<= 32 (mod (+ 31 (* |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967295)) 4294967296))))} is VALID [2022-02-20 23:49:51,844 INFO L290 TraceCheckUtils]: 13: Hoare triple {6673#(forall ((|aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| Int) (|aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| Int)) (or (<= |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 1) (> 0 |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83|) (>= |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (< (+ (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4) |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967266) (* |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296)) (<= 32 (mod (+ 31 (* |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967295)) 4294967296))))} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {6673#(forall ((|aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| Int) (|aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| Int)) (or (<= |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 1) (> 0 |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83|) (>= |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (< (+ (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4) |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967266) (* |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296)) (<= 32 (mod (+ 31 (* |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967295)) 4294967296))))} is VALID [2022-02-20 23:49:51,845 INFO L290 TraceCheckUtils]: 12: Hoare triple {6673#(forall ((|aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| Int) (|aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| Int)) (or (<= |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 1) (> 0 |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83|) (>= |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (< (+ (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4) |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967266) (* |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296)) (<= 32 (mod (+ 31 (* |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967295)) 4294967296))))} havoc main_#t~ret3#1; {6673#(forall ((|aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| Int) (|aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| Int)) (or (<= |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 1) (> 0 |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83|) (>= |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (< (+ (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4) |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967266) (* |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296)) (<= 32 (mod (+ 31 (* |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967295)) 4294967296))))} is VALID [2022-02-20 23:49:51,846 INFO L290 TraceCheckUtils]: 11: Hoare triple {6673#(forall ((|aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| Int) (|aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| Int)) (or (<= |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 1) (> 0 |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83|) (>= |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (< (+ (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4) |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967266) (* |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296)) (<= 32 (mod (+ 31 (* |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967295)) 4294967296))))} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {6673#(forall ((|aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| Int) (|aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| Int)) (or (<= |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 1) (> 0 |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83|) (>= |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (< (+ (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4) |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967266) (* |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296)) (<= 32 (mod (+ 31 (* |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967295)) 4294967296))))} is VALID [2022-02-20 23:49:51,846 INFO L290 TraceCheckUtils]: 10: Hoare triple {6673#(forall ((|aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| Int) (|aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| Int)) (or (<= |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 1) (> 0 |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83|) (>= |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (< (+ (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4) |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967266) (* |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296)) (<= 32 (mod (+ 31 (* |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967295)) 4294967296))))} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {6673#(forall ((|aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| Int) (|aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| Int)) (or (<= |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 1) (> 0 |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83|) (>= |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (< (+ (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4) |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967266) (* |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296)) (<= 32 (mod (+ 31 (* |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967295)) 4294967296))))} is VALID [2022-02-20 23:49:51,847 INFO L290 TraceCheckUtils]: 9: Hoare triple {6673#(forall ((|aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| Int) (|aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| Int)) (or (<= |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 1) (> 0 |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83|) (>= |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (< (+ (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4) |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967266) (* |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296)) (<= 32 (mod (+ 31 (* |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967295)) 4294967296))))} foo_#res#1 := foo_~i~0#1; {6673#(forall ((|aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| Int) (|aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| Int)) (or (<= |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 1) (> 0 |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83|) (>= |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (< (+ (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4) |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967266) (* |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296)) (<= 32 (mod (+ 31 (* |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967295)) 4294967296))))} is VALID [2022-02-20 23:49:51,848 INFO L290 TraceCheckUtils]: 8: Hoare triple {6673#(forall ((|aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| Int) (|aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| Int)) (or (<= |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 1) (> 0 |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83|) (>= |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (< (+ (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4) |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967266) (* |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296)) (<= 32 (mod (+ 31 (* |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967295)) 4294967296))))} assume !(foo_~i~0#1 <= foo_~size#1); {6673#(forall ((|aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| Int) (|aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| Int)) (or (<= |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 1) (> 0 |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83|) (>= |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (< (+ (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4) |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967266) (* |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296)) (<= 32 (mod (+ 31 (* |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967295)) 4294967296))))} is VALID [2022-02-20 23:49:51,848 INFO L290 TraceCheckUtils]: 7: Hoare triple {6673#(forall ((|aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| Int) (|aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| Int)) (or (<= |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 1) (> 0 |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83|) (>= |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (< (+ (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4) |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967266) (* |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296)) (<= 32 (mod (+ 31 (* |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967295)) 4294967296))))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {6673#(forall ((|aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| Int) (|aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| Int)) (or (<= |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 1) (> 0 |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83|) (>= |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (< (+ (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4) |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967266) (* |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296)) (<= 32 (mod (+ 31 (* |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967295)) 4294967296))))} is VALID [2022-02-20 23:49:51,849 INFO L290 TraceCheckUtils]: 6: Hoare triple {6673#(forall ((|aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| Int) (|aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| Int)) (or (<= |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 1) (> 0 |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83|) (>= |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (< (+ (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4) |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967266) (* |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296)) (<= 32 (mod (+ 31 (* |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967295)) 4294967296))))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {6673#(forall ((|aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| Int) (|aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| Int)) (or (<= |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 1) (> 0 |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83|) (>= |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (< (+ (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4) |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967266) (* |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296)) (<= 32 (mod (+ 31 (* |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967295)) 4294967296))))} is VALID [2022-02-20 23:49:51,850 INFO L290 TraceCheckUtils]: 5: Hoare triple {6673#(forall ((|aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| Int) (|aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| Int)) (or (<= |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 1) (> 0 |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83|) (>= |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (< (+ (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4) |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967266) (* |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296)) (<= 32 (mod (+ 31 (* |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967295)) 4294967296))))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {6673#(forall ((|aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| Int) (|aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| Int)) (or (<= |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 1) (> 0 |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83|) (>= |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (< (+ (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4) |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967266) (* |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296)) (<= 32 (mod (+ 31 (* |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967295)) 4294967296))))} is VALID [2022-02-20 23:49:51,850 INFO L290 TraceCheckUtils]: 4: Hoare triple {6673#(forall ((|aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| Int) (|aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| Int)) (or (<= |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 1) (> 0 |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83|) (>= |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (< (+ (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4) |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967266) (* |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296)) (<= 32 (mod (+ 31 (* |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967295)) 4294967296))))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {6673#(forall ((|aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| Int) (|aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| Int)) (or (<= |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 1) (> 0 |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83|) (>= |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (< (+ (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4) |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967266) (* |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296)) (<= 32 (mod (+ 31 (* |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967295)) 4294967296))))} is VALID [2022-02-20 23:49:51,851 INFO L290 TraceCheckUtils]: 3: Hoare triple {6673#(forall ((|aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| Int) (|aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| Int)) (or (<= |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 1) (> 0 |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83|) (>= |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (< (+ (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4) |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967266) (* |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296)) (<= 32 (mod (+ 31 (* |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967295)) 4294967296))))} assume !!(foo_~i~0#1 <= foo_~size#1); {6673#(forall ((|aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| Int) (|aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| Int)) (or (<= |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 1) (> 0 |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83|) (>= |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (< (+ (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4) |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967266) (* |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296)) (<= 32 (mod (+ 31 (* |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967295)) 4294967296))))} is VALID [2022-02-20 23:49:51,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {6673#(forall ((|aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| Int) (|aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| Int)) (or (<= |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 1) (> 0 |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83|) (>= |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (< (+ (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4) |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967266) (* |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296)) (<= 32 (mod (+ 31 (* |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967295)) 4294967296))))} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {6673#(forall ((|aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| Int) (|aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| Int)) (or (<= |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 1) (> 0 |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83|) (>= |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (< (+ (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4) |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967266) (* |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296)) (<= 32 (mod (+ 31 (* |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967295)) 4294967296))))} is VALID [2022-02-20 23:49:51,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {6414#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(128);call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; {6673#(forall ((|aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| Int) (|aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| Int)) (or (<= |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 1) (> 0 |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83|) (>= |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296) (< (+ (div (+ (- 4) (* (- 1) |ULTIMATE.start_main_~#b~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) 4) |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967266) (* |aux_div_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967296)) (<= 32 (mod (+ 31 (* |aux_mod_v_ULTIMATE.start_main_~i~1#1_45_83| 4294967295)) 4294967296))))} is VALID [2022-02-20 23:49:51,853 INFO L290 TraceCheckUtils]: 0: Hoare triple {6414#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {6414#true} is VALID [2022-02-20 23:49:51,854 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-02-20 23:49:51,854 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851066064] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:49:51,854 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:49:51,854 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 23 [2022-02-20 23:49:51,854 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607444898] [2022-02-20 23:49:51,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:49:51,855 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.304347826086956) internal successors, (99), 23 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 23:49:51,855 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:51,855 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 4.304347826086956) internal successors, (99), 23 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:51,961 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:51,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-02-20 23:49:51,961 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:51,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-02-20 23:49:51,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-02-20 23:49:51,962 INFO L87 Difference]: Start difference. First operand 137 states and 152 transitions. Second operand has 23 states, 23 states have (on average 4.304347826086956) internal successors, (99), 23 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:53,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:53,437 INFO L93 Difference]: Finished difference Result 163 states and 173 transitions. [2022-02-20 23:49:53,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-20 23:49:53,437 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.304347826086956) internal successors, (99), 23 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 23:49:53,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:53,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 4.304347826086956) internal successors, (99), 23 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:53,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 130 transitions. [2022-02-20 23:49:53,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 4.304347826086956) internal successors, (99), 23 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:53,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 130 transitions. [2022-02-20 23:49:53,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 130 transitions. [2022-02-20 23:49:53,545 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:53,547 INFO L225 Difference]: With dead ends: 163 [2022-02-20 23:49:53,547 INFO L226 Difference]: Without dead ends: 163 [2022-02-20 23:49:53,548 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=685, Invalid=1865, Unknown=0, NotChecked=0, Total=2550 [2022-02-20 23:49:53,548 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 722 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:53,548 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [722 Valid, 49 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 207 Invalid, 0 Unknown, 23 Unchecked, 0.3s Time] [2022-02-20 23:49:53,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-02-20 23:49:53,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 129. [2022-02-20 23:49:53,550 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:53,551 INFO L82 GeneralOperation]: Start isEquivalent. First operand 163 states. Second operand has 129 states, 125 states have (on average 1.112) internal successors, (139), 128 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:53,551 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand has 129 states, 125 states have (on average 1.112) internal successors, (139), 128 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:53,551 INFO L87 Difference]: Start difference. First operand 163 states. Second operand has 129 states, 125 states have (on average 1.112) internal successors, (139), 128 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:53,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:53,553 INFO L93 Difference]: Finished difference Result 163 states and 173 transitions. [2022-02-20 23:49:53,553 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 173 transitions. [2022-02-20 23:49:53,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:53,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:53,553 INFO L74 IsIncluded]: Start isIncluded. First operand has 129 states, 125 states have (on average 1.112) internal successors, (139), 128 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 163 states. [2022-02-20 23:49:53,553 INFO L87 Difference]: Start difference. First operand has 129 states, 125 states have (on average 1.112) internal successors, (139), 128 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 163 states. [2022-02-20 23:49:53,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:53,555 INFO L93 Difference]: Finished difference Result 163 states and 173 transitions. [2022-02-20 23:49:53,555 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 173 transitions. [2022-02-20 23:49:53,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:53,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:53,555 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:53,555 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:53,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 125 states have (on average 1.112) internal successors, (139), 128 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:53,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 139 transitions. [2022-02-20 23:49:53,556 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 139 transitions. Word has length 54 [2022-02-20 23:49:53,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:53,557 INFO L470 AbstractCegarLoop]: Abstraction has 129 states and 139 transitions. [2022-02-20 23:49:53,557 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.304347826086956) internal successors, (99), 23 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:53,557 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 139 transitions. [2022-02-20 23:49:53,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-02-20 23:49:53,557 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:53,557 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2022-02-20 23:49:53,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-02-20 23:49:53,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-02-20 23:49:53,775 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2022-02-20 23:49:53,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:53,776 INFO L85 PathProgramCache]: Analyzing trace with hash -372658966, now seen corresponding path program 3 times [2022-02-20 23:49:53,776 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:53,776 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581056469] [2022-02-20 23:49:53,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:53,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:53,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:53,884 INFO L290 TraceCheckUtils]: 0: Hoare triple {7435#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {7435#true} is VALID [2022-02-20 23:49:53,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {7435#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(128);call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; {7437#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:53,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {7437#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {7437#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:53,885 INFO L290 TraceCheckUtils]: 3: Hoare triple {7437#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(foo_~i~0#1 <= foo_~size#1); {7437#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:53,885 INFO L290 TraceCheckUtils]: 4: Hoare triple {7437#(= |ULTIMATE.start_main_~i~1#1| 0)} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {7437#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:53,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {7437#(= |ULTIMATE.start_main_~i~1#1| 0)} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {7437#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:53,886 INFO L290 TraceCheckUtils]: 6: Hoare triple {7437#(= |ULTIMATE.start_main_~i~1#1| 0)} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {7437#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:53,886 INFO L290 TraceCheckUtils]: 7: Hoare triple {7437#(= |ULTIMATE.start_main_~i~1#1| 0)} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {7437#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:53,886 INFO L290 TraceCheckUtils]: 8: Hoare triple {7437#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !(foo_~i~0#1 <= foo_~size#1); {7437#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:53,886 INFO L290 TraceCheckUtils]: 9: Hoare triple {7437#(= |ULTIMATE.start_main_~i~1#1| 0)} foo_#res#1 := foo_~i~0#1; {7437#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:53,887 INFO L290 TraceCheckUtils]: 10: Hoare triple {7437#(= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {7437#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:53,887 INFO L290 TraceCheckUtils]: 11: Hoare triple {7437#(= |ULTIMATE.start_main_~i~1#1| 0)} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {7437#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:53,887 INFO L290 TraceCheckUtils]: 12: Hoare triple {7437#(= |ULTIMATE.start_main_~i~1#1| 0)} havoc main_#t~ret3#1; {7437#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:53,887 INFO L290 TraceCheckUtils]: 13: Hoare triple {7437#(= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {7438#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:53,888 INFO L290 TraceCheckUtils]: 14: Hoare triple {7438#(<= 1 |ULTIMATE.start_main_~i~1#1|)} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {7438#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:53,888 INFO L290 TraceCheckUtils]: 15: Hoare triple {7438#(<= 1 |ULTIMATE.start_main_~i~1#1|)} assume !!(foo_~i~0#1 <= foo_~size#1); {7438#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:53,888 INFO L290 TraceCheckUtils]: 16: Hoare triple {7438#(<= 1 |ULTIMATE.start_main_~i~1#1|)} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {7438#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:53,888 INFO L290 TraceCheckUtils]: 17: Hoare triple {7438#(<= 1 |ULTIMATE.start_main_~i~1#1|)} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {7438#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:53,889 INFO L290 TraceCheckUtils]: 18: Hoare triple {7438#(<= 1 |ULTIMATE.start_main_~i~1#1|)} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {7438#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:53,889 INFO L290 TraceCheckUtils]: 19: Hoare triple {7438#(<= 1 |ULTIMATE.start_main_~i~1#1|)} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {7438#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:53,889 INFO L290 TraceCheckUtils]: 20: Hoare triple {7438#(<= 1 |ULTIMATE.start_main_~i~1#1|)} assume !!(foo_~i~0#1 <= foo_~size#1); {7438#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:53,889 INFO L290 TraceCheckUtils]: 21: Hoare triple {7438#(<= 1 |ULTIMATE.start_main_~i~1#1|)} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {7438#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:53,890 INFO L290 TraceCheckUtils]: 22: Hoare triple {7438#(<= 1 |ULTIMATE.start_main_~i~1#1|)} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {7438#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:53,890 INFO L290 TraceCheckUtils]: 23: Hoare triple {7438#(<= 1 |ULTIMATE.start_main_~i~1#1|)} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {7438#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:53,890 INFO L290 TraceCheckUtils]: 24: Hoare triple {7438#(<= 1 |ULTIMATE.start_main_~i~1#1|)} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {7438#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:53,890 INFO L290 TraceCheckUtils]: 25: Hoare triple {7438#(<= 1 |ULTIMATE.start_main_~i~1#1|)} assume !(foo_~i~0#1 <= foo_~size#1); {7438#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:53,891 INFO L290 TraceCheckUtils]: 26: Hoare triple {7438#(<= 1 |ULTIMATE.start_main_~i~1#1|)} foo_#res#1 := foo_~i~0#1; {7438#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:53,891 INFO L290 TraceCheckUtils]: 27: Hoare triple {7438#(<= 1 |ULTIMATE.start_main_~i~1#1|)} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {7438#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:53,891 INFO L290 TraceCheckUtils]: 28: Hoare triple {7438#(<= 1 |ULTIMATE.start_main_~i~1#1|)} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {7438#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:53,891 INFO L290 TraceCheckUtils]: 29: Hoare triple {7438#(<= 1 |ULTIMATE.start_main_~i~1#1|)} havoc main_#t~ret3#1; {7438#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:53,892 INFO L290 TraceCheckUtils]: 30: Hoare triple {7438#(<= 1 |ULTIMATE.start_main_~i~1#1|)} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {7439#(<= 2 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:53,892 INFO L290 TraceCheckUtils]: 31: Hoare triple {7439#(<= 2 |ULTIMATE.start_main_~i~1#1|)} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {7440#(and (<= 2 |ULTIMATE.start_main_~i~1#1|) (= (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) |ULTIMATE.start_main_~i~1#1|) 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:49:53,893 INFO L290 TraceCheckUtils]: 32: Hoare triple {7440#(and (<= 2 |ULTIMATE.start_main_~i~1#1|) (= (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) |ULTIMATE.start_main_~i~1#1|) 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} assume !!(foo_~i~0#1 <= foo_~size#1); {7440#(and (<= 2 |ULTIMATE.start_main_~i~1#1|) (= (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) |ULTIMATE.start_main_~i~1#1|) 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:49:53,893 INFO L290 TraceCheckUtils]: 33: Hoare triple {7440#(and (<= 2 |ULTIMATE.start_main_~i~1#1|) (= (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) |ULTIMATE.start_main_~i~1#1|) 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {7440#(and (<= 2 |ULTIMATE.start_main_~i~1#1|) (= (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) |ULTIMATE.start_main_~i~1#1|) 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:49:53,893 INFO L290 TraceCheckUtils]: 34: Hoare triple {7440#(and (<= 2 |ULTIMATE.start_main_~i~1#1|) (= (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) |ULTIMATE.start_main_~i~1#1|) 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {7440#(and (<= 2 |ULTIMATE.start_main_~i~1#1|) (= (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) |ULTIMATE.start_main_~i~1#1|) 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:49:53,894 INFO L290 TraceCheckUtils]: 35: Hoare triple {7440#(and (<= 2 |ULTIMATE.start_main_~i~1#1|) (= (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) |ULTIMATE.start_main_~i~1#1|) 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {7440#(and (<= 2 |ULTIMATE.start_main_~i~1#1|) (= (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) |ULTIMATE.start_main_~i~1#1|) 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:49:53,894 INFO L290 TraceCheckUtils]: 36: Hoare triple {7440#(and (<= 2 |ULTIMATE.start_main_~i~1#1|) (= (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) |ULTIMATE.start_main_~i~1#1|) 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {7441#(and (<= (+ |ULTIMATE.start_foo_~i~0#1| 1) |ULTIMATE.start_main_~i~1#1|) (= (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) |ULTIMATE.start_main_~i~1#1|) 0))} is VALID [2022-02-20 23:49:53,894 INFO L290 TraceCheckUtils]: 37: Hoare triple {7441#(and (<= (+ |ULTIMATE.start_foo_~i~0#1| 1) |ULTIMATE.start_main_~i~1#1|) (= (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) |ULTIMATE.start_main_~i~1#1|) 0))} assume !!(foo_~i~0#1 <= foo_~size#1); {7441#(and (<= (+ |ULTIMATE.start_foo_~i~0#1| 1) |ULTIMATE.start_main_~i~1#1|) (= (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) |ULTIMATE.start_main_~i~1#1|) 0))} is VALID [2022-02-20 23:49:53,895 INFO L290 TraceCheckUtils]: 38: Hoare triple {7441#(and (<= (+ |ULTIMATE.start_foo_~i~0#1| 1) |ULTIMATE.start_main_~i~1#1|) (= (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) |ULTIMATE.start_main_~i~1#1|) 0))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {7441#(and (<= (+ |ULTIMATE.start_foo_~i~0#1| 1) |ULTIMATE.start_main_~i~1#1|) (= (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) |ULTIMATE.start_main_~i~1#1|) 0))} is VALID [2022-02-20 23:49:53,895 INFO L290 TraceCheckUtils]: 39: Hoare triple {7441#(and (<= (+ |ULTIMATE.start_foo_~i~0#1| 1) |ULTIMATE.start_main_~i~1#1|) (= (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) |ULTIMATE.start_main_~i~1#1|) 0))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {7441#(and (<= (+ |ULTIMATE.start_foo_~i~0#1| 1) |ULTIMATE.start_main_~i~1#1|) (= (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) |ULTIMATE.start_main_~i~1#1|) 0))} is VALID [2022-02-20 23:49:53,895 INFO L290 TraceCheckUtils]: 40: Hoare triple {7441#(and (<= (+ |ULTIMATE.start_foo_~i~0#1| 1) |ULTIMATE.start_main_~i~1#1|) (= (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) |ULTIMATE.start_main_~i~1#1|) 0))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {7441#(and (<= (+ |ULTIMATE.start_foo_~i~0#1| 1) |ULTIMATE.start_main_~i~1#1|) (= (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) |ULTIMATE.start_main_~i~1#1|) 0))} is VALID [2022-02-20 23:49:53,896 INFO L290 TraceCheckUtils]: 41: Hoare triple {7441#(and (<= (+ |ULTIMATE.start_foo_~i~0#1| 1) |ULTIMATE.start_main_~i~1#1|) (= (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) |ULTIMATE.start_main_~i~1#1|) 0))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {7442#(and (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_main_~i~1#1|) (= (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) |ULTIMATE.start_main_~i~1#1|) 0))} is VALID [2022-02-20 23:49:53,896 INFO L290 TraceCheckUtils]: 42: Hoare triple {7442#(and (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_main_~i~1#1|) (= (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) |ULTIMATE.start_main_~i~1#1|) 0))} assume !(foo_~i~0#1 <= foo_~size#1); {7436#false} is VALID [2022-02-20 23:49:53,896 INFO L290 TraceCheckUtils]: 43: Hoare triple {7436#false} foo_#res#1 := foo_~i~0#1; {7436#false} is VALID [2022-02-20 23:49:53,896 INFO L290 TraceCheckUtils]: 44: Hoare triple {7436#false} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {7436#false} is VALID [2022-02-20 23:49:53,896 INFO L290 TraceCheckUtils]: 45: Hoare triple {7436#false} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {7436#false} is VALID [2022-02-20 23:49:53,897 INFO L290 TraceCheckUtils]: 46: Hoare triple {7436#false} havoc main_#t~ret3#1; {7436#false} is VALID [2022-02-20 23:49:53,897 INFO L290 TraceCheckUtils]: 47: Hoare triple {7436#false} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {7436#false} is VALID [2022-02-20 23:49:53,897 INFO L290 TraceCheckUtils]: 48: Hoare triple {7436#false} assume !(main_~i~1#1 % 4294967296 < 32); {7436#false} is VALID [2022-02-20 23:49:53,897 INFO L290 TraceCheckUtils]: 49: Hoare triple {7436#false} main_~i~1#1 := 0; {7436#false} is VALID [2022-02-20 23:49:53,897 INFO L290 TraceCheckUtils]: 50: Hoare triple {7436#false} assume !!(main_~i~1#1 % 4294967296 < 32); {7436#false} is VALID [2022-02-20 23:49:53,897 INFO L290 TraceCheckUtils]: 51: Hoare triple {7436#false} SUMMARY for call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L30 {7436#false} is VALID [2022-02-20 23:49:53,897 INFO L290 TraceCheckUtils]: 52: Hoare triple {7436#false} assume !(main_#t~mem5#1 != main_~i~1#1);havoc main_#t~mem5#1; {7436#false} is VALID [2022-02-20 23:49:53,897 INFO L290 TraceCheckUtils]: 53: Hoare triple {7436#false} main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {7436#false} is VALID [2022-02-20 23:49:53,898 INFO L290 TraceCheckUtils]: 54: Hoare triple {7436#false} assume !!(main_~i~1#1 % 4294967296 < 32); {7436#false} is VALID [2022-02-20 23:49:53,898 INFO L290 TraceCheckUtils]: 55: Hoare triple {7436#false} SUMMARY for call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L30 {7436#false} is VALID [2022-02-20 23:49:53,898 INFO L290 TraceCheckUtils]: 56: Hoare triple {7436#false} assume !(main_#t~mem5#1 != main_~i~1#1);havoc main_#t~mem5#1; {7436#false} is VALID [2022-02-20 23:49:53,898 INFO L290 TraceCheckUtils]: 57: Hoare triple {7436#false} main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {7436#false} is VALID [2022-02-20 23:49:53,898 INFO L290 TraceCheckUtils]: 58: Hoare triple {7436#false} assume !!(main_~i~1#1 % 4294967296 < 32); {7436#false} is VALID [2022-02-20 23:49:53,898 INFO L290 TraceCheckUtils]: 59: Hoare triple {7436#false} assume !(4 + (main_~#b~0#1.offset + 4 * main_~i~1#1) <= #length[main_~#b~0#1.base] && 0 <= main_~#b~0#1.offset + 4 * main_~i~1#1); {7436#false} is VALID [2022-02-20 23:49:53,898 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 25 proven. 56 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 23:49:53,898 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:49:53,898 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581056469] [2022-02-20 23:49:53,898 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581056469] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:49:53,898 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526069846] [2022-02-20 23:49:53,898 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 23:49:53,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:49:53,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:49:53,899 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:49:53,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-02-20 23:49:53,960 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-20 23:49:53,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:49:53,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-20 23:49:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:53,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:49:53,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:49:53,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-02-20 23:49:53,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-02-20 23:49:54,335 INFO L290 TraceCheckUtils]: 0: Hoare triple {7435#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {7435#true} is VALID [2022-02-20 23:49:54,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {7435#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(128);call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:54,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:54,337 INFO L290 TraceCheckUtils]: 3: Hoare triple {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} assume !!(foo_~i~0#1 <= foo_~size#1); {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:54,337 INFO L290 TraceCheckUtils]: 4: Hoare triple {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:54,337 INFO L290 TraceCheckUtils]: 5: Hoare triple {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:54,338 INFO L290 TraceCheckUtils]: 6: Hoare triple {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:54,338 INFO L290 TraceCheckUtils]: 7: Hoare triple {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:54,338 INFO L290 TraceCheckUtils]: 8: Hoare triple {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} assume !(foo_~i~0#1 <= foo_~size#1); {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:54,339 INFO L290 TraceCheckUtils]: 9: Hoare triple {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} foo_#res#1 := foo_~i~0#1; {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:54,339 INFO L290 TraceCheckUtils]: 10: Hoare triple {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:54,339 INFO L290 TraceCheckUtils]: 11: Hoare triple {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:54,340 INFO L290 TraceCheckUtils]: 12: Hoare triple {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} havoc main_#t~ret3#1; {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:54,347 INFO L290 TraceCheckUtils]: 13: Hoare triple {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:54,347 INFO L290 TraceCheckUtils]: 14: Hoare triple {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:54,348 INFO L290 TraceCheckUtils]: 15: Hoare triple {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} assume !!(foo_~i~0#1 <= foo_~size#1); {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:54,348 INFO L290 TraceCheckUtils]: 16: Hoare triple {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:54,348 INFO L290 TraceCheckUtils]: 17: Hoare triple {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:54,349 INFO L290 TraceCheckUtils]: 18: Hoare triple {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:54,349 INFO L290 TraceCheckUtils]: 19: Hoare triple {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:54,349 INFO L290 TraceCheckUtils]: 20: Hoare triple {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} assume !!(foo_~i~0#1 <= foo_~size#1); {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:54,350 INFO L290 TraceCheckUtils]: 21: Hoare triple {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:54,350 INFO L290 TraceCheckUtils]: 22: Hoare triple {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:54,350 INFO L290 TraceCheckUtils]: 23: Hoare triple {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:54,351 INFO L290 TraceCheckUtils]: 24: Hoare triple {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:54,351 INFO L290 TraceCheckUtils]: 25: Hoare triple {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} assume !(foo_~i~0#1 <= foo_~size#1); {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:54,351 INFO L290 TraceCheckUtils]: 26: Hoare triple {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} foo_#res#1 := foo_~i~0#1; {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:54,352 INFO L290 TraceCheckUtils]: 27: Hoare triple {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:54,352 INFO L290 TraceCheckUtils]: 28: Hoare triple {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:54,353 INFO L290 TraceCheckUtils]: 29: Hoare triple {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} havoc main_#t~ret3#1; {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:54,354 INFO L290 TraceCheckUtils]: 30: Hoare triple {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:54,354 INFO L290 TraceCheckUtils]: 31: Hoare triple {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:54,354 INFO L290 TraceCheckUtils]: 32: Hoare triple {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} assume !!(foo_~i~0#1 <= foo_~size#1); {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:54,355 INFO L290 TraceCheckUtils]: 33: Hoare triple {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:54,355 INFO L290 TraceCheckUtils]: 34: Hoare triple {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:54,355 INFO L290 TraceCheckUtils]: 35: Hoare triple {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:54,356 INFO L290 TraceCheckUtils]: 36: Hoare triple {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:54,356 INFO L290 TraceCheckUtils]: 37: Hoare triple {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} assume !!(foo_~i~0#1 <= foo_~size#1); {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:54,356 INFO L290 TraceCheckUtils]: 38: Hoare triple {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:54,357 INFO L290 TraceCheckUtils]: 39: Hoare triple {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:54,362 INFO L290 TraceCheckUtils]: 40: Hoare triple {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:54,362 INFO L290 TraceCheckUtils]: 41: Hoare triple {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:54,362 INFO L290 TraceCheckUtils]: 42: Hoare triple {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} assume !(foo_~i~0#1 <= foo_~size#1); {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:54,363 INFO L290 TraceCheckUtils]: 43: Hoare triple {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} foo_#res#1 := foo_~i~0#1; {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:54,363 INFO L290 TraceCheckUtils]: 44: Hoare triple {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:54,363 INFO L290 TraceCheckUtils]: 45: Hoare triple {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:54,364 INFO L290 TraceCheckUtils]: 46: Hoare triple {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} havoc main_#t~ret3#1; {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:54,364 INFO L290 TraceCheckUtils]: 47: Hoare triple {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:54,365 INFO L290 TraceCheckUtils]: 48: Hoare triple {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} assume !(main_~i~1#1 % 4294967296 < 32); {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:54,366 INFO L290 TraceCheckUtils]: 49: Hoare triple {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} main_~i~1#1 := 0; {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:54,366 INFO L290 TraceCheckUtils]: 50: Hoare triple {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} assume !!(main_~i~1#1 % 4294967296 < 32); {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:54,367 INFO L290 TraceCheckUtils]: 51: Hoare triple {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} SUMMARY for call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L30 {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:54,370 INFO L290 TraceCheckUtils]: 52: Hoare triple {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} assume !(main_#t~mem5#1 != main_~i~1#1);havoc main_#t~mem5#1; {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:54,370 INFO L290 TraceCheckUtils]: 53: Hoare triple {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:54,371 INFO L290 TraceCheckUtils]: 54: Hoare triple {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} assume !!(main_~i~1#1 % 4294967296 < 32); {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:54,371 INFO L290 TraceCheckUtils]: 55: Hoare triple {7449#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} SUMMARY for call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L30 {7612#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:54,371 INFO L290 TraceCheckUtils]: 56: Hoare triple {7612#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} assume !(main_#t~mem5#1 != main_~i~1#1);havoc main_#t~mem5#1; {7612#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} is VALID [2022-02-20 23:49:54,372 INFO L290 TraceCheckUtils]: 57: Hoare triple {7612#(and (<= 0 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)))} main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {7619#(and (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4)) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 4 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))))} is VALID [2022-02-20 23:49:54,376 INFO L290 TraceCheckUtils]: 58: Hoare triple {7619#(and (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4)) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 4 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))))} assume !!(main_~i~1#1 % 4294967296 < 32); {7623#(and (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4)) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 4 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) (< (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 32))} is VALID [2022-02-20 23:49:54,377 INFO L290 TraceCheckUtils]: 59: Hoare triple {7623#(and (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4)) (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= 128 (select |#length| |ULTIMATE.start_main_~#b~0#1.base|)) (<= 4 (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) (< (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 32))} assume !(4 + (main_~#b~0#1.offset + 4 * main_~i~1#1) <= #length[main_~#b~0#1.base] && 0 <= main_~#b~0#1.offset + 4 * main_~i~1#1); {7436#false} is VALID [2022-02-20 23:49:54,378 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-02-20 23:49:54,378 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:49:54,378 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526069846] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:49:54,378 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:49:54,378 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2022-02-20 23:49:54,378 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126363009] [2022-02-20 23:49:54,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:49:54,378 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-02-20 23:49:54,378 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:54,378 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:54,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:54,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:49:54,393 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:54,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:49:54,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:49:54,393 INFO L87 Difference]: Start difference. First operand 129 states and 139 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:54,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:54,472 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2022-02-20 23:49:54,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:49:54,473 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-02-20 23:49:54,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:54,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:54,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-02-20 23:49:54,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:54,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-02-20 23:49:54,473 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 42 transitions. [2022-02-20 23:49:54,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:54,504 INFO L225 Difference]: With dead ends: 127 [2022-02-20 23:49:54,504 INFO L226 Difference]: Without dead ends: 127 [2022-02-20 23:49:54,504 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:49:54,505 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 43 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:54,505 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 34 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:49:54,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-02-20 23:49:54,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 95. [2022-02-20 23:49:54,506 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:54,506 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand has 95 states, 93 states have (on average 1.075268817204301) internal successors, (100), 94 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:54,506 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand has 95 states, 93 states have (on average 1.075268817204301) internal successors, (100), 94 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:54,506 INFO L87 Difference]: Start difference. First operand 127 states. Second operand has 95 states, 93 states have (on average 1.075268817204301) internal successors, (100), 94 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:54,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:54,508 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2022-02-20 23:49:54,508 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2022-02-20 23:49:54,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:54,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:54,508 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 93 states have (on average 1.075268817204301) internal successors, (100), 94 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 127 states. [2022-02-20 23:49:54,508 INFO L87 Difference]: Start difference. First operand has 95 states, 93 states have (on average 1.075268817204301) internal successors, (100), 94 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 127 states. [2022-02-20 23:49:54,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:54,509 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2022-02-20 23:49:54,509 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2022-02-20 23:49:54,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:54,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:54,510 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:54,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:54,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 93 states have (on average 1.075268817204301) internal successors, (100), 94 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:54,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2022-02-20 23:49:54,516 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 60 [2022-02-20 23:49:54,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:54,516 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2022-02-20 23:49:54,516 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:54,516 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2022-02-20 23:49:54,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 23:49:54,517 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:54,517 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:54,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-02-20 23:49:54,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:49:54,734 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2022-02-20 23:49:54,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:54,734 INFO L85 PathProgramCache]: Analyzing trace with hash -592408120, now seen corresponding path program 1 times [2022-02-20 23:49:54,734 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:54,735 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180491296] [2022-02-20 23:49:54,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:54,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:54,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:54,827 INFO L290 TraceCheckUtils]: 0: Hoare triple {8102#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {8102#true} is VALID [2022-02-20 23:49:54,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {8102#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(128);call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; {8104#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:54,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {8104#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {8104#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:54,828 INFO L290 TraceCheckUtils]: 3: Hoare triple {8104#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(foo_~i~0#1 <= foo_~size#1); {8104#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:54,828 INFO L290 TraceCheckUtils]: 4: Hoare triple {8104#(= |ULTIMATE.start_main_~i~1#1| 0)} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {8104#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:54,829 INFO L290 TraceCheckUtils]: 5: Hoare triple {8104#(= |ULTIMATE.start_main_~i~1#1| 0)} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {8104#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:54,829 INFO L290 TraceCheckUtils]: 6: Hoare triple {8104#(= |ULTIMATE.start_main_~i~1#1| 0)} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {8104#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:54,829 INFO L290 TraceCheckUtils]: 7: Hoare triple {8104#(= |ULTIMATE.start_main_~i~1#1| 0)} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {8104#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:54,830 INFO L290 TraceCheckUtils]: 8: Hoare triple {8104#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !(foo_~i~0#1 <= foo_~size#1); {8104#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:54,830 INFO L290 TraceCheckUtils]: 9: Hoare triple {8104#(= |ULTIMATE.start_main_~i~1#1| 0)} foo_#res#1 := foo_~i~0#1; {8104#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:54,830 INFO L290 TraceCheckUtils]: 10: Hoare triple {8104#(= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {8104#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:54,831 INFO L290 TraceCheckUtils]: 11: Hoare triple {8104#(= |ULTIMATE.start_main_~i~1#1| 0)} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {8104#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:54,831 INFO L290 TraceCheckUtils]: 12: Hoare triple {8104#(= |ULTIMATE.start_main_~i~1#1| 0)} havoc main_#t~ret3#1; {8104#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:54,832 INFO L290 TraceCheckUtils]: 13: Hoare triple {8104#(= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:54,832 INFO L290 TraceCheckUtils]: 14: Hoare triple {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:54,832 INFO L290 TraceCheckUtils]: 15: Hoare triple {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} assume !!(foo_~i~0#1 <= foo_~size#1); {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:54,833 INFO L290 TraceCheckUtils]: 16: Hoare triple {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:54,833 INFO L290 TraceCheckUtils]: 17: Hoare triple {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:54,833 INFO L290 TraceCheckUtils]: 18: Hoare triple {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:54,834 INFO L290 TraceCheckUtils]: 19: Hoare triple {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:54,834 INFO L290 TraceCheckUtils]: 20: Hoare triple {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} assume !!(foo_~i~0#1 <= foo_~size#1); {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:54,834 INFO L290 TraceCheckUtils]: 21: Hoare triple {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:54,834 INFO L290 TraceCheckUtils]: 22: Hoare triple {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:54,835 INFO L290 TraceCheckUtils]: 23: Hoare triple {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:54,835 INFO L290 TraceCheckUtils]: 24: Hoare triple {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:54,835 INFO L290 TraceCheckUtils]: 25: Hoare triple {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} assume !(foo_~i~0#1 <= foo_~size#1); {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:54,836 INFO L290 TraceCheckUtils]: 26: Hoare triple {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} foo_#res#1 := foo_~i~0#1; {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:54,836 INFO L290 TraceCheckUtils]: 27: Hoare triple {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:54,836 INFO L290 TraceCheckUtils]: 28: Hoare triple {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:54,837 INFO L290 TraceCheckUtils]: 29: Hoare triple {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} havoc main_#t~ret3#1; {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:54,837 INFO L290 TraceCheckUtils]: 30: Hoare triple {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {8106#(<= 2 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:54,838 INFO L290 TraceCheckUtils]: 31: Hoare triple {8106#(<= 2 |ULTIMATE.start_main_~i~1#1|)} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {8107#(and (<= 2 |ULTIMATE.start_main_~i~1#1|) (= (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) |ULTIMATE.start_main_~i~1#1|) 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:49:54,838 INFO L290 TraceCheckUtils]: 32: Hoare triple {8107#(and (<= 2 |ULTIMATE.start_main_~i~1#1|) (= (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) |ULTIMATE.start_main_~i~1#1|) 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} assume !!(foo_~i~0#1 <= foo_~size#1); {8107#(and (<= 2 |ULTIMATE.start_main_~i~1#1|) (= (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) |ULTIMATE.start_main_~i~1#1|) 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:49:54,839 INFO L290 TraceCheckUtils]: 33: Hoare triple {8107#(and (<= 2 |ULTIMATE.start_main_~i~1#1|) (= (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) |ULTIMATE.start_main_~i~1#1|) 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {8107#(and (<= 2 |ULTIMATE.start_main_~i~1#1|) (= (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) |ULTIMATE.start_main_~i~1#1|) 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:49:54,839 INFO L290 TraceCheckUtils]: 34: Hoare triple {8107#(and (<= 2 |ULTIMATE.start_main_~i~1#1|) (= (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) |ULTIMATE.start_main_~i~1#1|) 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {8107#(and (<= 2 |ULTIMATE.start_main_~i~1#1|) (= (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) |ULTIMATE.start_main_~i~1#1|) 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:49:54,840 INFO L290 TraceCheckUtils]: 35: Hoare triple {8107#(and (<= 2 |ULTIMATE.start_main_~i~1#1|) (= (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) |ULTIMATE.start_main_~i~1#1|) 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {8107#(and (<= 2 |ULTIMATE.start_main_~i~1#1|) (= (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) |ULTIMATE.start_main_~i~1#1|) 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} is VALID [2022-02-20 23:49:54,840 INFO L290 TraceCheckUtils]: 36: Hoare triple {8107#(and (<= 2 |ULTIMATE.start_main_~i~1#1|) (= (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) |ULTIMATE.start_main_~i~1#1|) 0) (= |ULTIMATE.start_foo_~i~0#1| 0))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {8108#(and (<= (+ |ULTIMATE.start_foo_~i~0#1| 1) |ULTIMATE.start_main_~i~1#1|) (= (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) |ULTIMATE.start_main_~i~1#1|) 0))} is VALID [2022-02-20 23:49:54,840 INFO L290 TraceCheckUtils]: 37: Hoare triple {8108#(and (<= (+ |ULTIMATE.start_foo_~i~0#1| 1) |ULTIMATE.start_main_~i~1#1|) (= (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) |ULTIMATE.start_main_~i~1#1|) 0))} assume !!(foo_~i~0#1 <= foo_~size#1); {8108#(and (<= (+ |ULTIMATE.start_foo_~i~0#1| 1) |ULTIMATE.start_main_~i~1#1|) (= (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) |ULTIMATE.start_main_~i~1#1|) 0))} is VALID [2022-02-20 23:49:54,841 INFO L290 TraceCheckUtils]: 38: Hoare triple {8108#(and (<= (+ |ULTIMATE.start_foo_~i~0#1| 1) |ULTIMATE.start_main_~i~1#1|) (= (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) |ULTIMATE.start_main_~i~1#1|) 0))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {8108#(and (<= (+ |ULTIMATE.start_foo_~i~0#1| 1) |ULTIMATE.start_main_~i~1#1|) (= (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) |ULTIMATE.start_main_~i~1#1|) 0))} is VALID [2022-02-20 23:49:54,841 INFO L290 TraceCheckUtils]: 39: Hoare triple {8108#(and (<= (+ |ULTIMATE.start_foo_~i~0#1| 1) |ULTIMATE.start_main_~i~1#1|) (= (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) |ULTIMATE.start_main_~i~1#1|) 0))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {8108#(and (<= (+ |ULTIMATE.start_foo_~i~0#1| 1) |ULTIMATE.start_main_~i~1#1|) (= (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) |ULTIMATE.start_main_~i~1#1|) 0))} is VALID [2022-02-20 23:49:54,842 INFO L290 TraceCheckUtils]: 40: Hoare triple {8108#(and (<= (+ |ULTIMATE.start_foo_~i~0#1| 1) |ULTIMATE.start_main_~i~1#1|) (= (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) |ULTIMATE.start_main_~i~1#1|) 0))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {8108#(and (<= (+ |ULTIMATE.start_foo_~i~0#1| 1) |ULTIMATE.start_main_~i~1#1|) (= (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) |ULTIMATE.start_main_~i~1#1|) 0))} is VALID [2022-02-20 23:49:54,842 INFO L290 TraceCheckUtils]: 41: Hoare triple {8108#(and (<= (+ |ULTIMATE.start_foo_~i~0#1| 1) |ULTIMATE.start_main_~i~1#1|) (= (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) |ULTIMATE.start_main_~i~1#1|) 0))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {8109#(and (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_main_~i~1#1|) (= (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) |ULTIMATE.start_main_~i~1#1|) 0))} is VALID [2022-02-20 23:49:54,843 INFO L290 TraceCheckUtils]: 42: Hoare triple {8109#(and (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_main_~i~1#1|) (= (+ (* (- 1) |ULTIMATE.start_foo_~size#1|) |ULTIMATE.start_main_~i~1#1|) 0))} assume !(foo_~i~0#1 <= foo_~size#1); {8103#false} is VALID [2022-02-20 23:49:54,843 INFO L290 TraceCheckUtils]: 43: Hoare triple {8103#false} foo_#res#1 := foo_~i~0#1; {8103#false} is VALID [2022-02-20 23:49:54,843 INFO L290 TraceCheckUtils]: 44: Hoare triple {8103#false} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {8103#false} is VALID [2022-02-20 23:49:54,843 INFO L290 TraceCheckUtils]: 45: Hoare triple {8103#false} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {8103#false} is VALID [2022-02-20 23:49:54,843 INFO L290 TraceCheckUtils]: 46: Hoare triple {8103#false} havoc main_#t~ret3#1; {8103#false} is VALID [2022-02-20 23:49:54,843 INFO L290 TraceCheckUtils]: 47: Hoare triple {8103#false} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {8103#false} is VALID [2022-02-20 23:49:54,843 INFO L290 TraceCheckUtils]: 48: Hoare triple {8103#false} assume !(main_~i~1#1 % 4294967296 < 32); {8103#false} is VALID [2022-02-20 23:49:54,843 INFO L290 TraceCheckUtils]: 49: Hoare triple {8103#false} main_~i~1#1 := 0; {8103#false} is VALID [2022-02-20 23:49:54,844 INFO L290 TraceCheckUtils]: 50: Hoare triple {8103#false} assume !!(main_~i~1#1 % 4294967296 < 32); {8103#false} is VALID [2022-02-20 23:49:54,844 INFO L290 TraceCheckUtils]: 51: Hoare triple {8103#false} SUMMARY for call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L30 {8103#false} is VALID [2022-02-20 23:49:54,844 INFO L290 TraceCheckUtils]: 52: Hoare triple {8103#false} assume !(main_#t~mem5#1 != main_~i~1#1);havoc main_#t~mem5#1; {8103#false} is VALID [2022-02-20 23:49:54,844 INFO L290 TraceCheckUtils]: 53: Hoare triple {8103#false} main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {8103#false} is VALID [2022-02-20 23:49:54,844 INFO L290 TraceCheckUtils]: 54: Hoare triple {8103#false} assume !!(main_~i~1#1 % 4294967296 < 32); {8103#false} is VALID [2022-02-20 23:49:54,844 INFO L290 TraceCheckUtils]: 55: Hoare triple {8103#false} SUMMARY for call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L30 {8103#false} is VALID [2022-02-20 23:49:54,844 INFO L290 TraceCheckUtils]: 56: Hoare triple {8103#false} assume !(main_#t~mem5#1 != main_~i~1#1);havoc main_#t~mem5#1; {8103#false} is VALID [2022-02-20 23:49:54,844 INFO L290 TraceCheckUtils]: 57: Hoare triple {8103#false} main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {8103#false} is VALID [2022-02-20 23:49:54,845 INFO L290 TraceCheckUtils]: 58: Hoare triple {8103#false} assume !!(main_~i~1#1 % 4294967296 < 32); {8103#false} is VALID [2022-02-20 23:49:54,845 INFO L290 TraceCheckUtils]: 59: Hoare triple {8103#false} SUMMARY for call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L30 {8103#false} is VALID [2022-02-20 23:49:54,845 INFO L290 TraceCheckUtils]: 60: Hoare triple {8103#false} assume !(main_#t~mem5#1 != main_~i~1#1);havoc main_#t~mem5#1; {8103#false} is VALID [2022-02-20 23:49:54,845 INFO L290 TraceCheckUtils]: 61: Hoare triple {8103#false} main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {8103#false} is VALID [2022-02-20 23:49:54,845 INFO L290 TraceCheckUtils]: 62: Hoare triple {8103#false} assume !(main_~i~1#1 % 4294967296 < 32); {8103#false} is VALID [2022-02-20 23:49:54,845 INFO L290 TraceCheckUtils]: 63: Hoare triple {8103#false} main_#res#1 := 0;call ULTIMATE.dealloc(main_~#b~0#1.base, main_~#b~0#1.offset);havoc main_~#b~0#1.base, main_~#b~0#1.offset;call ULTIMATE.dealloc(main_~#mask~0#1.base, main_~#mask~0#1.offset);havoc main_~#mask~0#1.base, main_~#mask~0#1.offset; {8103#false} is VALID [2022-02-20 23:49:54,845 INFO L290 TraceCheckUtils]: 64: Hoare triple {8103#false} assume !(#valid == main_old_#valid#1); {8103#false} is VALID [2022-02-20 23:49:54,846 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 25 proven. 56 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-02-20 23:49:54,846 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:49:54,846 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180491296] [2022-02-20 23:49:54,846 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180491296] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:49:54,846 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112902912] [2022-02-20 23:49:54,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:54,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:49:54,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:49:54,860 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:49:54,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-02-20 23:49:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:54,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 23:49:54,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:54,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:49:55,276 INFO L290 TraceCheckUtils]: 0: Hoare triple {8102#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {8102#true} is VALID [2022-02-20 23:49:55,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {8102#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(128);call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; {8116#(<= 0 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {8116#(<= 0 |ULTIMATE.start_main_~i~1#1|)} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {8116#(<= 0 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,277 INFO L290 TraceCheckUtils]: 3: Hoare triple {8116#(<= 0 |ULTIMATE.start_main_~i~1#1|)} assume !!(foo_~i~0#1 <= foo_~size#1); {8116#(<= 0 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,277 INFO L290 TraceCheckUtils]: 4: Hoare triple {8116#(<= 0 |ULTIMATE.start_main_~i~1#1|)} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {8116#(<= 0 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,278 INFO L290 TraceCheckUtils]: 5: Hoare triple {8116#(<= 0 |ULTIMATE.start_main_~i~1#1|)} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {8116#(<= 0 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,278 INFO L290 TraceCheckUtils]: 6: Hoare triple {8116#(<= 0 |ULTIMATE.start_main_~i~1#1|)} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {8116#(<= 0 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,278 INFO L290 TraceCheckUtils]: 7: Hoare triple {8116#(<= 0 |ULTIMATE.start_main_~i~1#1|)} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {8116#(<= 0 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,279 INFO L290 TraceCheckUtils]: 8: Hoare triple {8116#(<= 0 |ULTIMATE.start_main_~i~1#1|)} assume !(foo_~i~0#1 <= foo_~size#1); {8116#(<= 0 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,279 INFO L290 TraceCheckUtils]: 9: Hoare triple {8116#(<= 0 |ULTIMATE.start_main_~i~1#1|)} foo_#res#1 := foo_~i~0#1; {8116#(<= 0 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,279 INFO L290 TraceCheckUtils]: 10: Hoare triple {8116#(<= 0 |ULTIMATE.start_main_~i~1#1|)} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {8116#(<= 0 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,279 INFO L290 TraceCheckUtils]: 11: Hoare triple {8116#(<= 0 |ULTIMATE.start_main_~i~1#1|)} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {8116#(<= 0 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,280 INFO L290 TraceCheckUtils]: 12: Hoare triple {8116#(<= 0 |ULTIMATE.start_main_~i~1#1|)} havoc main_#t~ret3#1; {8116#(<= 0 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,280 INFO L290 TraceCheckUtils]: 13: Hoare triple {8116#(<= 0 |ULTIMATE.start_main_~i~1#1|)} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,280 INFO L290 TraceCheckUtils]: 14: Hoare triple {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,281 INFO L290 TraceCheckUtils]: 15: Hoare triple {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} assume !!(foo_~i~0#1 <= foo_~size#1); {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,281 INFO L290 TraceCheckUtils]: 16: Hoare triple {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,281 INFO L290 TraceCheckUtils]: 17: Hoare triple {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,282 INFO L290 TraceCheckUtils]: 18: Hoare triple {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,282 INFO L290 TraceCheckUtils]: 19: Hoare triple {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,282 INFO L290 TraceCheckUtils]: 20: Hoare triple {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} assume !!(foo_~i~0#1 <= foo_~size#1); {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,282 INFO L290 TraceCheckUtils]: 21: Hoare triple {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,283 INFO L290 TraceCheckUtils]: 22: Hoare triple {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,283 INFO L290 TraceCheckUtils]: 23: Hoare triple {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,283 INFO L290 TraceCheckUtils]: 24: Hoare triple {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,284 INFO L290 TraceCheckUtils]: 25: Hoare triple {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} assume !(foo_~i~0#1 <= foo_~size#1); {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,284 INFO L290 TraceCheckUtils]: 26: Hoare triple {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} foo_#res#1 := foo_~i~0#1; {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,284 INFO L290 TraceCheckUtils]: 27: Hoare triple {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,284 INFO L290 TraceCheckUtils]: 28: Hoare triple {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,285 INFO L290 TraceCheckUtils]: 29: Hoare triple {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} havoc main_#t~ret3#1; {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,285 INFO L290 TraceCheckUtils]: 30: Hoare triple {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {8106#(<= 2 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,286 INFO L290 TraceCheckUtils]: 31: Hoare triple {8106#(<= 2 |ULTIMATE.start_main_~i~1#1|)} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {8207#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 2 |ULTIMATE.start_foo_~size#1|))} is VALID [2022-02-20 23:49:55,286 INFO L290 TraceCheckUtils]: 32: Hoare triple {8207#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 2 |ULTIMATE.start_foo_~size#1|))} assume !!(foo_~i~0#1 <= foo_~size#1); {8207#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 2 |ULTIMATE.start_foo_~size#1|))} is VALID [2022-02-20 23:49:55,286 INFO L290 TraceCheckUtils]: 33: Hoare triple {8207#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 2 |ULTIMATE.start_foo_~size#1|))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {8207#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 2 |ULTIMATE.start_foo_~size#1|))} is VALID [2022-02-20 23:49:55,287 INFO L290 TraceCheckUtils]: 34: Hoare triple {8207#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 2 |ULTIMATE.start_foo_~size#1|))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {8207#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 2 |ULTIMATE.start_foo_~size#1|))} is VALID [2022-02-20 23:49:55,287 INFO L290 TraceCheckUtils]: 35: Hoare triple {8207#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 2 |ULTIMATE.start_foo_~size#1|))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {8207#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 2 |ULTIMATE.start_foo_~size#1|))} is VALID [2022-02-20 23:49:55,288 INFO L290 TraceCheckUtils]: 36: Hoare triple {8207#(and (<= |ULTIMATE.start_foo_~i~0#1| 0) (<= 2 |ULTIMATE.start_foo_~size#1|))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {8223#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 2 |ULTIMATE.start_foo_~size#1|))} is VALID [2022-02-20 23:49:55,288 INFO L290 TraceCheckUtils]: 37: Hoare triple {8223#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 2 |ULTIMATE.start_foo_~size#1|))} assume !!(foo_~i~0#1 <= foo_~size#1); {8223#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 2 |ULTIMATE.start_foo_~size#1|))} is VALID [2022-02-20 23:49:55,288 INFO L290 TraceCheckUtils]: 38: Hoare triple {8223#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 2 |ULTIMATE.start_foo_~size#1|))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {8223#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 2 |ULTIMATE.start_foo_~size#1|))} is VALID [2022-02-20 23:49:55,289 INFO L290 TraceCheckUtils]: 39: Hoare triple {8223#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 2 |ULTIMATE.start_foo_~size#1|))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {8223#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 2 |ULTIMATE.start_foo_~size#1|))} is VALID [2022-02-20 23:49:55,289 INFO L290 TraceCheckUtils]: 40: Hoare triple {8223#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 2 |ULTIMATE.start_foo_~size#1|))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {8223#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 2 |ULTIMATE.start_foo_~size#1|))} is VALID [2022-02-20 23:49:55,290 INFO L290 TraceCheckUtils]: 41: Hoare triple {8223#(and (<= |ULTIMATE.start_foo_~i~0#1| 1) (<= 2 |ULTIMATE.start_foo_~size#1|))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {8239#(and (<= 2 |ULTIMATE.start_foo_~size#1|) (<= |ULTIMATE.start_foo_~i~0#1| 2))} is VALID [2022-02-20 23:49:55,290 INFO L290 TraceCheckUtils]: 42: Hoare triple {8239#(and (<= 2 |ULTIMATE.start_foo_~size#1|) (<= |ULTIMATE.start_foo_~i~0#1| 2))} assume !(foo_~i~0#1 <= foo_~size#1); {8103#false} is VALID [2022-02-20 23:49:55,290 INFO L290 TraceCheckUtils]: 43: Hoare triple {8103#false} foo_#res#1 := foo_~i~0#1; {8103#false} is VALID [2022-02-20 23:49:55,290 INFO L290 TraceCheckUtils]: 44: Hoare triple {8103#false} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {8103#false} is VALID [2022-02-20 23:49:55,290 INFO L290 TraceCheckUtils]: 45: Hoare triple {8103#false} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {8103#false} is VALID [2022-02-20 23:49:55,290 INFO L290 TraceCheckUtils]: 46: Hoare triple {8103#false} havoc main_#t~ret3#1; {8103#false} is VALID [2022-02-20 23:49:55,291 INFO L290 TraceCheckUtils]: 47: Hoare triple {8103#false} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {8103#false} is VALID [2022-02-20 23:49:55,291 INFO L290 TraceCheckUtils]: 48: Hoare triple {8103#false} assume !(main_~i~1#1 % 4294967296 < 32); {8103#false} is VALID [2022-02-20 23:49:55,291 INFO L290 TraceCheckUtils]: 49: Hoare triple {8103#false} main_~i~1#1 := 0; {8103#false} is VALID [2022-02-20 23:49:55,291 INFO L290 TraceCheckUtils]: 50: Hoare triple {8103#false} assume !!(main_~i~1#1 % 4294967296 < 32); {8103#false} is VALID [2022-02-20 23:49:55,291 INFO L290 TraceCheckUtils]: 51: Hoare triple {8103#false} SUMMARY for call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L30 {8103#false} is VALID [2022-02-20 23:49:55,291 INFO L290 TraceCheckUtils]: 52: Hoare triple {8103#false} assume !(main_#t~mem5#1 != main_~i~1#1);havoc main_#t~mem5#1; {8103#false} is VALID [2022-02-20 23:49:55,291 INFO L290 TraceCheckUtils]: 53: Hoare triple {8103#false} main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {8103#false} is VALID [2022-02-20 23:49:55,291 INFO L290 TraceCheckUtils]: 54: Hoare triple {8103#false} assume !!(main_~i~1#1 % 4294967296 < 32); {8103#false} is VALID [2022-02-20 23:49:55,292 INFO L290 TraceCheckUtils]: 55: Hoare triple {8103#false} SUMMARY for call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L30 {8103#false} is VALID [2022-02-20 23:49:55,292 INFO L290 TraceCheckUtils]: 56: Hoare triple {8103#false} assume !(main_#t~mem5#1 != main_~i~1#1);havoc main_#t~mem5#1; {8103#false} is VALID [2022-02-20 23:49:55,292 INFO L290 TraceCheckUtils]: 57: Hoare triple {8103#false} main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {8103#false} is VALID [2022-02-20 23:49:55,292 INFO L290 TraceCheckUtils]: 58: Hoare triple {8103#false} assume !!(main_~i~1#1 % 4294967296 < 32); {8103#false} is VALID [2022-02-20 23:49:55,292 INFO L290 TraceCheckUtils]: 59: Hoare triple {8103#false} SUMMARY for call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L30 {8103#false} is VALID [2022-02-20 23:49:55,292 INFO L290 TraceCheckUtils]: 60: Hoare triple {8103#false} assume !(main_#t~mem5#1 != main_~i~1#1);havoc main_#t~mem5#1; {8103#false} is VALID [2022-02-20 23:49:55,292 INFO L290 TraceCheckUtils]: 61: Hoare triple {8103#false} main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {8103#false} is VALID [2022-02-20 23:49:55,292 INFO L290 TraceCheckUtils]: 62: Hoare triple {8103#false} assume !(main_~i~1#1 % 4294967296 < 32); {8103#false} is VALID [2022-02-20 23:49:55,292 INFO L290 TraceCheckUtils]: 63: Hoare triple {8103#false} main_#res#1 := 0;call ULTIMATE.dealloc(main_~#b~0#1.base, main_~#b~0#1.offset);havoc main_~#b~0#1.base, main_~#b~0#1.offset;call ULTIMATE.dealloc(main_~#mask~0#1.base, main_~#mask~0#1.offset);havoc main_~#mask~0#1.base, main_~#mask~0#1.offset; {8103#false} is VALID [2022-02-20 23:49:55,293 INFO L290 TraceCheckUtils]: 64: Hoare triple {8103#false} assume !(#valid == main_old_#valid#1); {8103#false} is VALID [2022-02-20 23:49:55,293 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 35 proven. 46 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-02-20 23:49:55,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:49:55,588 INFO L290 TraceCheckUtils]: 64: Hoare triple {8103#false} assume !(#valid == main_old_#valid#1); {8103#false} is VALID [2022-02-20 23:49:55,588 INFO L290 TraceCheckUtils]: 63: Hoare triple {8103#false} main_#res#1 := 0;call ULTIMATE.dealloc(main_~#b~0#1.base, main_~#b~0#1.offset);havoc main_~#b~0#1.base, main_~#b~0#1.offset;call ULTIMATE.dealloc(main_~#mask~0#1.base, main_~#mask~0#1.offset);havoc main_~#mask~0#1.base, main_~#mask~0#1.offset; {8103#false} is VALID [2022-02-20 23:49:55,588 INFO L290 TraceCheckUtils]: 62: Hoare triple {8103#false} assume !(main_~i~1#1 % 4294967296 < 32); {8103#false} is VALID [2022-02-20 23:49:55,588 INFO L290 TraceCheckUtils]: 61: Hoare triple {8103#false} main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {8103#false} is VALID [2022-02-20 23:49:55,588 INFO L290 TraceCheckUtils]: 60: Hoare triple {8103#false} assume !(main_#t~mem5#1 != main_~i~1#1);havoc main_#t~mem5#1; {8103#false} is VALID [2022-02-20 23:49:55,588 INFO L290 TraceCheckUtils]: 59: Hoare triple {8103#false} SUMMARY for call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L30 {8103#false} is VALID [2022-02-20 23:49:55,588 INFO L290 TraceCheckUtils]: 58: Hoare triple {8103#false} assume !!(main_~i~1#1 % 4294967296 < 32); {8103#false} is VALID [2022-02-20 23:49:55,589 INFO L290 TraceCheckUtils]: 57: Hoare triple {8103#false} main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {8103#false} is VALID [2022-02-20 23:49:55,589 INFO L290 TraceCheckUtils]: 56: Hoare triple {8103#false} assume !(main_#t~mem5#1 != main_~i~1#1);havoc main_#t~mem5#1; {8103#false} is VALID [2022-02-20 23:49:55,589 INFO L290 TraceCheckUtils]: 55: Hoare triple {8103#false} SUMMARY for call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L30 {8103#false} is VALID [2022-02-20 23:49:55,589 INFO L290 TraceCheckUtils]: 54: Hoare triple {8103#false} assume !!(main_~i~1#1 % 4294967296 < 32); {8103#false} is VALID [2022-02-20 23:49:55,589 INFO L290 TraceCheckUtils]: 53: Hoare triple {8103#false} main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {8103#false} is VALID [2022-02-20 23:49:55,589 INFO L290 TraceCheckUtils]: 52: Hoare triple {8103#false} assume !(main_#t~mem5#1 != main_~i~1#1);havoc main_#t~mem5#1; {8103#false} is VALID [2022-02-20 23:49:55,589 INFO L290 TraceCheckUtils]: 51: Hoare triple {8103#false} SUMMARY for call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L30 {8103#false} is VALID [2022-02-20 23:49:55,589 INFO L290 TraceCheckUtils]: 50: Hoare triple {8103#false} assume !!(main_~i~1#1 % 4294967296 < 32); {8103#false} is VALID [2022-02-20 23:49:55,589 INFO L290 TraceCheckUtils]: 49: Hoare triple {8103#false} main_~i~1#1 := 0; {8103#false} is VALID [2022-02-20 23:49:55,590 INFO L290 TraceCheckUtils]: 48: Hoare triple {8103#false} assume !(main_~i~1#1 % 4294967296 < 32); {8103#false} is VALID [2022-02-20 23:49:55,590 INFO L290 TraceCheckUtils]: 47: Hoare triple {8103#false} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {8103#false} is VALID [2022-02-20 23:49:55,590 INFO L290 TraceCheckUtils]: 46: Hoare triple {8103#false} havoc main_#t~ret3#1; {8103#false} is VALID [2022-02-20 23:49:55,590 INFO L290 TraceCheckUtils]: 45: Hoare triple {8103#false} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {8103#false} is VALID [2022-02-20 23:49:55,590 INFO L290 TraceCheckUtils]: 44: Hoare triple {8103#false} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {8103#false} is VALID [2022-02-20 23:49:55,590 INFO L290 TraceCheckUtils]: 43: Hoare triple {8103#false} foo_#res#1 := foo_~i~0#1; {8103#false} is VALID [2022-02-20 23:49:55,591 INFO L290 TraceCheckUtils]: 42: Hoare triple {8375#(<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|)} assume !(foo_~i~0#1 <= foo_~size#1); {8103#false} is VALID [2022-02-20 23:49:55,591 INFO L290 TraceCheckUtils]: 41: Hoare triple {8379#(<= (+ |ULTIMATE.start_foo_~i~0#1| 1) |ULTIMATE.start_foo_~size#1|)} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {8375#(<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|)} is VALID [2022-02-20 23:49:55,591 INFO L290 TraceCheckUtils]: 40: Hoare triple {8379#(<= (+ |ULTIMATE.start_foo_~i~0#1| 1) |ULTIMATE.start_foo_~size#1|)} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {8379#(<= (+ |ULTIMATE.start_foo_~i~0#1| 1) |ULTIMATE.start_foo_~size#1|)} is VALID [2022-02-20 23:49:55,592 INFO L290 TraceCheckUtils]: 39: Hoare triple {8379#(<= (+ |ULTIMATE.start_foo_~i~0#1| 1) |ULTIMATE.start_foo_~size#1|)} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {8379#(<= (+ |ULTIMATE.start_foo_~i~0#1| 1) |ULTIMATE.start_foo_~size#1|)} is VALID [2022-02-20 23:49:55,592 INFO L290 TraceCheckUtils]: 38: Hoare triple {8379#(<= (+ |ULTIMATE.start_foo_~i~0#1| 1) |ULTIMATE.start_foo_~size#1|)} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {8379#(<= (+ |ULTIMATE.start_foo_~i~0#1| 1) |ULTIMATE.start_foo_~size#1|)} is VALID [2022-02-20 23:49:55,592 INFO L290 TraceCheckUtils]: 37: Hoare triple {8379#(<= (+ |ULTIMATE.start_foo_~i~0#1| 1) |ULTIMATE.start_foo_~size#1|)} assume !!(foo_~i~0#1 <= foo_~size#1); {8379#(<= (+ |ULTIMATE.start_foo_~i~0#1| 1) |ULTIMATE.start_foo_~size#1|)} is VALID [2022-02-20 23:49:55,593 INFO L290 TraceCheckUtils]: 36: Hoare triple {8395#(<= (+ |ULTIMATE.start_foo_~i~0#1| 2) |ULTIMATE.start_foo_~size#1|)} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {8379#(<= (+ |ULTIMATE.start_foo_~i~0#1| 1) |ULTIMATE.start_foo_~size#1|)} is VALID [2022-02-20 23:49:55,593 INFO L290 TraceCheckUtils]: 35: Hoare triple {8395#(<= (+ |ULTIMATE.start_foo_~i~0#1| 2) |ULTIMATE.start_foo_~size#1|)} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {8395#(<= (+ |ULTIMATE.start_foo_~i~0#1| 2) |ULTIMATE.start_foo_~size#1|)} is VALID [2022-02-20 23:49:55,593 INFO L290 TraceCheckUtils]: 34: Hoare triple {8395#(<= (+ |ULTIMATE.start_foo_~i~0#1| 2) |ULTIMATE.start_foo_~size#1|)} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {8395#(<= (+ |ULTIMATE.start_foo_~i~0#1| 2) |ULTIMATE.start_foo_~size#1|)} is VALID [2022-02-20 23:49:55,594 INFO L290 TraceCheckUtils]: 33: Hoare triple {8395#(<= (+ |ULTIMATE.start_foo_~i~0#1| 2) |ULTIMATE.start_foo_~size#1|)} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {8395#(<= (+ |ULTIMATE.start_foo_~i~0#1| 2) |ULTIMATE.start_foo_~size#1|)} is VALID [2022-02-20 23:49:55,594 INFO L290 TraceCheckUtils]: 32: Hoare triple {8395#(<= (+ |ULTIMATE.start_foo_~i~0#1| 2) |ULTIMATE.start_foo_~size#1|)} assume !!(foo_~i~0#1 <= foo_~size#1); {8395#(<= (+ |ULTIMATE.start_foo_~i~0#1| 2) |ULTIMATE.start_foo_~size#1|)} is VALID [2022-02-20 23:49:55,594 INFO L290 TraceCheckUtils]: 31: Hoare triple {8106#(<= 2 |ULTIMATE.start_main_~i~1#1|)} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {8395#(<= (+ |ULTIMATE.start_foo_~i~0#1| 2) |ULTIMATE.start_foo_~size#1|)} is VALID [2022-02-20 23:49:55,595 INFO L290 TraceCheckUtils]: 30: Hoare triple {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {8106#(<= 2 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,595 INFO L290 TraceCheckUtils]: 29: Hoare triple {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} havoc main_#t~ret3#1; {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,595 INFO L290 TraceCheckUtils]: 28: Hoare triple {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,596 INFO L290 TraceCheckUtils]: 27: Hoare triple {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,596 INFO L290 TraceCheckUtils]: 26: Hoare triple {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} foo_#res#1 := foo_~i~0#1; {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,596 INFO L290 TraceCheckUtils]: 25: Hoare triple {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} assume !(foo_~i~0#1 <= foo_~size#1); {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,597 INFO L290 TraceCheckUtils]: 24: Hoare triple {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,597 INFO L290 TraceCheckUtils]: 23: Hoare triple {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,597 INFO L290 TraceCheckUtils]: 22: Hoare triple {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,597 INFO L290 TraceCheckUtils]: 21: Hoare triple {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,598 INFO L290 TraceCheckUtils]: 20: Hoare triple {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} assume !!(foo_~i~0#1 <= foo_~size#1); {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,598 INFO L290 TraceCheckUtils]: 19: Hoare triple {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,598 INFO L290 TraceCheckUtils]: 18: Hoare triple {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,599 INFO L290 TraceCheckUtils]: 17: Hoare triple {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,599 INFO L290 TraceCheckUtils]: 16: Hoare triple {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,599 INFO L290 TraceCheckUtils]: 15: Hoare triple {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} assume !!(foo_~i~0#1 <= foo_~size#1); {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,599 INFO L290 TraceCheckUtils]: 14: Hoare triple {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,600 INFO L290 TraceCheckUtils]: 13: Hoare triple {8116#(<= 0 |ULTIMATE.start_main_~i~1#1|)} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {8105#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,600 INFO L290 TraceCheckUtils]: 12: Hoare triple {8116#(<= 0 |ULTIMATE.start_main_~i~1#1|)} havoc main_#t~ret3#1; {8116#(<= 0 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,600 INFO L290 TraceCheckUtils]: 11: Hoare triple {8116#(<= 0 |ULTIMATE.start_main_~i~1#1|)} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {8116#(<= 0 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,601 INFO L290 TraceCheckUtils]: 10: Hoare triple {8116#(<= 0 |ULTIMATE.start_main_~i~1#1|)} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {8116#(<= 0 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,601 INFO L290 TraceCheckUtils]: 9: Hoare triple {8116#(<= 0 |ULTIMATE.start_main_~i~1#1|)} foo_#res#1 := foo_~i~0#1; {8116#(<= 0 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,601 INFO L290 TraceCheckUtils]: 8: Hoare triple {8116#(<= 0 |ULTIMATE.start_main_~i~1#1|)} assume !(foo_~i~0#1 <= foo_~size#1); {8116#(<= 0 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,602 INFO L290 TraceCheckUtils]: 7: Hoare triple {8116#(<= 0 |ULTIMATE.start_main_~i~1#1|)} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {8116#(<= 0 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,602 INFO L290 TraceCheckUtils]: 6: Hoare triple {8116#(<= 0 |ULTIMATE.start_main_~i~1#1|)} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {8116#(<= 0 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,602 INFO L290 TraceCheckUtils]: 5: Hoare triple {8116#(<= 0 |ULTIMATE.start_main_~i~1#1|)} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {8116#(<= 0 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,602 INFO L290 TraceCheckUtils]: 4: Hoare triple {8116#(<= 0 |ULTIMATE.start_main_~i~1#1|)} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {8116#(<= 0 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,603 INFO L290 TraceCheckUtils]: 3: Hoare triple {8116#(<= 0 |ULTIMATE.start_main_~i~1#1|)} assume !!(foo_~i~0#1 <= foo_~size#1); {8116#(<= 0 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {8116#(<= 0 |ULTIMATE.start_main_~i~1#1|)} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {8116#(<= 0 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {8102#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(128);call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; {8116#(<= 0 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 23:49:55,604 INFO L290 TraceCheckUtils]: 0: Hoare triple {8102#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {8102#true} is VALID [2022-02-20 23:49:55,604 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 35 proven. 46 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-02-20 23:49:55,604 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112902912] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:49:55,604 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:49:55,604 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2022-02-20 23:49:55,604 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177665936] [2022-02-20 23:49:55,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:49:55,606 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 15 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-02-20 23:49:55,606 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:55,606 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 15 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:55,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:55,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 23:49:55,671 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:55,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 23:49:55,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2022-02-20 23:49:55,672 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 15 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:56,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:56,163 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2022-02-20 23:49:56,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 23:49:56,164 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 15 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-02-20 23:49:56,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:56,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 15 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:56,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 77 transitions. [2022-02-20 23:49:56,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 15 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:56,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 77 transitions. [2022-02-20 23:49:56,165 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 77 transitions. [2022-02-20 23:49:56,260 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:56,261 INFO L225 Difference]: With dead ends: 95 [2022-02-20 23:49:56,261 INFO L226 Difference]: Without dead ends: 95 [2022-02-20 23:49:56,261 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2022-02-20 23:49:56,262 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 79 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:56,262 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 64 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:49:56,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-02-20 23:49:56,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-02-20 23:49:56,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:56,265 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 95 states, 93 states have (on average 1.053763440860215) internal successors, (98), 94 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:56,265 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 95 states, 93 states have (on average 1.053763440860215) internal successors, (98), 94 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:56,266 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 95 states, 93 states have (on average 1.053763440860215) internal successors, (98), 94 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:56,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:56,267 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2022-02-20 23:49:56,267 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 98 transitions. [2022-02-20 23:49:56,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:56,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:56,267 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 93 states have (on average 1.053763440860215) internal successors, (98), 94 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 95 states. [2022-02-20 23:49:56,267 INFO L87 Difference]: Start difference. First operand has 95 states, 93 states have (on average 1.053763440860215) internal successors, (98), 94 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 95 states. [2022-02-20 23:49:56,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:56,268 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2022-02-20 23:49:56,268 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 98 transitions. [2022-02-20 23:49:56,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:56,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:56,268 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:56,268 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:56,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 93 states have (on average 1.053763440860215) internal successors, (98), 94 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:56,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 98 transitions. [2022-02-20 23:49:56,269 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 98 transitions. Word has length 65 [2022-02-20 23:49:56,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:56,269 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 98 transitions. [2022-02-20 23:49:56,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 15 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:56,269 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 98 transitions. [2022-02-20 23:49:56,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-02-20 23:49:56,270 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:56,271 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:56,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-02-20 23:49:56,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2022-02-20 23:49:56,479 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2022-02-20 23:49:56,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:56,480 INFO L85 PathProgramCache]: Analyzing trace with hash -600086545, now seen corresponding path program 2 times [2022-02-20 23:49:56,480 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:56,480 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868303617] [2022-02-20 23:49:56,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:56,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:56,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:56,570 INFO L290 TraceCheckUtils]: 0: Hoare triple {8895#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {8895#true} is VALID [2022-02-20 23:49:56,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {8895#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(128);call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; {8897#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:56,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {8897#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {8897#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:56,571 INFO L290 TraceCheckUtils]: 3: Hoare triple {8897#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(foo_~i~0#1 <= foo_~size#1); {8897#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:56,572 INFO L290 TraceCheckUtils]: 4: Hoare triple {8897#(= |ULTIMATE.start_main_~i~1#1| 0)} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {8897#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:56,572 INFO L290 TraceCheckUtils]: 5: Hoare triple {8897#(= |ULTIMATE.start_main_~i~1#1| 0)} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {8897#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:56,572 INFO L290 TraceCheckUtils]: 6: Hoare triple {8897#(= |ULTIMATE.start_main_~i~1#1| 0)} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {8897#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:56,573 INFO L290 TraceCheckUtils]: 7: Hoare triple {8897#(= |ULTIMATE.start_main_~i~1#1| 0)} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {8897#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:56,573 INFO L290 TraceCheckUtils]: 8: Hoare triple {8897#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !(foo_~i~0#1 <= foo_~size#1); {8897#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:56,573 INFO L290 TraceCheckUtils]: 9: Hoare triple {8897#(= |ULTIMATE.start_main_~i~1#1| 0)} foo_#res#1 := foo_~i~0#1; {8897#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:56,573 INFO L290 TraceCheckUtils]: 10: Hoare triple {8897#(= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {8897#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:56,574 INFO L290 TraceCheckUtils]: 11: Hoare triple {8897#(= |ULTIMATE.start_main_~i~1#1| 0)} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {8897#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:56,574 INFO L290 TraceCheckUtils]: 12: Hoare triple {8897#(= |ULTIMATE.start_main_~i~1#1| 0)} havoc main_#t~ret3#1; {8897#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:49:56,574 INFO L290 TraceCheckUtils]: 13: Hoare triple {8897#(= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {8898#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:56,575 INFO L290 TraceCheckUtils]: 14: Hoare triple {8898#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {8898#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:56,575 INFO L290 TraceCheckUtils]: 15: Hoare triple {8898#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} assume !!(foo_~i~0#1 <= foo_~size#1); {8898#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:56,576 INFO L290 TraceCheckUtils]: 16: Hoare triple {8898#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {8898#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:56,576 INFO L290 TraceCheckUtils]: 17: Hoare triple {8898#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {8898#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:56,576 INFO L290 TraceCheckUtils]: 18: Hoare triple {8898#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {8898#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:56,577 INFO L290 TraceCheckUtils]: 19: Hoare triple {8898#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {8898#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:56,577 INFO L290 TraceCheckUtils]: 20: Hoare triple {8898#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} assume !!(foo_~i~0#1 <= foo_~size#1); {8898#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:56,577 INFO L290 TraceCheckUtils]: 21: Hoare triple {8898#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {8898#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:56,578 INFO L290 TraceCheckUtils]: 22: Hoare triple {8898#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {8898#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:56,578 INFO L290 TraceCheckUtils]: 23: Hoare triple {8898#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {8898#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:56,578 INFO L290 TraceCheckUtils]: 24: Hoare triple {8898#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {8898#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:56,579 INFO L290 TraceCheckUtils]: 25: Hoare triple {8898#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} assume !(foo_~i~0#1 <= foo_~size#1); {8898#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:56,579 INFO L290 TraceCheckUtils]: 26: Hoare triple {8898#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} foo_#res#1 := foo_~i~0#1; {8898#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:56,580 INFO L290 TraceCheckUtils]: 27: Hoare triple {8898#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {8898#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:56,580 INFO L290 TraceCheckUtils]: 28: Hoare triple {8898#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {8898#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:56,580 INFO L290 TraceCheckUtils]: 29: Hoare triple {8898#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} havoc main_#t~ret3#1; {8898#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:56,581 INFO L290 TraceCheckUtils]: 30: Hoare triple {8898#(and (<= |ULTIMATE.start_main_~i~1#1| 1) (<= 1 |ULTIMATE.start_main_~i~1#1|))} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {8899#(and (<= |ULTIMATE.start_main_~i~1#1| 2) (<= 2 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:56,581 INFO L290 TraceCheckUtils]: 31: Hoare triple {8899#(and (<= |ULTIMATE.start_main_~i~1#1| 2) (<= 2 |ULTIMATE.start_main_~i~1#1|))} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {8899#(and (<= |ULTIMATE.start_main_~i~1#1| 2) (<= 2 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:56,582 INFO L290 TraceCheckUtils]: 32: Hoare triple {8899#(and (<= |ULTIMATE.start_main_~i~1#1| 2) (<= 2 |ULTIMATE.start_main_~i~1#1|))} assume !!(foo_~i~0#1 <= foo_~size#1); {8899#(and (<= |ULTIMATE.start_main_~i~1#1| 2) (<= 2 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:56,582 INFO L290 TraceCheckUtils]: 33: Hoare triple {8899#(and (<= |ULTIMATE.start_main_~i~1#1| 2) (<= 2 |ULTIMATE.start_main_~i~1#1|))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {8899#(and (<= |ULTIMATE.start_main_~i~1#1| 2) (<= 2 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:56,582 INFO L290 TraceCheckUtils]: 34: Hoare triple {8899#(and (<= |ULTIMATE.start_main_~i~1#1| 2) (<= 2 |ULTIMATE.start_main_~i~1#1|))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {8899#(and (<= |ULTIMATE.start_main_~i~1#1| 2) (<= 2 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:56,583 INFO L290 TraceCheckUtils]: 35: Hoare triple {8899#(and (<= |ULTIMATE.start_main_~i~1#1| 2) (<= 2 |ULTIMATE.start_main_~i~1#1|))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {8899#(and (<= |ULTIMATE.start_main_~i~1#1| 2) (<= 2 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:56,583 INFO L290 TraceCheckUtils]: 36: Hoare triple {8899#(and (<= |ULTIMATE.start_main_~i~1#1| 2) (<= 2 |ULTIMATE.start_main_~i~1#1|))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {8899#(and (<= |ULTIMATE.start_main_~i~1#1| 2) (<= 2 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:56,583 INFO L290 TraceCheckUtils]: 37: Hoare triple {8899#(and (<= |ULTIMATE.start_main_~i~1#1| 2) (<= 2 |ULTIMATE.start_main_~i~1#1|))} assume !!(foo_~i~0#1 <= foo_~size#1); {8899#(and (<= |ULTIMATE.start_main_~i~1#1| 2) (<= 2 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:56,584 INFO L290 TraceCheckUtils]: 38: Hoare triple {8899#(and (<= |ULTIMATE.start_main_~i~1#1| 2) (<= 2 |ULTIMATE.start_main_~i~1#1|))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {8899#(and (<= |ULTIMATE.start_main_~i~1#1| 2) (<= 2 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:56,584 INFO L290 TraceCheckUtils]: 39: Hoare triple {8899#(and (<= |ULTIMATE.start_main_~i~1#1| 2) (<= 2 |ULTIMATE.start_main_~i~1#1|))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {8899#(and (<= |ULTIMATE.start_main_~i~1#1| 2) (<= 2 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:56,585 INFO L290 TraceCheckUtils]: 40: Hoare triple {8899#(and (<= |ULTIMATE.start_main_~i~1#1| 2) (<= 2 |ULTIMATE.start_main_~i~1#1|))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {8899#(and (<= |ULTIMATE.start_main_~i~1#1| 2) (<= 2 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:56,585 INFO L290 TraceCheckUtils]: 41: Hoare triple {8899#(and (<= |ULTIMATE.start_main_~i~1#1| 2) (<= 2 |ULTIMATE.start_main_~i~1#1|))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {8899#(and (<= |ULTIMATE.start_main_~i~1#1| 2) (<= 2 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:56,585 INFO L290 TraceCheckUtils]: 42: Hoare triple {8899#(and (<= |ULTIMATE.start_main_~i~1#1| 2) (<= 2 |ULTIMATE.start_main_~i~1#1|))} assume !!(foo_~i~0#1 <= foo_~size#1); {8899#(and (<= |ULTIMATE.start_main_~i~1#1| 2) (<= 2 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:56,586 INFO L290 TraceCheckUtils]: 43: Hoare triple {8899#(and (<= |ULTIMATE.start_main_~i~1#1| 2) (<= 2 |ULTIMATE.start_main_~i~1#1|))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {8899#(and (<= |ULTIMATE.start_main_~i~1#1| 2) (<= 2 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:56,586 INFO L290 TraceCheckUtils]: 44: Hoare triple {8899#(and (<= |ULTIMATE.start_main_~i~1#1| 2) (<= 2 |ULTIMATE.start_main_~i~1#1|))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {8899#(and (<= |ULTIMATE.start_main_~i~1#1| 2) (<= 2 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:56,586 INFO L290 TraceCheckUtils]: 45: Hoare triple {8899#(and (<= |ULTIMATE.start_main_~i~1#1| 2) (<= 2 |ULTIMATE.start_main_~i~1#1|))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {8899#(and (<= |ULTIMATE.start_main_~i~1#1| 2) (<= 2 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:56,587 INFO L290 TraceCheckUtils]: 46: Hoare triple {8899#(and (<= |ULTIMATE.start_main_~i~1#1| 2) (<= 2 |ULTIMATE.start_main_~i~1#1|))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {8899#(and (<= |ULTIMATE.start_main_~i~1#1| 2) (<= 2 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:56,587 INFO L290 TraceCheckUtils]: 47: Hoare triple {8899#(and (<= |ULTIMATE.start_main_~i~1#1| 2) (<= 2 |ULTIMATE.start_main_~i~1#1|))} assume !(foo_~i~0#1 <= foo_~size#1); {8899#(and (<= |ULTIMATE.start_main_~i~1#1| 2) (<= 2 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:56,587 INFO L290 TraceCheckUtils]: 48: Hoare triple {8899#(and (<= |ULTIMATE.start_main_~i~1#1| 2) (<= 2 |ULTIMATE.start_main_~i~1#1|))} foo_#res#1 := foo_~i~0#1; {8899#(and (<= |ULTIMATE.start_main_~i~1#1| 2) (<= 2 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:56,588 INFO L290 TraceCheckUtils]: 49: Hoare triple {8899#(and (<= |ULTIMATE.start_main_~i~1#1| 2) (<= 2 |ULTIMATE.start_main_~i~1#1|))} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {8899#(and (<= |ULTIMATE.start_main_~i~1#1| 2) (<= 2 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:56,588 INFO L290 TraceCheckUtils]: 50: Hoare triple {8899#(and (<= |ULTIMATE.start_main_~i~1#1| 2) (<= 2 |ULTIMATE.start_main_~i~1#1|))} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {8899#(and (<= |ULTIMATE.start_main_~i~1#1| 2) (<= 2 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:56,589 INFO L290 TraceCheckUtils]: 51: Hoare triple {8899#(and (<= |ULTIMATE.start_main_~i~1#1| 2) (<= 2 |ULTIMATE.start_main_~i~1#1|))} havoc main_#t~ret3#1; {8899#(and (<= |ULTIMATE.start_main_~i~1#1| 2) (<= 2 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:49:56,589 INFO L290 TraceCheckUtils]: 52: Hoare triple {8899#(and (<= |ULTIMATE.start_main_~i~1#1| 2) (<= 2 |ULTIMATE.start_main_~i~1#1|))} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {8900#(and (not (<= (+ (div |ULTIMATE.start_main_~i~1#1| 4294967296) 1) 0)) (<= |ULTIMATE.start_main_~i~1#1| 3))} is VALID [2022-02-20 23:49:56,590 INFO L290 TraceCheckUtils]: 53: Hoare triple {8900#(and (not (<= (+ (div |ULTIMATE.start_main_~i~1#1| 4294967296) 1) 0)) (<= |ULTIMATE.start_main_~i~1#1| 3))} assume !(main_~i~1#1 % 4294967296 < 32); {8896#false} is VALID [2022-02-20 23:49:56,590 INFO L290 TraceCheckUtils]: 54: Hoare triple {8896#false} main_~i~1#1 := 0; {8896#false} is VALID [2022-02-20 23:49:56,590 INFO L290 TraceCheckUtils]: 55: Hoare triple {8896#false} assume !!(main_~i~1#1 % 4294967296 < 32); {8896#false} is VALID [2022-02-20 23:49:56,590 INFO L290 TraceCheckUtils]: 56: Hoare triple {8896#false} SUMMARY for call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L30 {8896#false} is VALID [2022-02-20 23:49:56,590 INFO L290 TraceCheckUtils]: 57: Hoare triple {8896#false} assume !(main_#t~mem5#1 != main_~i~1#1);havoc main_#t~mem5#1; {8896#false} is VALID [2022-02-20 23:49:56,590 INFO L290 TraceCheckUtils]: 58: Hoare triple {8896#false} main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {8896#false} is VALID [2022-02-20 23:49:56,590 INFO L290 TraceCheckUtils]: 59: Hoare triple {8896#false} assume !!(main_~i~1#1 % 4294967296 < 32); {8896#false} is VALID [2022-02-20 23:49:56,590 INFO L290 TraceCheckUtils]: 60: Hoare triple {8896#false} SUMMARY for call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L30 {8896#false} is VALID [2022-02-20 23:49:56,590 INFO L290 TraceCheckUtils]: 61: Hoare triple {8896#false} assume !(main_#t~mem5#1 != main_~i~1#1);havoc main_#t~mem5#1; {8896#false} is VALID [2022-02-20 23:49:56,591 INFO L290 TraceCheckUtils]: 62: Hoare triple {8896#false} main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {8896#false} is VALID [2022-02-20 23:49:56,591 INFO L290 TraceCheckUtils]: 63: Hoare triple {8896#false} assume !!(main_~i~1#1 % 4294967296 < 32); {8896#false} is VALID [2022-02-20 23:49:56,591 INFO L290 TraceCheckUtils]: 64: Hoare triple {8896#false} SUMMARY for call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L30 {8896#false} is VALID [2022-02-20 23:49:56,591 INFO L290 TraceCheckUtils]: 65: Hoare triple {8896#false} assume !(main_#t~mem5#1 != main_~i~1#1);havoc main_#t~mem5#1; {8896#false} is VALID [2022-02-20 23:49:56,591 INFO L290 TraceCheckUtils]: 66: Hoare triple {8896#false} main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {8896#false} is VALID [2022-02-20 23:49:56,591 INFO L290 TraceCheckUtils]: 67: Hoare triple {8896#false} assume !(main_~i~1#1 % 4294967296 < 32); {8896#false} is VALID [2022-02-20 23:49:56,591 INFO L290 TraceCheckUtils]: 68: Hoare triple {8896#false} main_#res#1 := 0;call ULTIMATE.dealloc(main_~#b~0#1.base, main_~#b~0#1.offset);havoc main_~#b~0#1.base, main_~#b~0#1.offset;call ULTIMATE.dealloc(main_~#mask~0#1.base, main_~#mask~0#1.offset);havoc main_~#mask~0#1.base, main_~#mask~0#1.offset; {8896#false} is VALID [2022-02-20 23:49:56,591 INFO L290 TraceCheckUtils]: 69: Hoare triple {8896#false} assume !(#valid == main_old_#valid#1); {8896#false} is VALID [2022-02-20 23:49:56,592 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-02-20 23:49:56,592 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:49:56,592 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868303617] [2022-02-20 23:49:56,592 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868303617] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:49:56,592 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998737587] [2022-02-20 23:49:56,592 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 23:49:56,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:49:56,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:49:56,594 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:49:56,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-02-20 23:49:56,651 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-20 23:49:56,652 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:49:56,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 23:49:56,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:56,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:49:57,915 INFO L290 TraceCheckUtils]: 0: Hoare triple {8895#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {8895#true} is VALID [2022-02-20 23:49:57,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {8895#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(128);call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,919 INFO L290 TraceCheckUtils]: 3: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} assume !!(foo_~i~0#1 <= foo_~size#1); {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,919 INFO L290 TraceCheckUtils]: 4: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,920 INFO L290 TraceCheckUtils]: 5: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,921 INFO L290 TraceCheckUtils]: 6: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,921 INFO L290 TraceCheckUtils]: 7: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,922 INFO L290 TraceCheckUtils]: 8: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} assume !(foo_~i~0#1 <= foo_~size#1); {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,922 INFO L290 TraceCheckUtils]: 9: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} foo_#res#1 := foo_~i~0#1; {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,923 INFO L290 TraceCheckUtils]: 10: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,924 INFO L290 TraceCheckUtils]: 11: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,924 INFO L290 TraceCheckUtils]: 12: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} havoc main_#t~ret3#1; {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,925 INFO L290 TraceCheckUtils]: 13: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,926 INFO L290 TraceCheckUtils]: 14: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,926 INFO L290 TraceCheckUtils]: 15: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} assume !!(foo_~i~0#1 <= foo_~size#1); {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,927 INFO L290 TraceCheckUtils]: 16: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,928 INFO L290 TraceCheckUtils]: 17: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,928 INFO L290 TraceCheckUtils]: 18: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,929 INFO L290 TraceCheckUtils]: 19: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,929 INFO L290 TraceCheckUtils]: 20: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} assume !!(foo_~i~0#1 <= foo_~size#1); {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,930 INFO L290 TraceCheckUtils]: 21: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,931 INFO L290 TraceCheckUtils]: 22: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,932 INFO L290 TraceCheckUtils]: 23: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,933 INFO L290 TraceCheckUtils]: 24: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,933 INFO L290 TraceCheckUtils]: 25: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} assume !(foo_~i~0#1 <= foo_~size#1); {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,934 INFO L290 TraceCheckUtils]: 26: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} foo_#res#1 := foo_~i~0#1; {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,934 INFO L290 TraceCheckUtils]: 27: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,935 INFO L290 TraceCheckUtils]: 28: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,936 INFO L290 TraceCheckUtils]: 29: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} havoc main_#t~ret3#1; {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,936 INFO L290 TraceCheckUtils]: 30: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,937 INFO L290 TraceCheckUtils]: 31: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,937 INFO L290 TraceCheckUtils]: 32: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} assume !!(foo_~i~0#1 <= foo_~size#1); {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,938 INFO L290 TraceCheckUtils]: 33: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,939 INFO L290 TraceCheckUtils]: 34: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,939 INFO L290 TraceCheckUtils]: 35: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,940 INFO L290 TraceCheckUtils]: 36: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,940 INFO L290 TraceCheckUtils]: 37: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} assume !!(foo_~i~0#1 <= foo_~size#1); {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,941 INFO L290 TraceCheckUtils]: 38: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,942 INFO L290 TraceCheckUtils]: 39: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,942 INFO L290 TraceCheckUtils]: 40: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,943 INFO L290 TraceCheckUtils]: 41: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,943 INFO L290 TraceCheckUtils]: 42: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} assume !!(foo_~i~0#1 <= foo_~size#1); {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,945 INFO L290 TraceCheckUtils]: 43: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,945 INFO L290 TraceCheckUtils]: 44: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,946 INFO L290 TraceCheckUtils]: 45: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,946 INFO L290 TraceCheckUtils]: 46: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,947 INFO L290 TraceCheckUtils]: 47: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} assume !(foo_~i~0#1 <= foo_~size#1); {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,948 INFO L290 TraceCheckUtils]: 48: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} foo_#res#1 := foo_~i~0#1; {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,948 INFO L290 TraceCheckUtils]: 49: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,949 INFO L290 TraceCheckUtils]: 50: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,949 INFO L290 TraceCheckUtils]: 51: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} havoc main_#t~ret3#1; {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,950 INFO L290 TraceCheckUtils]: 52: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,951 INFO L290 TraceCheckUtils]: 53: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} assume !(main_~i~1#1 % 4294967296 < 32); {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,952 INFO L290 TraceCheckUtils]: 54: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} main_~i~1#1 := 0; {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,952 INFO L290 TraceCheckUtils]: 55: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} assume !!(main_~i~1#1 % 4294967296 < 32); {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,953 INFO L290 TraceCheckUtils]: 56: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} SUMMARY for call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L30 {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,953 INFO L290 TraceCheckUtils]: 57: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} assume !(main_#t~mem5#1 != main_~i~1#1);havoc main_#t~mem5#1; {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,954 INFO L290 TraceCheckUtils]: 58: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,955 INFO L290 TraceCheckUtils]: 59: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} assume !!(main_~i~1#1 % 4294967296 < 32); {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,955 INFO L290 TraceCheckUtils]: 60: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} SUMMARY for call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L30 {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,956 INFO L290 TraceCheckUtils]: 61: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} assume !(main_#t~mem5#1 != main_~i~1#1);havoc main_#t~mem5#1; {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,957 INFO L290 TraceCheckUtils]: 62: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,957 INFO L290 TraceCheckUtils]: 63: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} assume !!(main_~i~1#1 % 4294967296 < 32); {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,958 INFO L290 TraceCheckUtils]: 64: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} SUMMARY for call main_#t~mem5#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L30 {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,958 INFO L290 TraceCheckUtils]: 65: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} assume !(main_#t~mem5#1 != main_~i~1#1);havoc main_#t~mem5#1; {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,959 INFO L290 TraceCheckUtils]: 66: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,960 INFO L290 TraceCheckUtils]: 67: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} assume !(main_~i~1#1 % 4294967296 < 32); {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} is VALID [2022-02-20 23:49:57,960 INFO L290 TraceCheckUtils]: 68: Hoare triple {8907#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base|) 0) (exists ((v_ArrVal_382 Int)) (= (select (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_382) |ULTIMATE.start_main_~#mask~0#1.base|) 0)) (exists ((v_ArrVal_381 Int) (v_ArrVal_380 Int)) (= (store (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_381) |ULTIMATE.start_main_~#mask~0#1.base| v_ArrVal_380) |#valid|)))} main_#res#1 := 0;call ULTIMATE.dealloc(main_~#b~0#1.base, main_~#b~0#1.offset);havoc main_~#b~0#1.base, main_~#b~0#1.offset;call ULTIMATE.dealloc(main_~#mask~0#1.base, main_~#mask~0#1.offset);havoc main_~#mask~0#1.base, main_~#mask~0#1.offset; {9109#(exists ((|v_ULTIMATE.start_main_~#b~0#1.base_24| Int) (|v_ULTIMATE.start_main_~#mask~0#1.base_19| Int) (v_ArrVal_382 Int) (v_ArrVal_381 Int) (v_ArrVal_380 Int)) (and (= (store (store (store (store |ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#b~0#1.base_24| v_ArrVal_381) |v_ULTIMATE.start_main_~#mask~0#1.base_19| v_ArrVal_380) |v_ULTIMATE.start_main_~#b~0#1.base_24| 0) |v_ULTIMATE.start_main_~#mask~0#1.base_19| 0) |#valid|) (= (select |ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#b~0#1.base_24|) 0) (= (select (store |ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#b~0#1.base_24| v_ArrVal_382) |v_ULTIMATE.start_main_~#mask~0#1.base_19|) 0)))} is VALID [2022-02-20 23:49:57,961 INFO L290 TraceCheckUtils]: 69: Hoare triple {9109#(exists ((|v_ULTIMATE.start_main_~#b~0#1.base_24| Int) (|v_ULTIMATE.start_main_~#mask~0#1.base_19| Int) (v_ArrVal_382 Int) (v_ArrVal_381 Int) (v_ArrVal_380 Int)) (and (= (store (store (store (store |ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#b~0#1.base_24| v_ArrVal_381) |v_ULTIMATE.start_main_~#mask~0#1.base_19| v_ArrVal_380) |v_ULTIMATE.start_main_~#b~0#1.base_24| 0) |v_ULTIMATE.start_main_~#mask~0#1.base_19| 0) |#valid|) (= (select |ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#b~0#1.base_24|) 0) (= (select (store |ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#b~0#1.base_24| v_ArrVal_382) |v_ULTIMATE.start_main_~#mask~0#1.base_19|) 0)))} assume !(#valid == main_old_#valid#1); {8896#false} is VALID [2022-02-20 23:49:57,962 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2022-02-20 23:49:57,962 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:49:57,962 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998737587] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:49:57,962 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:49:57,962 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2022-02-20 23:49:57,962 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071439452] [2022-02-20 23:49:57,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:49:57,963 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2022-02-20 23:49:57,963 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:57,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:57,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:57,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:49:57,991 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:57,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:49:57,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:49:57,992 INFO L87 Difference]: Start difference. First operand 95 states and 98 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:58,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:58,019 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2022-02-20 23:49:58,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:49:58,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2022-02-20 23:49:58,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:58,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:58,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2022-02-20 23:49:58,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:58,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2022-02-20 23:49:58,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 24 transitions. [2022-02-20 23:49:58,042 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:58,042 INFO L225 Difference]: With dead ends: 94 [2022-02-20 23:49:58,042 INFO L226 Difference]: Without dead ends: 78 [2022-02-20 23:49:58,043 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:49:58,044 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:58,044 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 34 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 8 Unchecked, 0.0s Time] [2022-02-20 23:49:58,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-02-20 23:49:58,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-02-20 23:49:58,046 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:58,046 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 78 states, 77 states have (on average 1.0389610389610389) internal successors, (80), 77 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:58,046 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 78 states, 77 states have (on average 1.0389610389610389) internal successors, (80), 77 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:58,046 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 78 states, 77 states have (on average 1.0389610389610389) internal successors, (80), 77 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:58,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:58,047 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2022-02-20 23:49:58,047 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2022-02-20 23:49:58,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:58,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:58,048 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 77 states have (on average 1.0389610389610389) internal successors, (80), 77 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 78 states. [2022-02-20 23:49:58,048 INFO L87 Difference]: Start difference. First operand has 78 states, 77 states have (on average 1.0389610389610389) internal successors, (80), 77 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 78 states. [2022-02-20 23:49:58,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:58,048 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2022-02-20 23:49:58,049 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2022-02-20 23:49:58,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:58,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:58,049 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:58,049 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:58,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.0389610389610389) internal successors, (80), 77 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:58,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2022-02-20 23:49:58,050 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 70 [2022-02-20 23:49:58,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:58,050 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2022-02-20 23:49:58,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:58,050 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2022-02-20 23:49:58,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 23:49:58,051 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:58,051 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1] [2022-02-20 23:49:58,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-02-20 23:49:58,267 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:49:58,268 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2022-02-20 23:49:58,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:58,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1078992381, now seen corresponding path program 2 times [2022-02-20 23:49:58,268 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:58,268 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098855023] [2022-02-20 23:49:58,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:58,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:58,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:58,377 INFO L290 TraceCheckUtils]: 0: Hoare triple {9440#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {9440#true} is VALID [2022-02-20 23:49:58,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {9440#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(128);call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:58,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:58,379 INFO L290 TraceCheckUtils]: 3: Hoare triple {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} assume !!(foo_~i~0#1 <= foo_~size#1); {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:58,379 INFO L290 TraceCheckUtils]: 4: Hoare triple {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:58,380 INFO L290 TraceCheckUtils]: 5: Hoare triple {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:58,380 INFO L290 TraceCheckUtils]: 6: Hoare triple {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:58,380 INFO L290 TraceCheckUtils]: 7: Hoare triple {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:58,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} assume !(foo_~i~0#1 <= foo_~size#1); {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:58,381 INFO L290 TraceCheckUtils]: 9: Hoare triple {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} foo_#res#1 := foo_~i~0#1; {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:58,382 INFO L290 TraceCheckUtils]: 10: Hoare triple {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:58,382 INFO L290 TraceCheckUtils]: 11: Hoare triple {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:58,382 INFO L290 TraceCheckUtils]: 12: Hoare triple {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} havoc main_#t~ret3#1; {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:58,383 INFO L290 TraceCheckUtils]: 13: Hoare triple {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:58,383 INFO L290 TraceCheckUtils]: 14: Hoare triple {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:58,383 INFO L290 TraceCheckUtils]: 15: Hoare triple {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} assume !!(foo_~i~0#1 <= foo_~size#1); {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:58,384 INFO L290 TraceCheckUtils]: 16: Hoare triple {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:58,384 INFO L290 TraceCheckUtils]: 17: Hoare triple {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:58,384 INFO L290 TraceCheckUtils]: 18: Hoare triple {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:58,385 INFO L290 TraceCheckUtils]: 19: Hoare triple {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:58,385 INFO L290 TraceCheckUtils]: 20: Hoare triple {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} assume !!(foo_~i~0#1 <= foo_~size#1); {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:58,385 INFO L290 TraceCheckUtils]: 21: Hoare triple {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:58,386 INFO L290 TraceCheckUtils]: 22: Hoare triple {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:58,386 INFO L290 TraceCheckUtils]: 23: Hoare triple {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:58,387 INFO L290 TraceCheckUtils]: 24: Hoare triple {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:58,387 INFO L290 TraceCheckUtils]: 25: Hoare triple {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} assume !(foo_~i~0#1 <= foo_~size#1); {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:58,387 INFO L290 TraceCheckUtils]: 26: Hoare triple {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} foo_#res#1 := foo_~i~0#1; {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:58,388 INFO L290 TraceCheckUtils]: 27: Hoare triple {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:58,388 INFO L290 TraceCheckUtils]: 28: Hoare triple {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:58,388 INFO L290 TraceCheckUtils]: 29: Hoare triple {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} havoc main_#t~ret3#1; {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:58,389 INFO L290 TraceCheckUtils]: 30: Hoare triple {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:58,389 INFO L290 TraceCheckUtils]: 31: Hoare triple {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:58,389 INFO L290 TraceCheckUtils]: 32: Hoare triple {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} assume !!(foo_~i~0#1 <= foo_~size#1); {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:58,390 INFO L290 TraceCheckUtils]: 33: Hoare triple {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:58,390 INFO L290 TraceCheckUtils]: 34: Hoare triple {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:58,391 INFO L290 TraceCheckUtils]: 35: Hoare triple {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:58,391 INFO L290 TraceCheckUtils]: 36: Hoare triple {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:58,391 INFO L290 TraceCheckUtils]: 37: Hoare triple {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} assume !!(foo_~i~0#1 <= foo_~size#1); {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:58,392 INFO L290 TraceCheckUtils]: 38: Hoare triple {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:58,392 INFO L290 TraceCheckUtils]: 39: Hoare triple {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:58,392 INFO L290 TraceCheckUtils]: 40: Hoare triple {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:58,393 INFO L290 TraceCheckUtils]: 41: Hoare triple {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:58,393 INFO L290 TraceCheckUtils]: 42: Hoare triple {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} assume !!(foo_~i~0#1 <= foo_~size#1); {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:58,393 INFO L290 TraceCheckUtils]: 43: Hoare triple {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:58,394 INFO L290 TraceCheckUtils]: 44: Hoare triple {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:58,394 INFO L290 TraceCheckUtils]: 45: Hoare triple {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:58,394 INFO L290 TraceCheckUtils]: 46: Hoare triple {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:58,395 INFO L290 TraceCheckUtils]: 47: Hoare triple {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} assume !(foo_~i~0#1 <= foo_~size#1); {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:58,395 INFO L290 TraceCheckUtils]: 48: Hoare triple {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} foo_#res#1 := foo_~i~0#1; {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:58,396 INFO L290 TraceCheckUtils]: 49: Hoare triple {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:58,396 INFO L290 TraceCheckUtils]: 50: Hoare triple {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:58,396 INFO L290 TraceCheckUtils]: 51: Hoare triple {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} havoc main_#t~ret3#1; {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:58,397 INFO L290 TraceCheckUtils]: 52: Hoare triple {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} is VALID [2022-02-20 23:49:58,397 INFO L290 TraceCheckUtils]: 53: Hoare triple {9442#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|) 32))} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {9443#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0))} is VALID [2022-02-20 23:49:58,397 INFO L290 TraceCheckUtils]: 54: Hoare triple {9443#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0))} assume !!(foo_~i~0#1 <= foo_~size#1); {9443#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0))} is VALID [2022-02-20 23:49:58,398 INFO L290 TraceCheckUtils]: 55: Hoare triple {9443#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {9443#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0))} is VALID [2022-02-20 23:49:58,398 INFO L290 TraceCheckUtils]: 56: Hoare triple {9443#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {9443#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0))} is VALID [2022-02-20 23:49:58,410 INFO L290 TraceCheckUtils]: 57: Hoare triple {9443#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {9443#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0))} is VALID [2022-02-20 23:49:58,421 INFO L290 TraceCheckUtils]: 58: Hoare triple {9443#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {9443#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0))} is VALID [2022-02-20 23:49:58,422 INFO L290 TraceCheckUtils]: 59: Hoare triple {9443#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0))} assume !!(foo_~i~0#1 <= foo_~size#1); {9443#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0))} is VALID [2022-02-20 23:49:58,422 INFO L290 TraceCheckUtils]: 60: Hoare triple {9443#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {9443#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0))} is VALID [2022-02-20 23:49:58,423 INFO L290 TraceCheckUtils]: 61: Hoare triple {9443#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {9443#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0))} is VALID [2022-02-20 23:49:58,423 INFO L290 TraceCheckUtils]: 62: Hoare triple {9443#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {9443#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0))} is VALID [2022-02-20 23:49:58,423 INFO L290 TraceCheckUtils]: 63: Hoare triple {9443#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {9443#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0))} is VALID [2022-02-20 23:49:58,424 INFO L290 TraceCheckUtils]: 64: Hoare triple {9443#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0))} assume !!(foo_~i~0#1 <= foo_~size#1); {9443#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0))} is VALID [2022-02-20 23:49:58,424 INFO L290 TraceCheckUtils]: 65: Hoare triple {9443#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {9443#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0))} is VALID [2022-02-20 23:49:58,425 INFO L290 TraceCheckUtils]: 66: Hoare triple {9443#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {9443#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0))} is VALID [2022-02-20 23:49:58,425 INFO L290 TraceCheckUtils]: 67: Hoare triple {9443#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {9443#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0))} is VALID [2022-02-20 23:49:58,425 INFO L290 TraceCheckUtils]: 68: Hoare triple {9443#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {9443#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0))} is VALID [2022-02-20 23:49:58,426 INFO L290 TraceCheckUtils]: 69: Hoare triple {9443#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0))} assume !!(foo_~i~0#1 <= foo_~size#1); {9443#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0))} is VALID [2022-02-20 23:49:58,426 INFO L290 TraceCheckUtils]: 70: Hoare triple {9443#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {9443#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0))} is VALID [2022-02-20 23:49:58,426 INFO L290 TraceCheckUtils]: 71: Hoare triple {9443#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {9443#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0))} is VALID [2022-02-20 23:49:58,427 INFO L290 TraceCheckUtils]: 72: Hoare triple {9443#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {9443#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0))} is VALID [2022-02-20 23:49:58,427 INFO L290 TraceCheckUtils]: 73: Hoare triple {9443#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {9443#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0))} is VALID [2022-02-20 23:49:58,427 INFO L290 TraceCheckUtils]: 74: Hoare triple {9443#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0))} assume !!(foo_~i~0#1 <= foo_~size#1); {9443#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0))} is VALID [2022-02-20 23:49:58,428 INFO L290 TraceCheckUtils]: 75: Hoare triple {9443#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (= |ULTIMATE.start_foo_~b#1.offset| 0))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {9444#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (<= |ULTIMATE.start_foo_~i~0#1| 31) (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:49:58,428 INFO L290 TraceCheckUtils]: 76: Hoare triple {9444#(and (= (+ (select |#length| |ULTIMATE.start_foo_~b#1.base|) (- 32)) 0) (<= |ULTIMATE.start_foo_~i~0#1| 31) (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} assume !(1 + (foo_~b#1.offset + foo_~i~0#1) <= #length[foo_~b#1.base] && 0 <= foo_~b#1.offset + foo_~i~0#1); {9441#false} is VALID [2022-02-20 23:49:58,429 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 4 proven. 153 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2022-02-20 23:49:58,429 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:49:58,429 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098855023] [2022-02-20 23:49:58,429 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098855023] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:49:58,429 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829681328] [2022-02-20 23:49:58,429 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 23:49:58,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:49:58,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:49:58,431 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:49:58,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-02-20 23:49:58,499 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-20 23:49:58,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:49:58,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-20 23:49:58,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:58,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:49:58,568 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-20 23:49:58,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-02-20 23:49:59,061 INFO L290 TraceCheckUtils]: 0: Hoare triple {9440#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {9440#true} is VALID [2022-02-20 23:49:59,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {9440#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(128);call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:59,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:59,063 INFO L290 TraceCheckUtils]: 3: Hoare triple {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} assume !!(foo_~i~0#1 <= foo_~size#1); {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:59,079 INFO L290 TraceCheckUtils]: 4: Hoare triple {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:59,080 INFO L290 TraceCheckUtils]: 5: Hoare triple {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:59,080 INFO L290 TraceCheckUtils]: 6: Hoare triple {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:59,081 INFO L290 TraceCheckUtils]: 7: Hoare triple {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:59,081 INFO L290 TraceCheckUtils]: 8: Hoare triple {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} assume !(foo_~i~0#1 <= foo_~size#1); {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:59,082 INFO L290 TraceCheckUtils]: 9: Hoare triple {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} foo_#res#1 := foo_~i~0#1; {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:59,082 INFO L290 TraceCheckUtils]: 10: Hoare triple {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:59,083 INFO L290 TraceCheckUtils]: 11: Hoare triple {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:59,083 INFO L290 TraceCheckUtils]: 12: Hoare triple {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} havoc main_#t~ret3#1; {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:59,084 INFO L290 TraceCheckUtils]: 13: Hoare triple {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:59,084 INFO L290 TraceCheckUtils]: 14: Hoare triple {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:59,084 INFO L290 TraceCheckUtils]: 15: Hoare triple {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} assume !!(foo_~i~0#1 <= foo_~size#1); {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:59,085 INFO L290 TraceCheckUtils]: 16: Hoare triple {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:59,085 INFO L290 TraceCheckUtils]: 17: Hoare triple {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:59,086 INFO L290 TraceCheckUtils]: 18: Hoare triple {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:59,086 INFO L290 TraceCheckUtils]: 19: Hoare triple {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:59,087 INFO L290 TraceCheckUtils]: 20: Hoare triple {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} assume !!(foo_~i~0#1 <= foo_~size#1); {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:59,087 INFO L290 TraceCheckUtils]: 21: Hoare triple {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:59,088 INFO L290 TraceCheckUtils]: 22: Hoare triple {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:59,088 INFO L290 TraceCheckUtils]: 23: Hoare triple {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:59,088 INFO L290 TraceCheckUtils]: 24: Hoare triple {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:59,089 INFO L290 TraceCheckUtils]: 25: Hoare triple {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} assume !(foo_~i~0#1 <= foo_~size#1); {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:59,089 INFO L290 TraceCheckUtils]: 26: Hoare triple {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} foo_#res#1 := foo_~i~0#1; {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:59,090 INFO L290 TraceCheckUtils]: 27: Hoare triple {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:59,090 INFO L290 TraceCheckUtils]: 28: Hoare triple {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:59,091 INFO L290 TraceCheckUtils]: 29: Hoare triple {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} havoc main_#t~ret3#1; {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:59,091 INFO L290 TraceCheckUtils]: 30: Hoare triple {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:59,091 INFO L290 TraceCheckUtils]: 31: Hoare triple {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:59,092 INFO L290 TraceCheckUtils]: 32: Hoare triple {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} assume !!(foo_~i~0#1 <= foo_~size#1); {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:59,092 INFO L290 TraceCheckUtils]: 33: Hoare triple {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:59,093 INFO L290 TraceCheckUtils]: 34: Hoare triple {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:59,093 INFO L290 TraceCheckUtils]: 35: Hoare triple {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:59,094 INFO L290 TraceCheckUtils]: 36: Hoare triple {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:59,094 INFO L290 TraceCheckUtils]: 37: Hoare triple {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} assume !!(foo_~i~0#1 <= foo_~size#1); {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:59,094 INFO L290 TraceCheckUtils]: 38: Hoare triple {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:59,095 INFO L290 TraceCheckUtils]: 39: Hoare triple {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:59,095 INFO L290 TraceCheckUtils]: 40: Hoare triple {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:59,096 INFO L290 TraceCheckUtils]: 41: Hoare triple {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:59,096 INFO L290 TraceCheckUtils]: 42: Hoare triple {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} assume !!(foo_~i~0#1 <= foo_~size#1); {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:59,097 INFO L290 TraceCheckUtils]: 43: Hoare triple {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:59,097 INFO L290 TraceCheckUtils]: 44: Hoare triple {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:59,097 INFO L290 TraceCheckUtils]: 45: Hoare triple {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:59,098 INFO L290 TraceCheckUtils]: 46: Hoare triple {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:59,098 INFO L290 TraceCheckUtils]: 47: Hoare triple {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} assume !(foo_~i~0#1 <= foo_~size#1); {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:59,099 INFO L290 TraceCheckUtils]: 48: Hoare triple {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} foo_#res#1 := foo_~i~0#1; {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:59,099 INFO L290 TraceCheckUtils]: 49: Hoare triple {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:59,100 INFO L290 TraceCheckUtils]: 50: Hoare triple {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:59,100 INFO L290 TraceCheckUtils]: 51: Hoare triple {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} havoc main_#t~ret3#1; {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:59,100 INFO L290 TraceCheckUtils]: 52: Hoare triple {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} is VALID [2022-02-20 23:49:59,101 INFO L290 TraceCheckUtils]: 53: Hoare triple {9451#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)))} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {9608#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} is VALID [2022-02-20 23:49:59,101 INFO L290 TraceCheckUtils]: 54: Hoare triple {9608#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} assume !!(foo_~i~0#1 <= foo_~size#1); {9608#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} is VALID [2022-02-20 23:49:59,102 INFO L290 TraceCheckUtils]: 55: Hoare triple {9608#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {9608#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} is VALID [2022-02-20 23:49:59,102 INFO L290 TraceCheckUtils]: 56: Hoare triple {9608#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {9608#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} is VALID [2022-02-20 23:49:59,103 INFO L290 TraceCheckUtils]: 57: Hoare triple {9608#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {9608#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} is VALID [2022-02-20 23:49:59,103 INFO L290 TraceCheckUtils]: 58: Hoare triple {9608#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {9608#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} is VALID [2022-02-20 23:49:59,103 INFO L290 TraceCheckUtils]: 59: Hoare triple {9608#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} assume !!(foo_~i~0#1 <= foo_~size#1); {9608#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} is VALID [2022-02-20 23:49:59,104 INFO L290 TraceCheckUtils]: 60: Hoare triple {9608#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {9608#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} is VALID [2022-02-20 23:49:59,104 INFO L290 TraceCheckUtils]: 61: Hoare triple {9608#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {9608#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} is VALID [2022-02-20 23:49:59,105 INFO L290 TraceCheckUtils]: 62: Hoare triple {9608#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {9608#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} is VALID [2022-02-20 23:49:59,105 INFO L290 TraceCheckUtils]: 63: Hoare triple {9608#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {9608#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} is VALID [2022-02-20 23:49:59,105 INFO L290 TraceCheckUtils]: 64: Hoare triple {9608#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} assume !!(foo_~i~0#1 <= foo_~size#1); {9608#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} is VALID [2022-02-20 23:49:59,106 INFO L290 TraceCheckUtils]: 65: Hoare triple {9608#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {9608#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} is VALID [2022-02-20 23:49:59,106 INFO L290 TraceCheckUtils]: 66: Hoare triple {9608#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {9608#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} is VALID [2022-02-20 23:49:59,107 INFO L290 TraceCheckUtils]: 67: Hoare triple {9608#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {9608#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} is VALID [2022-02-20 23:49:59,107 INFO L290 TraceCheckUtils]: 68: Hoare triple {9608#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {9608#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} is VALID [2022-02-20 23:49:59,107 INFO L290 TraceCheckUtils]: 69: Hoare triple {9608#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} assume !!(foo_~i~0#1 <= foo_~size#1); {9608#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} is VALID [2022-02-20 23:49:59,108 INFO L290 TraceCheckUtils]: 70: Hoare triple {9608#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {9608#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} is VALID [2022-02-20 23:49:59,108 INFO L290 TraceCheckUtils]: 71: Hoare triple {9608#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {9608#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} is VALID [2022-02-20 23:49:59,109 INFO L290 TraceCheckUtils]: 72: Hoare triple {9608#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {9608#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} is VALID [2022-02-20 23:49:59,109 INFO L290 TraceCheckUtils]: 73: Hoare triple {9608#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {9608#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} is VALID [2022-02-20 23:49:59,109 INFO L290 TraceCheckUtils]: 74: Hoare triple {9608#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} assume !!(foo_~i~0#1 <= foo_~size#1); {9608#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} is VALID [2022-02-20 23:49:59,110 INFO L290 TraceCheckUtils]: 75: Hoare triple {9608#(and (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {9675#(and (< |ULTIMATE.start_foo_~i~0#1| 32) (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} is VALID [2022-02-20 23:49:59,110 INFO L290 TraceCheckUtils]: 76: Hoare triple {9675#(and (< |ULTIMATE.start_foo_~i~0#1| 32) (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 32 (select |#length| |ULTIMATE.start_foo_~b#1.base|)) (<= 0 |ULTIMATE.start_foo_~i~0#1|))} assume !(1 + (foo_~b#1.offset + foo_~i~0#1) <= #length[foo_~b#1.base] && 0 <= foo_~b#1.offset + foo_~i~0#1); {9441#false} is VALID [2022-02-20 23:49:59,111 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 4 proven. 153 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2022-02-20 23:49:59,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:49:59,798 INFO L290 TraceCheckUtils]: 76: Hoare triple {9679#(and (<= 0 (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset|)) (<= (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1) (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} assume !(1 + (foo_~b#1.offset + foo_~i~0#1) <= #length[foo_~b#1.base] && 0 <= foo_~b#1.offset + foo_~i~0#1); {9441#false} is VALID [2022-02-20 23:49:59,798 INFO L290 TraceCheckUtils]: 75: Hoare triple {9683#(and (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= (+ 32 |ULTIMATE.start_foo_~b#1.offset|) (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {9679#(and (<= 0 (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset|)) (<= (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1) (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} is VALID [2022-02-20 23:49:59,799 INFO L290 TraceCheckUtils]: 74: Hoare triple {9683#(and (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= (+ 32 |ULTIMATE.start_foo_~b#1.offset|) (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} assume !!(foo_~i~0#1 <= foo_~size#1); {9683#(and (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= (+ 32 |ULTIMATE.start_foo_~b#1.offset|) (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} is VALID [2022-02-20 23:49:59,799 INFO L290 TraceCheckUtils]: 73: Hoare triple {9683#(and (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= (+ 32 |ULTIMATE.start_foo_~b#1.offset|) (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {9683#(and (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= (+ 32 |ULTIMATE.start_foo_~b#1.offset|) (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} is VALID [2022-02-20 23:49:59,800 INFO L290 TraceCheckUtils]: 72: Hoare triple {9683#(and (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= (+ 32 |ULTIMATE.start_foo_~b#1.offset|) (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {9683#(and (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= (+ 32 |ULTIMATE.start_foo_~b#1.offset|) (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} is VALID [2022-02-20 23:49:59,800 INFO L290 TraceCheckUtils]: 71: Hoare triple {9683#(and (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= (+ 32 |ULTIMATE.start_foo_~b#1.offset|) (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {9683#(and (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= (+ 32 |ULTIMATE.start_foo_~b#1.offset|) (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} is VALID [2022-02-20 23:49:59,801 INFO L290 TraceCheckUtils]: 70: Hoare triple {9683#(and (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= (+ 32 |ULTIMATE.start_foo_~b#1.offset|) (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {9683#(and (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= (+ 32 |ULTIMATE.start_foo_~b#1.offset|) (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} is VALID [2022-02-20 23:49:59,801 INFO L290 TraceCheckUtils]: 69: Hoare triple {9683#(and (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= (+ 32 |ULTIMATE.start_foo_~b#1.offset|) (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} assume !!(foo_~i~0#1 <= foo_~size#1); {9683#(and (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= (+ 32 |ULTIMATE.start_foo_~b#1.offset|) (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} is VALID [2022-02-20 23:49:59,801 INFO L290 TraceCheckUtils]: 68: Hoare triple {9683#(and (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= (+ 32 |ULTIMATE.start_foo_~b#1.offset|) (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {9683#(and (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= (+ 32 |ULTIMATE.start_foo_~b#1.offset|) (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} is VALID [2022-02-20 23:49:59,802 INFO L290 TraceCheckUtils]: 67: Hoare triple {9683#(and (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= (+ 32 |ULTIMATE.start_foo_~b#1.offset|) (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {9683#(and (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= (+ 32 |ULTIMATE.start_foo_~b#1.offset|) (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} is VALID [2022-02-20 23:49:59,802 INFO L290 TraceCheckUtils]: 66: Hoare triple {9683#(and (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= (+ 32 |ULTIMATE.start_foo_~b#1.offset|) (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {9683#(and (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= (+ 32 |ULTIMATE.start_foo_~b#1.offset|) (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} is VALID [2022-02-20 23:49:59,803 INFO L290 TraceCheckUtils]: 65: Hoare triple {9683#(and (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= (+ 32 |ULTIMATE.start_foo_~b#1.offset|) (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {9683#(and (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= (+ 32 |ULTIMATE.start_foo_~b#1.offset|) (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} is VALID [2022-02-20 23:49:59,803 INFO L290 TraceCheckUtils]: 64: Hoare triple {9683#(and (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= (+ 32 |ULTIMATE.start_foo_~b#1.offset|) (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} assume !!(foo_~i~0#1 <= foo_~size#1); {9683#(and (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= (+ 32 |ULTIMATE.start_foo_~b#1.offset|) (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} is VALID [2022-02-20 23:49:59,804 INFO L290 TraceCheckUtils]: 63: Hoare triple {9683#(and (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= (+ 32 |ULTIMATE.start_foo_~b#1.offset|) (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {9683#(and (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= (+ 32 |ULTIMATE.start_foo_~b#1.offset|) (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} is VALID [2022-02-20 23:49:59,804 INFO L290 TraceCheckUtils]: 62: Hoare triple {9683#(and (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= (+ 32 |ULTIMATE.start_foo_~b#1.offset|) (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {9683#(and (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= (+ 32 |ULTIMATE.start_foo_~b#1.offset|) (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} is VALID [2022-02-20 23:49:59,804 INFO L290 TraceCheckUtils]: 61: Hoare triple {9683#(and (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= (+ 32 |ULTIMATE.start_foo_~b#1.offset|) (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {9683#(and (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= (+ 32 |ULTIMATE.start_foo_~b#1.offset|) (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} is VALID [2022-02-20 23:49:59,805 INFO L290 TraceCheckUtils]: 60: Hoare triple {9683#(and (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= (+ 32 |ULTIMATE.start_foo_~b#1.offset|) (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {9683#(and (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= (+ 32 |ULTIMATE.start_foo_~b#1.offset|) (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} is VALID [2022-02-20 23:49:59,805 INFO L290 TraceCheckUtils]: 59: Hoare triple {9683#(and (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= (+ 32 |ULTIMATE.start_foo_~b#1.offset|) (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} assume !!(foo_~i~0#1 <= foo_~size#1); {9683#(and (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= (+ 32 |ULTIMATE.start_foo_~b#1.offset|) (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} is VALID [2022-02-20 23:49:59,806 INFO L290 TraceCheckUtils]: 58: Hoare triple {9683#(and (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= (+ 32 |ULTIMATE.start_foo_~b#1.offset|) (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {9683#(and (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= (+ 32 |ULTIMATE.start_foo_~b#1.offset|) (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} is VALID [2022-02-20 23:49:59,806 INFO L290 TraceCheckUtils]: 57: Hoare triple {9683#(and (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= (+ 32 |ULTIMATE.start_foo_~b#1.offset|) (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {9683#(and (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= (+ 32 |ULTIMATE.start_foo_~b#1.offset|) (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} is VALID [2022-02-20 23:49:59,807 INFO L290 TraceCheckUtils]: 56: Hoare triple {9683#(and (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= (+ 32 |ULTIMATE.start_foo_~b#1.offset|) (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {9683#(and (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= (+ 32 |ULTIMATE.start_foo_~b#1.offset|) (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} is VALID [2022-02-20 23:49:59,807 INFO L290 TraceCheckUtils]: 55: Hoare triple {9683#(and (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= (+ 32 |ULTIMATE.start_foo_~b#1.offset|) (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {9683#(and (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= (+ 32 |ULTIMATE.start_foo_~b#1.offset|) (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} is VALID [2022-02-20 23:49:59,807 INFO L290 TraceCheckUtils]: 54: Hoare triple {9683#(and (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= (+ 32 |ULTIMATE.start_foo_~b#1.offset|) (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} assume !!(foo_~i~0#1 <= foo_~size#1); {9683#(and (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= (+ 32 |ULTIMATE.start_foo_~b#1.offset|) (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} is VALID [2022-02-20 23:49:59,808 INFO L290 TraceCheckUtils]: 53: Hoare triple {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {9683#(and (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= (+ 32 |ULTIMATE.start_foo_~b#1.offset|) (select |#length| |ULTIMATE.start_foo_~b#1.base|)))} is VALID [2022-02-20 23:49:59,808 INFO L290 TraceCheckUtils]: 52: Hoare triple {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} is VALID [2022-02-20 23:49:59,809 INFO L290 TraceCheckUtils]: 51: Hoare triple {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} havoc main_#t~ret3#1; {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} is VALID [2022-02-20 23:49:59,809 INFO L290 TraceCheckUtils]: 50: Hoare triple {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} is VALID [2022-02-20 23:49:59,810 INFO L290 TraceCheckUtils]: 49: Hoare triple {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} is VALID [2022-02-20 23:49:59,810 INFO L290 TraceCheckUtils]: 48: Hoare triple {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} foo_#res#1 := foo_~i~0#1; {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} is VALID [2022-02-20 23:49:59,810 INFO L290 TraceCheckUtils]: 47: Hoare triple {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} assume !(foo_~i~0#1 <= foo_~size#1); {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} is VALID [2022-02-20 23:49:59,811 INFO L290 TraceCheckUtils]: 46: Hoare triple {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} is VALID [2022-02-20 23:49:59,811 INFO L290 TraceCheckUtils]: 45: Hoare triple {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} is VALID [2022-02-20 23:49:59,812 INFO L290 TraceCheckUtils]: 44: Hoare triple {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} is VALID [2022-02-20 23:49:59,812 INFO L290 TraceCheckUtils]: 43: Hoare triple {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} is VALID [2022-02-20 23:49:59,813 INFO L290 TraceCheckUtils]: 42: Hoare triple {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} assume !!(foo_~i~0#1 <= foo_~size#1); {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} is VALID [2022-02-20 23:49:59,813 INFO L290 TraceCheckUtils]: 41: Hoare triple {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} is VALID [2022-02-20 23:49:59,813 INFO L290 TraceCheckUtils]: 40: Hoare triple {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} is VALID [2022-02-20 23:49:59,814 INFO L290 TraceCheckUtils]: 39: Hoare triple {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} is VALID [2022-02-20 23:49:59,814 INFO L290 TraceCheckUtils]: 38: Hoare triple {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} is VALID [2022-02-20 23:49:59,815 INFO L290 TraceCheckUtils]: 37: Hoare triple {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} assume !!(foo_~i~0#1 <= foo_~size#1); {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} is VALID [2022-02-20 23:49:59,815 INFO L290 TraceCheckUtils]: 36: Hoare triple {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} is VALID [2022-02-20 23:49:59,815 INFO L290 TraceCheckUtils]: 35: Hoare triple {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} is VALID [2022-02-20 23:49:59,816 INFO L290 TraceCheckUtils]: 34: Hoare triple {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} is VALID [2022-02-20 23:49:59,816 INFO L290 TraceCheckUtils]: 33: Hoare triple {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} is VALID [2022-02-20 23:49:59,817 INFO L290 TraceCheckUtils]: 32: Hoare triple {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} assume !!(foo_~i~0#1 <= foo_~size#1); {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} is VALID [2022-02-20 23:49:59,817 INFO L290 TraceCheckUtils]: 31: Hoare triple {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} is VALID [2022-02-20 23:49:59,818 INFO L290 TraceCheckUtils]: 30: Hoare triple {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} is VALID [2022-02-20 23:49:59,818 INFO L290 TraceCheckUtils]: 29: Hoare triple {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} havoc main_#t~ret3#1; {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} is VALID [2022-02-20 23:49:59,818 INFO L290 TraceCheckUtils]: 28: Hoare triple {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} is VALID [2022-02-20 23:49:59,819 INFO L290 TraceCheckUtils]: 27: Hoare triple {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} is VALID [2022-02-20 23:49:59,819 INFO L290 TraceCheckUtils]: 26: Hoare triple {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} foo_#res#1 := foo_~i~0#1; {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} is VALID [2022-02-20 23:49:59,820 INFO L290 TraceCheckUtils]: 25: Hoare triple {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} assume !(foo_~i~0#1 <= foo_~size#1); {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} is VALID [2022-02-20 23:49:59,820 INFO L290 TraceCheckUtils]: 24: Hoare triple {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} is VALID [2022-02-20 23:49:59,820 INFO L290 TraceCheckUtils]: 23: Hoare triple {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} is VALID [2022-02-20 23:49:59,821 INFO L290 TraceCheckUtils]: 22: Hoare triple {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} is VALID [2022-02-20 23:49:59,821 INFO L290 TraceCheckUtils]: 21: Hoare triple {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} is VALID [2022-02-20 23:49:59,822 INFO L290 TraceCheckUtils]: 20: Hoare triple {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} assume !!(foo_~i~0#1 <= foo_~size#1); {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} is VALID [2022-02-20 23:49:59,822 INFO L290 TraceCheckUtils]: 19: Hoare triple {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} is VALID [2022-02-20 23:49:59,823 INFO L290 TraceCheckUtils]: 18: Hoare triple {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} is VALID [2022-02-20 23:49:59,823 INFO L290 TraceCheckUtils]: 17: Hoare triple {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} is VALID [2022-02-20 23:49:59,823 INFO L290 TraceCheckUtils]: 16: Hoare triple {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} is VALID [2022-02-20 23:49:59,824 INFO L290 TraceCheckUtils]: 15: Hoare triple {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} assume !!(foo_~i~0#1 <= foo_~size#1); {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} is VALID [2022-02-20 23:49:59,824 INFO L290 TraceCheckUtils]: 14: Hoare triple {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} is VALID [2022-02-20 23:49:59,836 INFO L290 TraceCheckUtils]: 13: Hoare triple {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} is VALID [2022-02-20 23:49:59,837 INFO L290 TraceCheckUtils]: 12: Hoare triple {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} havoc main_#t~ret3#1; {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} is VALID [2022-02-20 23:49:59,837 INFO L290 TraceCheckUtils]: 11: Hoare triple {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} SUMMARY for call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L27 {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} is VALID [2022-02-20 23:49:59,838 INFO L290 TraceCheckUtils]: 10: Hoare triple {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;assume -2147483648 <= main_#t~ret3#1 && main_#t~ret3#1 <= 2147483647; {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} is VALID [2022-02-20 23:49:59,838 INFO L290 TraceCheckUtils]: 9: Hoare triple {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} foo_#res#1 := foo_~i~0#1; {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} is VALID [2022-02-20 23:49:59,839 INFO L290 TraceCheckUtils]: 8: Hoare triple {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} assume !(foo_~i~0#1 <= foo_~size#1); {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} is VALID [2022-02-20 23:49:59,839 INFO L290 TraceCheckUtils]: 7: Hoare triple {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} is VALID [2022-02-20 23:49:59,839 INFO L290 TraceCheckUtils]: 6: Hoare triple {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} is VALID [2022-02-20 23:49:59,840 INFO L290 TraceCheckUtils]: 5: Hoare triple {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} SUMMARY for call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1); srcloc: L18-1 {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} is VALID [2022-02-20 23:49:59,840 INFO L290 TraceCheckUtils]: 4: Hoare triple {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32; {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} is VALID [2022-02-20 23:49:59,841 INFO L290 TraceCheckUtils]: 3: Hoare triple {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} assume !!(foo_~i~0#1 <= foo_~size#1); {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} is VALID [2022-02-20 23:49:59,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} assume !!(main_~i~1#1 % 4294967296 < 32);assume { :begin_inline_foo } true;foo_#in~b#1.base, foo_#in~b#1.offset, foo_#in~size#1 := main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~i~1#1;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~b#1.base, foo_~b#1.offset, foo_~size#1, foo_~a~0#1, foo_~i~0#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;foo_~size#1 := foo_#in~size#1;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} is VALID [2022-02-20 23:49:59,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {9440#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#mask~0#1.base, main_~#mask~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(128);call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);main_~i~1#1 := 0; {9750#(and (<= (+ 32 |ULTIMATE.start_main_~#mask~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#mask~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|))} is VALID [2022-02-20 23:49:59,842 INFO L290 TraceCheckUtils]: 0: Hoare triple {9440#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {9440#true} is VALID [2022-02-20 23:49:59,842 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 157 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2022-02-20 23:49:59,843 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829681328] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:49:59,843 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:49:59,843 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-02-20 23:49:59,843 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961133946] [2022-02-20 23:49:59,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:49:59,843 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.4) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-02-20 23:49:59,844 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:59,844 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 6.4) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:59,887 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:59,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 23:49:59,887 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:59,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 23:49:59,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:49:59,888 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand has 11 states, 10 states have (on average 6.4) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:59,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:59,947 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2022-02-20 23:49:59,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:49:59,947 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.4) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-02-20 23:49:59,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:59,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 6.4) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:59,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2022-02-20 23:49:59,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 6.4) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:59,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2022-02-20 23:49:59,948 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 18 transitions. [2022-02-20 23:49:59,961 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:59,961 INFO L225 Difference]: With dead ends: 77 [2022-02-20 23:49:59,962 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 23:49:59,962 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-02-20 23:49:59,962 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 18 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:59,962 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 17 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:49:59,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 23:49:59,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 23:49:59,963 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:59,963 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:59,963 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:59,963 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:59,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:59,963 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 23:49:59,963 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 23:49:59,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:59,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:59,963 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 23:49:59,964 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 23:49:59,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:59,964 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 23:49:59,964 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 23:49:59,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:59,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:59,964 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:59,964 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:59,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:59,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 23:49:59,964 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 77 [2022-02-20 23:49:59,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:59,964 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 23:49:59,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.4) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:59,964 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 23:49:59,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:59,966 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX (7 of 8 remaining) [2022-02-20 23:49:59,966 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATION (6 of 8 remaining) [2022-02-20 23:49:59,967 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATION (5 of 8 remaining) [2022-02-20 23:49:59,967 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATION (4 of 8 remaining) [2022-02-20 23:49:59,967 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATION (3 of 8 remaining) [2022-02-20 23:49:59,967 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATION (2 of 8 remaining) [2022-02-20 23:49:59,967 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATION (1 of 8 remaining) [2022-02-20 23:49:59,967 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2022-02-20 23:49:59,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:00,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:50:00,185 INFO L732 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:00,186 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 23:50:00,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 11:50:00 BoogieIcfgContainer [2022-02-20 23:50:00,188 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 23:50:00,188 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 23:50:00,189 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 23:50:00,189 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 23:50:00,189 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:49:29" (3/4) ... [2022-02-20 23:50:00,191 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 23:50:00,197 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2022-02-20 23:50:00,197 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 23:50:00,197 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 23:50:00,198 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 23:50:00,217 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 23:50:00,217 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 23:50:00,218 INFO L158 Benchmark]: Toolchain (without parser) took 31532.58ms. Allocated memory was 117.4MB in the beginning and 249.6MB in the end (delta: 132.1MB). Free memory was 88.4MB in the beginning and 202.2MB in the end (delta: -113.8MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2022-02-20 23:50:00,218 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 117.4MB. Free memory is still 72.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:50:00,218 INFO L158 Benchmark]: CACSL2BoogieTranslator took 155.78ms. Allocated memory is still 117.4MB. Free memory was 88.1MB in the beginning and 93.3MB in the end (delta: -5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 23:50:00,218 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.49ms. Allocated memory is still 117.4MB. Free memory was 93.3MB in the beginning and 91.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:50:00,218 INFO L158 Benchmark]: Boogie Preprocessor took 15.81ms. Allocated memory is still 117.4MB. Free memory was 91.8MB in the beginning and 90.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:50:00,218 INFO L158 Benchmark]: RCFGBuilder took 309.55ms. Allocated memory is still 117.4MB. Free memory was 90.5MB in the beginning and 76.9MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 23:50:00,219 INFO L158 Benchmark]: TraceAbstraction took 30985.69ms. Allocated memory was 117.4MB in the beginning and 249.6MB in the end (delta: 132.1MB). Free memory was 76.5MB in the beginning and 204.1MB in the end (delta: -127.6MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2022-02-20 23:50:00,219 INFO L158 Benchmark]: Witness Printer took 28.43ms. Allocated memory is still 249.6MB. Free memory was 204.1MB in the beginning and 202.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:50:00,220 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 117.4MB. Free memory is still 72.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 155.78ms. Allocated memory is still 117.4MB. Free memory was 88.1MB in the beginning and 93.3MB in the end (delta: -5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.49ms. Allocated memory is still 117.4MB. Free memory was 93.3MB in the beginning and 91.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 15.81ms. Allocated memory is still 117.4MB. Free memory was 91.8MB in the beginning and 90.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 309.55ms. Allocated memory is still 117.4MB. Free memory was 90.5MB in the beginning and 76.9MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 30985.69ms. Allocated memory was 117.4MB in the beginning and 249.6MB in the end (delta: 132.1MB). Free memory was 76.5MB in the beginning and 204.1MB in the end (delta: -127.6MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. * Witness Printer took 28.43ms. Allocated memory is still 249.6MB. Free memory was 204.1MB in the beginning and 202.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 18]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 31 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 30.9s, OverallIterations: 22, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2061 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2061 mSDsluCounter, 1222 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 44 IncrementalHoareTripleChecker+Unchecked, 810 mSDsCounter, 328 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1715 IncrementalHoareTripleChecker+Invalid, 2087 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 328 mSolverCounterUnsat, 412 mSDtfsCounter, 1715 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1129 GetRequests, 894 SyntacticMatches, 7 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 962 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=15, InterpolantAutomatonStates: 158, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 22 MinimizatonAttempts, 358 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 18.5s InterpolantComputationTime, 1186 NumberOfCodeBlocks, 972 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 1543 ConstructedInterpolants, 116 QuantifiedInterpolants, 13298 SizeOfPredicates, 63 NumberOfNonLiveVariables, 1680 ConjunctsInSsa, 187 ConjunctsInUnsatCore, 48 InterpolantComputations, 11 PerfectInterpolantSequences, 1365/2646 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-02-20 23:50:00,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE