./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength5.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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/ArraysOfVariableLength5.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 32d9f155778c5c4efaa55d37fdad329bb0d271b5 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:00:29,453 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:00:29,456 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:00:29,469 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:00:29,469 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:00:29,470 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:00:29,472 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:00:29,474 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:00:29,476 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:00:29,477 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:00:29,478 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:00:29,479 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:00:29,480 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:00:29,481 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:00:29,482 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:00:29,483 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:00:29,484 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:00:29,485 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:00:29,487 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:00:29,489 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:00:29,491 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:00:29,492 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:00:29,494 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:00:29,494 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:00:29,497 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:00:29,497 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:00:29,498 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:00:29,499 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:00:29,499 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:00:29,500 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:00:29,501 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:00:29,501 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:00:29,502 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:00:29,503 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:00:29,505 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:00:29,505 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:00:29,506 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:00:29,506 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:00:29,506 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:00:29,507 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:00:29,508 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:00:29,509 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2020-07-29 01:00:29,529 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:00:29,529 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:00:29,531 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:00:29,531 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:00:29,532 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:00:29,532 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:00:29,532 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 01:00:29,532 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:00:29,533 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:00:29,533 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 01:00:29,534 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:00:29,535 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-07-29 01:00:29,535 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-07-29 01:00:29,535 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-07-29 01:00:29,536 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-29 01:00:29,536 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-07-29 01:00:29,536 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 01:00:29,536 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:00:29,537 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:00:29,537 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:00:29,537 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-29 01:00:29,538 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-29 01:00:29,538 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 01:00:29,538 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:00:29,538 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-29 01:00:29,539 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:00:29,539 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-29 01:00:29,539 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:00:29,540 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 32d9f155778c5c4efaa55d37fdad329bb0d271b5 [2020-07-29 01:00:29,902 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:00:29,923 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:00:29,927 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:00:29,929 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:00:29,929 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:00:29,930 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength5.c [2020-07-29 01:00:30,005 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3768d6856/afaf32f7edb94d7eb81a58e636874dac/FLAG7ad056e01 [2020-07-29 01:00:30,511 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:00:30,512 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength5.c [2020-07-29 01:00:30,520 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3768d6856/afaf32f7edb94d7eb81a58e636874dac/FLAG7ad056e01 [2020-07-29 01:00:30,916 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3768d6856/afaf32f7edb94d7eb81a58e636874dac [2020-07-29 01:00:30,920 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:00:30,922 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-07-29 01:00:30,923 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:00:30,924 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:00:30,927 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:00:30,929 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:00:30" (1/1) ... [2020-07-29 01:00:30,932 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f453bc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:00:30, skipping insertion in model container [2020-07-29 01:00:30,932 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:00:30" (1/1) ... [2020-07-29 01:00:30,941 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:00:30,963 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:00:31,163 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:00:31,182 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:00:31,205 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:00:31,225 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:00:31,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:00:31 WrapperNode [2020-07-29 01:00:31,226 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:00:31,227 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:00:31,227 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:00:31,227 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:00:31,296 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:00:31" (1/1) ... [2020-07-29 01:00:31,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:00:31" (1/1) ... [2020-07-29 01:00:31,304 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:00:31" (1/1) ... [2020-07-29 01:00:31,305 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:00:31" (1/1) ... [2020-07-29 01:00:31,322 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:00:31" (1/1) ... [2020-07-29 01:00:31,328 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:00:31" (1/1) ... [2020-07-29 01:00:31,330 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:00:31" (1/1) ... [2020-07-29 01:00:31,332 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:00:31,340 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:00:31,341 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:00:31,341 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:00:31,342 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:00:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 01:00:31,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-29 01:00:31,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:00:31,400 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2020-07-29 01:00:31,400 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-29 01:00:31,400 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2020-07-29 01:00:31,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:00:31,401 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-29 01:00:31,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:00:31,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:00:31,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:00:31,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-29 01:00:31,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:00:31,848 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:00:31,849 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-29 01:00:31,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:00:31 BoogieIcfgContainer [2020-07-29 01:00:31,853 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:00:31,855 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-29 01:00:31,855 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-29 01:00:31,859 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-29 01:00:31,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.07 01:00:30" (1/3) ... [2020-07-29 01:00:31,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48877c7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:00:31, skipping insertion in model container [2020-07-29 01:00:31,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:00:31" (2/3) ... [2020-07-29 01:00:31,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48877c7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:00:31, skipping insertion in model container [2020-07-29 01:00:31,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:00:31" (3/3) ... [2020-07-29 01:00:31,863 INFO L109 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength5.c [2020-07-29 01:00:31,875 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-29 01:00:31,884 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2020-07-29 01:00:31,900 INFO L251 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-07-29 01:00:31,922 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-29 01:00:31,923 INFO L376 AbstractCegarLoop]: Hoare is false [2020-07-29 01:00:31,923 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-29 01:00:31,923 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:00:31,924 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:00:31,924 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-29 01:00:31,924 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:00:31,924 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-29 01:00:31,941 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2020-07-29 01:00:31,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-29 01:00:31,951 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:00:31,952 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:00:31,952 INFO L427 AbstractCegarLoop]: === Iteration 1 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:00:31,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:00:31,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1909189377, now seen corresponding path program 1 times [2020-07-29 01:00:31,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:00:31,968 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115231837] [2020-07-29 01:00:31,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:00:32,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:32,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:00:32,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:32,186 INFO L280 TraceCheckUtils]: 0: Hoare triple {49#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {43#true} is VALID [2020-07-29 01:00:32,186 INFO L280 TraceCheckUtils]: 1: Hoare triple {43#true} assume true; {43#true} is VALID [2020-07-29 01:00:32,187 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {43#true} {43#true} #74#return; {43#true} is VALID [2020-07-29 01:00:32,191 INFO L263 TraceCheckUtils]: 0: Hoare triple {43#true} call ULTIMATE.init(); {49#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:00:32,191 INFO L280 TraceCheckUtils]: 1: Hoare triple {49#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {43#true} is VALID [2020-07-29 01:00:32,192 INFO L280 TraceCheckUtils]: 2: Hoare triple {43#true} assume true; {43#true} is VALID [2020-07-29 01:00:32,192 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {43#true} {43#true} #74#return; {43#true} is VALID [2020-07-29 01:00:32,192 INFO L263 TraceCheckUtils]: 4: Hoare triple {43#true} call #t~ret6 := main(); {43#true} is VALID [2020-07-29 01:00:32,196 INFO L280 TraceCheckUtils]: 5: Hoare triple {43#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(128);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {48#(= 0 main_~i~1)} is VALID [2020-07-29 01:00:32,198 INFO L280 TraceCheckUtils]: 6: Hoare triple {48#(= 0 main_~i~1)} assume !(~i~1 < 32); {44#false} is VALID [2020-07-29 01:00:32,198 INFO L280 TraceCheckUtils]: 7: Hoare triple {44#false} ~i~1 := 0; {44#false} is VALID [2020-07-29 01:00:32,199 INFO L280 TraceCheckUtils]: 8: Hoare triple {44#false} assume !!(~i~1 < 32); {44#false} is VALID [2020-07-29 01:00:32,199 INFO L280 TraceCheckUtils]: 9: Hoare triple {44#false} assume !(1 == #valid[~#b~0.base]); {44#false} is VALID [2020-07-29 01:00:32,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:00:32,201 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115231837] [2020-07-29 01:00:32,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:00:32,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:00:32,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366808981] [2020-07-29 01:00:32,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-07-29 01:00:32,214 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:00:32,218 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:00:32,244 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:32,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:00:32,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:00:32,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:00:32,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:00:32,258 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 4 states. [2020-07-29 01:00:32,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:32,642 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2020-07-29 01:00:32,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:00:32,643 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-07-29 01:00:32,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:00:32,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:00:32,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2020-07-29 01:00:32,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:00:32,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2020-07-29 01:00:32,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2020-07-29 01:00:32,804 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:32,834 INFO L225 Difference]: With dead ends: 58 [2020-07-29 01:00:32,838 INFO L226 Difference]: Without dead ends: 54 [2020-07-29 01:00:32,840 INFO L675 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 [2020-07-29 01:00:32,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-07-29 01:00:32,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2020-07-29 01:00:32,892 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:00:32,893 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 39 states. [2020-07-29 01:00:32,894 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 39 states. [2020-07-29 01:00:32,894 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 39 states. [2020-07-29 01:00:32,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:32,908 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2020-07-29 01:00:32,908 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2020-07-29 01:00:32,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:32,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:32,910 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 54 states. [2020-07-29 01:00:32,911 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 54 states. [2020-07-29 01:00:32,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:32,924 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2020-07-29 01:00:32,924 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2020-07-29 01:00:32,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:32,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:32,927 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:00:32,927 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:00:32,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-29 01:00:32,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2020-07-29 01:00:32,934 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 10 [2020-07-29 01:00:32,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:00:32,935 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2020-07-29 01:00:32,935 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:00:32,935 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2020-07-29 01:00:32,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-29 01:00:32,936 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:00:32,936 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:00:32,938 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-29 01:00:32,938 INFO L427 AbstractCegarLoop]: === Iteration 2 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:00:32,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:00:32,939 INFO L82 PathProgramCache]: Analyzing trace with hash -941983064, now seen corresponding path program 1 times [2020-07-29 01:00:32,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:00:32,940 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388021541] [2020-07-29 01:00:32,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:00:32,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:33,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:00:33,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:33,065 INFO L280 TraceCheckUtils]: 0: Hoare triple {267#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {259#true} is VALID [2020-07-29 01:00:33,065 INFO L280 TraceCheckUtils]: 1: Hoare triple {259#true} assume true; {259#true} is VALID [2020-07-29 01:00:33,066 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {259#true} {259#true} #74#return; {259#true} is VALID [2020-07-29 01:00:33,067 INFO L263 TraceCheckUtils]: 0: Hoare triple {259#true} call ULTIMATE.init(); {267#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:00:33,068 INFO L280 TraceCheckUtils]: 1: Hoare triple {267#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {259#true} is VALID [2020-07-29 01:00:33,068 INFO L280 TraceCheckUtils]: 2: Hoare triple {259#true} assume true; {259#true} is VALID [2020-07-29 01:00:33,069 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {259#true} {259#true} #74#return; {259#true} is VALID [2020-07-29 01:00:33,069 INFO L263 TraceCheckUtils]: 4: Hoare triple {259#true} call #t~ret6 := main(); {259#true} is VALID [2020-07-29 01:00:33,071 INFO L280 TraceCheckUtils]: 5: Hoare triple {259#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(128);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {264#(= 0 main_~i~1)} is VALID [2020-07-29 01:00:33,072 INFO L280 TraceCheckUtils]: 6: Hoare triple {264#(= 0 main_~i~1)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {264#(= 0 main_~i~1)} is VALID [2020-07-29 01:00:33,074 INFO L263 TraceCheckUtils]: 7: Hoare triple {264#(= 0 main_~i~1)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {265#(= 0 |foo_#in~size|)} is VALID [2020-07-29 01:00:33,075 INFO L280 TraceCheckUtils]: 8: Hoare triple {265#(= 0 |foo_#in~size|)} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {266#(and (= 0 foo_~i~0) (= 0 foo_~size))} is VALID [2020-07-29 01:00:33,076 INFO L280 TraceCheckUtils]: 9: Hoare triple {266#(and (= 0 foo_~i~0) (= 0 foo_~size))} assume !!(~i~0 < ~size); {260#false} is VALID [2020-07-29 01:00:33,077 INFO L280 TraceCheckUtils]: 10: Hoare triple {260#false} assume !(0 <= ~i~0 && ~i~0 < 32); {260#false} is VALID [2020-07-29 01:00:33,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:00:33,079 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388021541] [2020-07-29 01:00:33,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:00:33,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-29 01:00:33,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830785590] [2020-07-29 01:00:33,081 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-07-29 01:00:33,082 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:00:33,082 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:00:33,099 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:33,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-29 01:00:33,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:00:33,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:00:33,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:00:33,101 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 6 states. [2020-07-29 01:00:33,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:33,560 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2020-07-29 01:00:33,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:00:33,561 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-07-29 01:00:33,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:00:33,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:00:33,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2020-07-29 01:00:33,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:00:33,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2020-07-29 01:00:33,571 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 63 transitions. [2020-07-29 01:00:33,662 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:33,665 INFO L225 Difference]: With dead ends: 59 [2020-07-29 01:00:33,665 INFO L226 Difference]: Without dead ends: 59 [2020-07-29 01:00:33,666 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-29 01:00:33,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-29 01:00:33,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 45. [2020-07-29 01:00:33,672 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:00:33,672 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 45 states. [2020-07-29 01:00:33,673 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 45 states. [2020-07-29 01:00:33,673 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 45 states. [2020-07-29 01:00:33,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:33,678 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2020-07-29 01:00:33,679 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2020-07-29 01:00:33,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:33,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:33,680 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 59 states. [2020-07-29 01:00:33,680 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 59 states. [2020-07-29 01:00:33,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:33,685 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2020-07-29 01:00:33,686 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2020-07-29 01:00:33,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:33,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:33,687 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:00:33,687 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:00:33,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-29 01:00:33,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2020-07-29 01:00:33,691 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 11 [2020-07-29 01:00:33,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:00:33,692 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2020-07-29 01:00:33,692 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-29 01:00:33,692 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2020-07-29 01:00:33,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-29 01:00:33,693 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:00:33,693 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:00:33,694 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-29 01:00:33,694 INFO L427 AbstractCegarLoop]: === Iteration 3 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:00:33,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:00:33,695 INFO L82 PathProgramCache]: Analyzing trace with hash 143250926, now seen corresponding path program 1 times [2020-07-29 01:00:33,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:00:33,696 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654024580] [2020-07-29 01:00:33,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:00:33,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:33,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:00:33,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:33,783 INFO L280 TraceCheckUtils]: 0: Hoare triple {507#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {496#true} is VALID [2020-07-29 01:00:33,783 INFO L280 TraceCheckUtils]: 1: Hoare triple {496#true} assume true; {496#true} is VALID [2020-07-29 01:00:33,784 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {496#true} {496#true} #74#return; {496#true} is VALID [2020-07-29 01:00:33,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-07-29 01:00:33,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:33,795 INFO L280 TraceCheckUtils]: 0: Hoare triple {496#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {496#true} is VALID [2020-07-29 01:00:33,796 INFO L280 TraceCheckUtils]: 1: Hoare triple {496#true} assume !(~i~0 < ~size); {496#true} is VALID [2020-07-29 01:00:33,796 INFO L280 TraceCheckUtils]: 2: Hoare triple {496#true} #res := ~i~0; {496#true} is VALID [2020-07-29 01:00:33,797 INFO L280 TraceCheckUtils]: 3: Hoare triple {496#true} assume true; {496#true} is VALID [2020-07-29 01:00:33,799 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {496#true} {501#(= (select |#valid| |main_~#b~0.base|) 1)} #78#return; {501#(= (select |#valid| |main_~#b~0.base|) 1)} is VALID [2020-07-29 01:00:33,801 INFO L263 TraceCheckUtils]: 0: Hoare triple {496#true} call ULTIMATE.init(); {507#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:00:33,801 INFO L280 TraceCheckUtils]: 1: Hoare triple {507#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {496#true} is VALID [2020-07-29 01:00:33,802 INFO L280 TraceCheckUtils]: 2: Hoare triple {496#true} assume true; {496#true} is VALID [2020-07-29 01:00:33,802 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {496#true} {496#true} #74#return; {496#true} is VALID [2020-07-29 01:00:33,803 INFO L263 TraceCheckUtils]: 4: Hoare triple {496#true} call #t~ret6 := main(); {496#true} is VALID [2020-07-29 01:00:33,805 INFO L280 TraceCheckUtils]: 5: Hoare triple {496#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(128);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {501#(= (select |#valid| |main_~#b~0.base|) 1)} is VALID [2020-07-29 01:00:33,806 INFO L280 TraceCheckUtils]: 6: Hoare triple {501#(= (select |#valid| |main_~#b~0.base|) 1)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {501#(= (select |#valid| |main_~#b~0.base|) 1)} is VALID [2020-07-29 01:00:33,806 INFO L263 TraceCheckUtils]: 7: Hoare triple {501#(= (select |#valid| |main_~#b~0.base|) 1)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {496#true} is VALID [2020-07-29 01:00:33,807 INFO L280 TraceCheckUtils]: 8: Hoare triple {496#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {496#true} is VALID [2020-07-29 01:00:33,807 INFO L280 TraceCheckUtils]: 9: Hoare triple {496#true} assume !(~i~0 < ~size); {496#true} is VALID [2020-07-29 01:00:33,808 INFO L280 TraceCheckUtils]: 10: Hoare triple {496#true} #res := ~i~0; {496#true} is VALID [2020-07-29 01:00:33,808 INFO L280 TraceCheckUtils]: 11: Hoare triple {496#true} assume true; {496#true} is VALID [2020-07-29 01:00:33,810 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {496#true} {501#(= (select |#valid| |main_~#b~0.base|) 1)} #78#return; {501#(= (select |#valid| |main_~#b~0.base|) 1)} is VALID [2020-07-29 01:00:33,812 INFO L280 TraceCheckUtils]: 13: Hoare triple {501#(= (select |#valid| |main_~#b~0.base|) 1)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {501#(= (select |#valid| |main_~#b~0.base|) 1)} is VALID [2020-07-29 01:00:33,813 INFO L280 TraceCheckUtils]: 14: Hoare triple {501#(= (select |#valid| |main_~#b~0.base|) 1)} assume !(1 == #valid[~#b~0.base]); {497#false} is VALID [2020-07-29 01:00:33,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:00:33,815 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654024580] [2020-07-29 01:00:33,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:00:33,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:00:33,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333624247] [2020-07-29 01:00:33,816 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-07-29 01:00:33,816 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:00:33,817 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:00:33,838 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:33,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:00:33,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:00:33,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:00:33,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:00:33,840 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 4 states. [2020-07-29 01:00:34,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:34,032 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2020-07-29 01:00:34,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:00:34,032 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-07-29 01:00:34,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:00:34,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:00:34,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2020-07-29 01:00:34,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:00:34,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2020-07-29 01:00:34,037 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 40 transitions. [2020-07-29 01:00:34,107 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:34,108 INFO L225 Difference]: With dead ends: 43 [2020-07-29 01:00:34,109 INFO L226 Difference]: Without dead ends: 43 [2020-07-29 01:00:34,112 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:00:34,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-29 01:00:34,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-07-29 01:00:34,120 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:00:34,120 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 43 states. [2020-07-29 01:00:34,121 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2020-07-29 01:00:34,121 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2020-07-29 01:00:34,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:34,125 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2020-07-29 01:00:34,125 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2020-07-29 01:00:34,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:34,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:34,132 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2020-07-29 01:00:34,132 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2020-07-29 01:00:34,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:34,137 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2020-07-29 01:00:34,137 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2020-07-29 01:00:34,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:34,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:34,138 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:00:34,138 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:00:34,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-29 01:00:34,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2020-07-29 01:00:34,143 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 15 [2020-07-29 01:00:34,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:00:34,143 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2020-07-29 01:00:34,143 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:00:34,146 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2020-07-29 01:00:34,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-29 01:00:34,147 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:00:34,147 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:00:34,147 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-29 01:00:34,148 INFO L427 AbstractCegarLoop]: === Iteration 4 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:00:34,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:00:34,148 INFO L82 PathProgramCache]: Analyzing trace with hash 143250927, now seen corresponding path program 1 times [2020-07-29 01:00:34,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:00:34,151 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331998625] [2020-07-29 01:00:34,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:00:34,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:34,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:00:34,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:34,276 INFO L280 TraceCheckUtils]: 0: Hoare triple {693#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {682#true} is VALID [2020-07-29 01:00:34,277 INFO L280 TraceCheckUtils]: 1: Hoare triple {682#true} assume true; {682#true} is VALID [2020-07-29 01:00:34,277 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {682#true} {682#true} #74#return; {682#true} is VALID [2020-07-29 01:00:34,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-07-29 01:00:34,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:34,288 INFO L280 TraceCheckUtils]: 0: Hoare triple {682#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {682#true} is VALID [2020-07-29 01:00:34,288 INFO L280 TraceCheckUtils]: 1: Hoare triple {682#true} assume !(~i~0 < ~size); {682#true} is VALID [2020-07-29 01:00:34,289 INFO L280 TraceCheckUtils]: 2: Hoare triple {682#true} #res := ~i~0; {682#true} is VALID [2020-07-29 01:00:34,289 INFO L280 TraceCheckUtils]: 3: Hoare triple {682#true} assume true; {682#true} is VALID [2020-07-29 01:00:34,291 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {682#true} {687#(and (= 0 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} #78#return; {687#(and (= 0 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} is VALID [2020-07-29 01:00:34,292 INFO L263 TraceCheckUtils]: 0: Hoare triple {682#true} call ULTIMATE.init(); {693#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:00:34,293 INFO L280 TraceCheckUtils]: 1: Hoare triple {693#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {682#true} is VALID [2020-07-29 01:00:34,293 INFO L280 TraceCheckUtils]: 2: Hoare triple {682#true} assume true; {682#true} is VALID [2020-07-29 01:00:34,293 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {682#true} {682#true} #74#return; {682#true} is VALID [2020-07-29 01:00:34,294 INFO L263 TraceCheckUtils]: 4: Hoare triple {682#true} call #t~ret6 := main(); {682#true} is VALID [2020-07-29 01:00:34,295 INFO L280 TraceCheckUtils]: 5: Hoare triple {682#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(128);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {687#(and (= 0 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} is VALID [2020-07-29 01:00:34,297 INFO L280 TraceCheckUtils]: 6: Hoare triple {687#(and (= 0 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {687#(and (= 0 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} is VALID [2020-07-29 01:00:34,297 INFO L263 TraceCheckUtils]: 7: Hoare triple {687#(and (= 0 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {682#true} is VALID [2020-07-29 01:00:34,298 INFO L280 TraceCheckUtils]: 8: Hoare triple {682#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {682#true} is VALID [2020-07-29 01:00:34,298 INFO L280 TraceCheckUtils]: 9: Hoare triple {682#true} assume !(~i~0 < ~size); {682#true} is VALID [2020-07-29 01:00:34,298 INFO L280 TraceCheckUtils]: 10: Hoare triple {682#true} #res := ~i~0; {682#true} is VALID [2020-07-29 01:00:34,298 INFO L280 TraceCheckUtils]: 11: Hoare triple {682#true} assume true; {682#true} is VALID [2020-07-29 01:00:34,300 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {682#true} {687#(and (= 0 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} #78#return; {687#(and (= 0 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} is VALID [2020-07-29 01:00:34,302 INFO L280 TraceCheckUtils]: 13: Hoare triple {687#(and (= 0 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {687#(and (= 0 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} is VALID [2020-07-29 01:00:34,303 INFO L280 TraceCheckUtils]: 14: Hoare triple {687#(and (= 0 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} assume !(4 + (~#b~0.offset + 4 * ~i~1) <= #length[~#b~0.base] && 0 <= ~#b~0.offset + 4 * ~i~1); {683#false} is VALID [2020-07-29 01:00:34,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:00:34,304 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331998625] [2020-07-29 01:00:34,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:00:34,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:00:34,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540744532] [2020-07-29 01:00:34,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-07-29 01:00:34,306 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:00:34,306 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:00:34,329 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:34,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:00:34,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:00:34,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:00:34,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:00:34,330 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 4 states. [2020-07-29 01:00:34,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:34,545 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2020-07-29 01:00:34,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:00:34,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-07-29 01:00:34,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:00:34,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:00:34,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2020-07-29 01:00:34,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:00:34,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2020-07-29 01:00:34,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 46 transitions. [2020-07-29 01:00:34,639 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:34,641 INFO L225 Difference]: With dead ends: 47 [2020-07-29 01:00:34,641 INFO L226 Difference]: Without dead ends: 47 [2020-07-29 01:00:34,641 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:00:34,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-29 01:00:34,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2020-07-29 01:00:34,645 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:00:34,646 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 45 states. [2020-07-29 01:00:34,646 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 45 states. [2020-07-29 01:00:34,646 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 45 states. [2020-07-29 01:00:34,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:34,648 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2020-07-29 01:00:34,648 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2020-07-29 01:00:34,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:34,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:34,649 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 47 states. [2020-07-29 01:00:34,650 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 47 states. [2020-07-29 01:00:34,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:34,652 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2020-07-29 01:00:34,652 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2020-07-29 01:00:34,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:34,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:34,653 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:00:34,653 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:00:34,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-29 01:00:34,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2020-07-29 01:00:34,655 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 15 [2020-07-29 01:00:34,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:00:34,656 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2020-07-29 01:00:34,656 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:00:34,656 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2020-07-29 01:00:34,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-29 01:00:34,657 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:00:34,657 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:00:34,657 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-29 01:00:34,657 INFO L427 AbstractCegarLoop]: === Iteration 5 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:00:34,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:00:34,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1902162976, now seen corresponding path program 1 times [2020-07-29 01:00:34,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:00:34,658 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029822583] [2020-07-29 01:00:34,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:00:34,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:34,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:00:34,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:34,727 INFO L280 TraceCheckUtils]: 0: Hoare triple {894#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {882#true} is VALID [2020-07-29 01:00:34,727 INFO L280 TraceCheckUtils]: 1: Hoare triple {882#true} assume true; {882#true} is VALID [2020-07-29 01:00:34,728 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {882#true} {882#true} #74#return; {882#true} is VALID [2020-07-29 01:00:34,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-07-29 01:00:34,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:34,743 INFO L280 TraceCheckUtils]: 0: Hoare triple {882#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {882#true} is VALID [2020-07-29 01:00:34,743 INFO L280 TraceCheckUtils]: 1: Hoare triple {882#true} assume !(~i~0 < ~size); {882#true} is VALID [2020-07-29 01:00:34,744 INFO L280 TraceCheckUtils]: 2: Hoare triple {882#true} #res := ~i~0; {882#true} is VALID [2020-07-29 01:00:34,744 INFO L280 TraceCheckUtils]: 3: Hoare triple {882#true} assume true; {882#true} is VALID [2020-07-29 01:00:34,745 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {882#true} {887#(= 0 main_~i~1)} #78#return; {887#(= 0 main_~i~1)} is VALID [2020-07-29 01:00:34,746 INFO L263 TraceCheckUtils]: 0: Hoare triple {882#true} call ULTIMATE.init(); {894#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:00:34,746 INFO L280 TraceCheckUtils]: 1: Hoare triple {894#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {882#true} is VALID [2020-07-29 01:00:34,746 INFO L280 TraceCheckUtils]: 2: Hoare triple {882#true} assume true; {882#true} is VALID [2020-07-29 01:00:34,746 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {882#true} {882#true} #74#return; {882#true} is VALID [2020-07-29 01:00:34,747 INFO L263 TraceCheckUtils]: 4: Hoare triple {882#true} call #t~ret6 := main(); {882#true} is VALID [2020-07-29 01:00:34,748 INFO L280 TraceCheckUtils]: 5: Hoare triple {882#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(128);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {887#(= 0 main_~i~1)} is VALID [2020-07-29 01:00:34,748 INFO L280 TraceCheckUtils]: 6: Hoare triple {887#(= 0 main_~i~1)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {887#(= 0 main_~i~1)} is VALID [2020-07-29 01:00:34,748 INFO L263 TraceCheckUtils]: 7: Hoare triple {887#(= 0 main_~i~1)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {882#true} is VALID [2020-07-29 01:00:34,749 INFO L280 TraceCheckUtils]: 8: Hoare triple {882#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {882#true} is VALID [2020-07-29 01:00:34,749 INFO L280 TraceCheckUtils]: 9: Hoare triple {882#true} assume !(~i~0 < ~size); {882#true} is VALID [2020-07-29 01:00:34,749 INFO L280 TraceCheckUtils]: 10: Hoare triple {882#true} #res := ~i~0; {882#true} is VALID [2020-07-29 01:00:34,749 INFO L280 TraceCheckUtils]: 11: Hoare triple {882#true} assume true; {882#true} is VALID [2020-07-29 01:00:34,751 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {882#true} {887#(= 0 main_~i~1)} #78#return; {887#(= 0 main_~i~1)} is VALID [2020-07-29 01:00:34,752 INFO L280 TraceCheckUtils]: 13: Hoare triple {887#(= 0 main_~i~1)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {887#(= 0 main_~i~1)} is VALID [2020-07-29 01:00:34,752 INFO L280 TraceCheckUtils]: 14: Hoare triple {887#(= 0 main_~i~1)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {887#(= 0 main_~i~1)} is VALID [2020-07-29 01:00:34,753 INFO L280 TraceCheckUtils]: 15: Hoare triple {887#(= 0 main_~i~1)} havoc #t~ret3; {887#(= 0 main_~i~1)} is VALID [2020-07-29 01:00:34,754 INFO L280 TraceCheckUtils]: 16: Hoare triple {887#(= 0 main_~i~1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {893#(<= main_~i~1 1)} is VALID [2020-07-29 01:00:34,754 INFO L280 TraceCheckUtils]: 17: Hoare triple {893#(<= main_~i~1 1)} assume !(~i~1 < 32); {883#false} is VALID [2020-07-29 01:00:34,755 INFO L280 TraceCheckUtils]: 18: Hoare triple {883#false} ~i~1 := 0; {883#false} is VALID [2020-07-29 01:00:34,755 INFO L280 TraceCheckUtils]: 19: Hoare triple {883#false} assume !!(~i~1 < 32); {883#false} is VALID [2020-07-29 01:00:34,755 INFO L280 TraceCheckUtils]: 20: Hoare triple {883#false} assume !(4 + (~#b~0.offset + 4 * ~i~1) <= #length[~#b~0.base] && 0 <= ~#b~0.offset + 4 * ~i~1); {883#false} is VALID [2020-07-29 01:00:34,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:00:34,756 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029822583] [2020-07-29 01:00:34,756 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053866044] [2020-07-29 01:00:34,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:00:34,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:34,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-29 01:00:34,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:34,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:00:34,966 INFO L263 TraceCheckUtils]: 0: Hoare triple {882#true} call ULTIMATE.init(); {882#true} is VALID [2020-07-29 01:00:34,966 INFO L280 TraceCheckUtils]: 1: Hoare triple {882#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {882#true} is VALID [2020-07-29 01:00:34,967 INFO L280 TraceCheckUtils]: 2: Hoare triple {882#true} assume true; {882#true} is VALID [2020-07-29 01:00:34,967 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {882#true} {882#true} #74#return; {882#true} is VALID [2020-07-29 01:00:34,967 INFO L263 TraceCheckUtils]: 4: Hoare triple {882#true} call #t~ret6 := main(); {882#true} is VALID [2020-07-29 01:00:34,969 INFO L280 TraceCheckUtils]: 5: Hoare triple {882#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(128);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {913#(<= main_~i~1 0)} is VALID [2020-07-29 01:00:34,972 INFO L280 TraceCheckUtils]: 6: Hoare triple {913#(<= main_~i~1 0)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {913#(<= main_~i~1 0)} is VALID [2020-07-29 01:00:34,973 INFO L263 TraceCheckUtils]: 7: Hoare triple {913#(<= main_~i~1 0)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {882#true} is VALID [2020-07-29 01:00:34,973 INFO L280 TraceCheckUtils]: 8: Hoare triple {882#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {882#true} is VALID [2020-07-29 01:00:34,973 INFO L280 TraceCheckUtils]: 9: Hoare triple {882#true} assume !(~i~0 < ~size); {882#true} is VALID [2020-07-29 01:00:34,973 INFO L280 TraceCheckUtils]: 10: Hoare triple {882#true} #res := ~i~0; {882#true} is VALID [2020-07-29 01:00:34,974 INFO L280 TraceCheckUtils]: 11: Hoare triple {882#true} assume true; {882#true} is VALID [2020-07-29 01:00:34,982 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {882#true} {913#(<= main_~i~1 0)} #78#return; {913#(<= main_~i~1 0)} is VALID [2020-07-29 01:00:34,983 INFO L280 TraceCheckUtils]: 13: Hoare triple {913#(<= main_~i~1 0)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {913#(<= main_~i~1 0)} is VALID [2020-07-29 01:00:34,984 INFO L280 TraceCheckUtils]: 14: Hoare triple {913#(<= main_~i~1 0)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {913#(<= main_~i~1 0)} is VALID [2020-07-29 01:00:34,985 INFO L280 TraceCheckUtils]: 15: Hoare triple {913#(<= main_~i~1 0)} havoc #t~ret3; {913#(<= main_~i~1 0)} is VALID [2020-07-29 01:00:34,985 INFO L280 TraceCheckUtils]: 16: Hoare triple {913#(<= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {893#(<= main_~i~1 1)} is VALID [2020-07-29 01:00:34,987 INFO L280 TraceCheckUtils]: 17: Hoare triple {893#(<= main_~i~1 1)} assume !(~i~1 < 32); {883#false} is VALID [2020-07-29 01:00:34,987 INFO L280 TraceCheckUtils]: 18: Hoare triple {883#false} ~i~1 := 0; {883#false} is VALID [2020-07-29 01:00:34,988 INFO L280 TraceCheckUtils]: 19: Hoare triple {883#false} assume !!(~i~1 < 32); {883#false} is VALID [2020-07-29 01:00:34,988 INFO L280 TraceCheckUtils]: 20: Hoare triple {883#false} assume !(4 + (~#b~0.offset + 4 * ~i~1) <= #length[~#b~0.base] && 0 <= ~#b~0.offset + 4 * ~i~1); {883#false} is VALID [2020-07-29 01:00:34,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:00:34,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:00:34,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2020-07-29 01:00:34,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936489976] [2020-07-29 01:00:34,993 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-07-29 01:00:34,994 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:00:34,994 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:00:35,049 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:35,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-29 01:00:35,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:00:35,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:00:35,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:00:35,050 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 6 states. [2020-07-29 01:00:35,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:35,345 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2020-07-29 01:00:35,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:00:35,345 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-07-29 01:00:35,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:00:35,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:00:35,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2020-07-29 01:00:35,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:00:35,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2020-07-29 01:00:35,357 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 71 transitions. [2020-07-29 01:00:35,434 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:35,436 INFO L225 Difference]: With dead ends: 69 [2020-07-29 01:00:35,437 INFO L226 Difference]: Without dead ends: 69 [2020-07-29 01:00:35,438 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:00:35,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-07-29 01:00:35,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 52. [2020-07-29 01:00:35,451 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:00:35,452 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 52 states. [2020-07-29 01:00:35,452 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 52 states. [2020-07-29 01:00:35,452 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 52 states. [2020-07-29 01:00:35,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:35,457 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2020-07-29 01:00:35,457 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2020-07-29 01:00:35,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:35,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:35,458 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 69 states. [2020-07-29 01:00:35,458 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 69 states. [2020-07-29 01:00:35,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:35,465 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2020-07-29 01:00:35,465 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2020-07-29 01:00:35,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:35,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:35,466 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:00:35,467 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:00:35,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-29 01:00:35,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2020-07-29 01:00:35,469 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 21 [2020-07-29 01:00:35,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:00:35,470 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2020-07-29 01:00:35,470 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-29 01:00:35,470 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2020-07-29 01:00:35,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-29 01:00:35,471 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:00:35,472 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:00:35,685 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:00:35,686 INFO L427 AbstractCegarLoop]: === Iteration 6 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:00:35,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:00:35,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1165178250, now seen corresponding path program 1 times [2020-07-29 01:00:35,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:00:35,688 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731546019] [2020-07-29 01:00:35,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:00:35,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:35,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:00:35,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:35,748 INFO L280 TraceCheckUtils]: 0: Hoare triple {1228#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1217#true} is VALID [2020-07-29 01:00:35,748 INFO L280 TraceCheckUtils]: 1: Hoare triple {1217#true} assume true; {1217#true} is VALID [2020-07-29 01:00:35,748 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1217#true} {1217#true} #74#return; {1217#true} is VALID [2020-07-29 01:00:35,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-07-29 01:00:35,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:35,754 INFO L280 TraceCheckUtils]: 0: Hoare triple {1217#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {1217#true} is VALID [2020-07-29 01:00:35,754 INFO L280 TraceCheckUtils]: 1: Hoare triple {1217#true} assume !(~i~0 < ~size); {1217#true} is VALID [2020-07-29 01:00:35,754 INFO L280 TraceCheckUtils]: 2: Hoare triple {1217#true} #res := ~i~0; {1217#true} is VALID [2020-07-29 01:00:35,755 INFO L280 TraceCheckUtils]: 3: Hoare triple {1217#true} assume true; {1217#true} is VALID [2020-07-29 01:00:35,755 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1217#true} {1217#true} #78#return; {1217#true} is VALID [2020-07-29 01:00:35,756 INFO L263 TraceCheckUtils]: 0: Hoare triple {1217#true} call ULTIMATE.init(); {1228#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:00:35,756 INFO L280 TraceCheckUtils]: 1: Hoare triple {1228#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1217#true} is VALID [2020-07-29 01:00:35,757 INFO L280 TraceCheckUtils]: 2: Hoare triple {1217#true} assume true; {1217#true} is VALID [2020-07-29 01:00:35,757 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1217#true} {1217#true} #74#return; {1217#true} is VALID [2020-07-29 01:00:35,757 INFO L263 TraceCheckUtils]: 4: Hoare triple {1217#true} call #t~ret6 := main(); {1217#true} is VALID [2020-07-29 01:00:35,757 INFO L280 TraceCheckUtils]: 5: Hoare triple {1217#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(128);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {1217#true} is VALID [2020-07-29 01:00:35,757 INFO L280 TraceCheckUtils]: 6: Hoare triple {1217#true} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {1217#true} is VALID [2020-07-29 01:00:35,758 INFO L263 TraceCheckUtils]: 7: Hoare triple {1217#true} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {1217#true} is VALID [2020-07-29 01:00:35,758 INFO L280 TraceCheckUtils]: 8: Hoare triple {1217#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {1217#true} is VALID [2020-07-29 01:00:35,758 INFO L280 TraceCheckUtils]: 9: Hoare triple {1217#true} assume !(~i~0 < ~size); {1217#true} is VALID [2020-07-29 01:00:35,759 INFO L280 TraceCheckUtils]: 10: Hoare triple {1217#true} #res := ~i~0; {1217#true} is VALID [2020-07-29 01:00:35,759 INFO L280 TraceCheckUtils]: 11: Hoare triple {1217#true} assume true; {1217#true} is VALID [2020-07-29 01:00:35,759 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1217#true} {1217#true} #78#return; {1217#true} is VALID [2020-07-29 01:00:35,759 INFO L280 TraceCheckUtils]: 13: Hoare triple {1217#true} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {1217#true} is VALID [2020-07-29 01:00:35,760 INFO L280 TraceCheckUtils]: 14: Hoare triple {1217#true} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {1217#true} is VALID [2020-07-29 01:00:35,760 INFO L280 TraceCheckUtils]: 15: Hoare triple {1217#true} havoc #t~ret3; {1217#true} is VALID [2020-07-29 01:00:35,760 INFO L280 TraceCheckUtils]: 16: Hoare triple {1217#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1217#true} is VALID [2020-07-29 01:00:35,760 INFO L280 TraceCheckUtils]: 17: Hoare triple {1217#true} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {1217#true} is VALID [2020-07-29 01:00:35,761 INFO L263 TraceCheckUtils]: 18: Hoare triple {1217#true} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {1217#true} is VALID [2020-07-29 01:00:35,762 INFO L280 TraceCheckUtils]: 19: Hoare triple {1217#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {1227#(= 0 foo_~i~0)} is VALID [2020-07-29 01:00:35,762 INFO L280 TraceCheckUtils]: 20: Hoare triple {1227#(= 0 foo_~i~0)} assume !!(~i~0 < ~size); {1227#(= 0 foo_~i~0)} is VALID [2020-07-29 01:00:35,763 INFO L280 TraceCheckUtils]: 21: Hoare triple {1227#(= 0 foo_~i~0)} assume !(0 <= ~i~0 && ~i~0 < 32); {1218#false} is VALID [2020-07-29 01:00:35,763 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-29 01:00:35,764 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731546019] [2020-07-29 01:00:35,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:00:35,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:00:35,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994770670] [2020-07-29 01:00:35,765 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-07-29 01:00:35,766 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:00:35,766 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:00:35,784 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:35,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:00:35,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:00:35,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:00:35,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:00:35,785 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 4 states. [2020-07-29 01:00:35,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:35,951 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2020-07-29 01:00:35,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:00:35,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-07-29 01:00:35,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:00:35,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:00:35,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2020-07-29 01:00:35,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:00:35,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2020-07-29 01:00:35,956 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 50 transitions. [2020-07-29 01:00:36,024 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:36,027 INFO L225 Difference]: With dead ends: 62 [2020-07-29 01:00:36,027 INFO L226 Difference]: Without dead ends: 62 [2020-07-29 01:00:36,027 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:00:36,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-07-29 01:00:36,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2020-07-29 01:00:36,037 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:00:36,037 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 54 states. [2020-07-29 01:00:36,037 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 54 states. [2020-07-29 01:00:36,038 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 54 states. [2020-07-29 01:00:36,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:36,041 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2020-07-29 01:00:36,041 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2020-07-29 01:00:36,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:36,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:36,042 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 62 states. [2020-07-29 01:00:36,042 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 62 states. [2020-07-29 01:00:36,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:36,046 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2020-07-29 01:00:36,046 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2020-07-29 01:00:36,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:36,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:36,047 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:00:36,047 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:00:36,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-29 01:00:36,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2020-07-29 01:00:36,050 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 22 [2020-07-29 01:00:36,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:00:36,052 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2020-07-29 01:00:36,052 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:00:36,053 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2020-07-29 01:00:36,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-29 01:00:36,053 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:00:36,053 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:00:36,054 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-29 01:00:36,054 INFO L427 AbstractCegarLoop]: === Iteration 7 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:00:36,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:00:36,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1760787427, now seen corresponding path program 1 times [2020-07-29 01:00:36,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:00:36,055 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563262976] [2020-07-29 01:00:36,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:00:36,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:36,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:00:36,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:36,188 INFO L280 TraceCheckUtils]: 0: Hoare triple {1488#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1474#true} is VALID [2020-07-29 01:00:36,188 INFO L280 TraceCheckUtils]: 1: Hoare triple {1474#true} assume true; {1474#true} is VALID [2020-07-29 01:00:36,188 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1474#true} {1474#true} #74#return; {1474#true} is VALID [2020-07-29 01:00:36,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-07-29 01:00:36,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:36,195 INFO L280 TraceCheckUtils]: 0: Hoare triple {1474#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {1474#true} is VALID [2020-07-29 01:00:36,195 INFO L280 TraceCheckUtils]: 1: Hoare triple {1474#true} assume !(~i~0 < ~size); {1474#true} is VALID [2020-07-29 01:00:36,196 INFO L280 TraceCheckUtils]: 2: Hoare triple {1474#true} #res := ~i~0; {1474#true} is VALID [2020-07-29 01:00:36,196 INFO L280 TraceCheckUtils]: 3: Hoare triple {1474#true} assume true; {1474#true} is VALID [2020-07-29 01:00:36,197 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1474#true} {1479#(= 1 (select |#valid| |main_~#mask~0.base|))} #78#return; {1479#(= 1 (select |#valid| |main_~#mask~0.base|))} is VALID [2020-07-29 01:00:36,198 INFO L263 TraceCheckUtils]: 0: Hoare triple {1474#true} call ULTIMATE.init(); {1488#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:00:36,199 INFO L280 TraceCheckUtils]: 1: Hoare triple {1488#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1474#true} is VALID [2020-07-29 01:00:36,199 INFO L280 TraceCheckUtils]: 2: Hoare triple {1474#true} assume true; {1474#true} is VALID [2020-07-29 01:00:36,199 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1474#true} {1474#true} #74#return; {1474#true} is VALID [2020-07-29 01:00:36,199 INFO L263 TraceCheckUtils]: 4: Hoare triple {1474#true} call #t~ret6 := main(); {1474#true} is VALID [2020-07-29 01:00:36,201 INFO L280 TraceCheckUtils]: 5: Hoare triple {1474#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(128);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {1479#(= 1 (select |#valid| |main_~#mask~0.base|))} is VALID [2020-07-29 01:00:36,201 INFO L280 TraceCheckUtils]: 6: Hoare triple {1479#(= 1 (select |#valid| |main_~#mask~0.base|))} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {1479#(= 1 (select |#valid| |main_~#mask~0.base|))} is VALID [2020-07-29 01:00:36,202 INFO L263 TraceCheckUtils]: 7: Hoare triple {1479#(= 1 (select |#valid| |main_~#mask~0.base|))} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {1474#true} is VALID [2020-07-29 01:00:36,202 INFO L280 TraceCheckUtils]: 8: Hoare triple {1474#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {1474#true} is VALID [2020-07-29 01:00:36,202 INFO L280 TraceCheckUtils]: 9: Hoare triple {1474#true} assume !(~i~0 < ~size); {1474#true} is VALID [2020-07-29 01:00:36,202 INFO L280 TraceCheckUtils]: 10: Hoare triple {1474#true} #res := ~i~0; {1474#true} is VALID [2020-07-29 01:00:36,202 INFO L280 TraceCheckUtils]: 11: Hoare triple {1474#true} assume true; {1474#true} is VALID [2020-07-29 01:00:36,204 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1474#true} {1479#(= 1 (select |#valid| |main_~#mask~0.base|))} #78#return; {1479#(= 1 (select |#valid| |main_~#mask~0.base|))} is VALID [2020-07-29 01:00:36,204 INFO L280 TraceCheckUtils]: 13: Hoare triple {1479#(= 1 (select |#valid| |main_~#mask~0.base|))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {1479#(= 1 (select |#valid| |main_~#mask~0.base|))} is VALID [2020-07-29 01:00:36,205 INFO L280 TraceCheckUtils]: 14: Hoare triple {1479#(= 1 (select |#valid| |main_~#mask~0.base|))} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {1479#(= 1 (select |#valid| |main_~#mask~0.base|))} is VALID [2020-07-29 01:00:36,206 INFO L280 TraceCheckUtils]: 15: Hoare triple {1479#(= 1 (select |#valid| |main_~#mask~0.base|))} havoc #t~ret3; {1479#(= 1 (select |#valid| |main_~#mask~0.base|))} is VALID [2020-07-29 01:00:36,206 INFO L280 TraceCheckUtils]: 16: Hoare triple {1479#(= 1 (select |#valid| |main_~#mask~0.base|))} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1479#(= 1 (select |#valid| |main_~#mask~0.base|))} is VALID [2020-07-29 01:00:36,207 INFO L280 TraceCheckUtils]: 17: Hoare triple {1479#(= 1 (select |#valid| |main_~#mask~0.base|))} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {1485#(= 1 (select |#valid| main_~c~0.base))} is VALID [2020-07-29 01:00:36,208 INFO L263 TraceCheckUtils]: 18: Hoare triple {1485#(= 1 (select |#valid| main_~c~0.base))} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {1486#(= 1 (select |#valid| |foo_#in~b.base|))} is VALID [2020-07-29 01:00:36,209 INFO L280 TraceCheckUtils]: 19: Hoare triple {1486#(= 1 (select |#valid| |foo_#in~b.base|))} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {1487#(= 1 (select |#valid| foo_~b.base))} is VALID [2020-07-29 01:00:36,210 INFO L280 TraceCheckUtils]: 20: Hoare triple {1487#(= 1 (select |#valid| foo_~b.base))} assume !!(~i~0 < ~size); {1487#(= 1 (select |#valid| foo_~b.base))} is VALID [2020-07-29 01:00:36,210 INFO L280 TraceCheckUtils]: 21: Hoare triple {1487#(= 1 (select |#valid| foo_~b.base))} assume 0 <= ~i~0 && ~i~0 < 32; {1487#(= 1 (select |#valid| foo_~b.base))} is VALID [2020-07-29 01:00:36,211 INFO L280 TraceCheckUtils]: 22: Hoare triple {1487#(= 1 (select |#valid| foo_~b.base))} assume !(1 == #valid[~b.base]); {1475#false} is VALID [2020-07-29 01:00:36,212 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 01:00:36,212 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563262976] [2020-07-29 01:00:36,213 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858702651] [2020-07-29 01:00:36,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:00:36,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:36,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:00:36,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:36,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:00:36,321 INFO L350 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2020-07-29 01:00:36,322 INFO L384 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 11 [2020-07-29 01:00:36,322 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:00:36,327 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:00:36,329 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-29 01:00:36,329 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2020-07-29 01:00:36,332 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:00:36,332 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_24|, |main_~#b~0.base|]. (= |#valid| (store (store |v_#valid_24| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)) [2020-07-29 01:00:36,332 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [|main_~#b~0.base|]. (and (= 1 (select |#valid| |main_~#mask~0.base|)) (= (select |#valid| |main_~#b~0.base|) 1)) [2020-07-29 01:00:36,438 INFO L263 TraceCheckUtils]: 0: Hoare triple {1474#true} call ULTIMATE.init(); {1474#true} is VALID [2020-07-29 01:00:36,438 INFO L280 TraceCheckUtils]: 1: Hoare triple {1474#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1474#true} is VALID [2020-07-29 01:00:36,439 INFO L280 TraceCheckUtils]: 2: Hoare triple {1474#true} assume true; {1474#true} is VALID [2020-07-29 01:00:36,439 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1474#true} {1474#true} #74#return; {1474#true} is VALID [2020-07-29 01:00:36,439 INFO L263 TraceCheckUtils]: 4: Hoare triple {1474#true} call #t~ret6 := main(); {1474#true} is VALID [2020-07-29 01:00:36,440 INFO L280 TraceCheckUtils]: 5: Hoare triple {1474#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(128);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {1479#(= 1 (select |#valid| |main_~#mask~0.base|))} is VALID [2020-07-29 01:00:36,441 INFO L280 TraceCheckUtils]: 6: Hoare triple {1479#(= 1 (select |#valid| |main_~#mask~0.base|))} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {1479#(= 1 (select |#valid| |main_~#mask~0.base|))} is VALID [2020-07-29 01:00:36,443 INFO L263 TraceCheckUtils]: 7: Hoare triple {1479#(= 1 (select |#valid| |main_~#mask~0.base|))} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {1513#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)))} is VALID [2020-07-29 01:00:36,445 INFO L280 TraceCheckUtils]: 8: Hoare triple {1513#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)))} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {1513#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)))} is VALID [2020-07-29 01:00:36,446 INFO L280 TraceCheckUtils]: 9: Hoare triple {1513#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)))} assume !(~i~0 < ~size); {1513#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)))} is VALID [2020-07-29 01:00:36,451 INFO L280 TraceCheckUtils]: 10: Hoare triple {1513#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)))} #res := ~i~0; {1513#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)))} is VALID [2020-07-29 01:00:36,453 INFO L280 TraceCheckUtils]: 11: Hoare triple {1513#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)))} assume true; {1513#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)))} is VALID [2020-07-29 01:00:36,454 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1513#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)))} {1479#(= 1 (select |#valid| |main_~#mask~0.base|))} #78#return; {1479#(= 1 (select |#valid| |main_~#mask~0.base|))} is VALID [2020-07-29 01:00:36,455 INFO L280 TraceCheckUtils]: 13: Hoare triple {1479#(= 1 (select |#valid| |main_~#mask~0.base|))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {1479#(= 1 (select |#valid| |main_~#mask~0.base|))} is VALID [2020-07-29 01:00:36,456 INFO L280 TraceCheckUtils]: 14: Hoare triple {1479#(= 1 (select |#valid| |main_~#mask~0.base|))} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {1479#(= 1 (select |#valid| |main_~#mask~0.base|))} is VALID [2020-07-29 01:00:36,457 INFO L280 TraceCheckUtils]: 15: Hoare triple {1479#(= 1 (select |#valid| |main_~#mask~0.base|))} havoc #t~ret3; {1479#(= 1 (select |#valid| |main_~#mask~0.base|))} is VALID [2020-07-29 01:00:36,457 INFO L280 TraceCheckUtils]: 16: Hoare triple {1479#(= 1 (select |#valid| |main_~#mask~0.base|))} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1479#(= 1 (select |#valid| |main_~#mask~0.base|))} is VALID [2020-07-29 01:00:36,458 INFO L280 TraceCheckUtils]: 17: Hoare triple {1479#(= 1 (select |#valid| |main_~#mask~0.base|))} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {1485#(= 1 (select |#valid| main_~c~0.base))} is VALID [2020-07-29 01:00:36,460 INFO L263 TraceCheckUtils]: 18: Hoare triple {1485#(= 1 (select |#valid| main_~c~0.base))} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {1486#(= 1 (select |#valid| |foo_#in~b.base|))} is VALID [2020-07-29 01:00:36,461 INFO L280 TraceCheckUtils]: 19: Hoare triple {1486#(= 1 (select |#valid| |foo_#in~b.base|))} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {1487#(= 1 (select |#valid| foo_~b.base))} is VALID [2020-07-29 01:00:36,461 INFO L280 TraceCheckUtils]: 20: Hoare triple {1487#(= 1 (select |#valid| foo_~b.base))} assume !!(~i~0 < ~size); {1487#(= 1 (select |#valid| foo_~b.base))} is VALID [2020-07-29 01:00:36,462 INFO L280 TraceCheckUtils]: 21: Hoare triple {1487#(= 1 (select |#valid| foo_~b.base))} assume 0 <= ~i~0 && ~i~0 < 32; {1487#(= 1 (select |#valid| foo_~b.base))} is VALID [2020-07-29 01:00:36,463 INFO L280 TraceCheckUtils]: 22: Hoare triple {1487#(= 1 (select |#valid| foo_~b.base))} assume !(1 == #valid[~b.base]); {1475#false} is VALID [2020-07-29 01:00:36,465 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 01:00:36,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:00:36,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-07-29 01:00:36,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225042546] [2020-07-29 01:00:36,470 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2020-07-29 01:00:36,471 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:00:36,471 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-29 01:00:36,505 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:36,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-29 01:00:36,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:00:36,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-29 01:00:36,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-29 01:00:36,506 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 8 states. [2020-07-29 01:00:36,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:36,834 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2020-07-29 01:00:36,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 01:00:36,834 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2020-07-29 01:00:36,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:00:36,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:00:36,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2020-07-29 01:00:36,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:00:36,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2020-07-29 01:00:36,839 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 39 transitions. [2020-07-29 01:00:36,888 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:36,889 INFO L225 Difference]: With dead ends: 53 [2020-07-29 01:00:36,889 INFO L226 Difference]: Without dead ends: 53 [2020-07-29 01:00:36,890 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-07-29 01:00:36,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-07-29 01:00:36,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-07-29 01:00:36,895 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:00:36,895 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 53 states. [2020-07-29 01:00:36,895 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2020-07-29 01:00:36,896 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2020-07-29 01:00:36,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:36,898 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2020-07-29 01:00:36,898 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2020-07-29 01:00:36,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:36,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:36,899 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2020-07-29 01:00:36,899 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2020-07-29 01:00:36,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:36,902 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2020-07-29 01:00:36,902 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2020-07-29 01:00:36,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:36,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:36,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:00:36,903 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:00:36,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-07-29 01:00:36,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2020-07-29 01:00:36,906 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 23 [2020-07-29 01:00:36,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:00:36,906 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2020-07-29 01:00:36,906 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-29 01:00:36,907 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2020-07-29 01:00:36,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-29 01:00:36,907 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:00:36,908 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:00:37,121 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:00:37,122 INFO L427 AbstractCegarLoop]: === Iteration 8 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:00:37,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:00:37,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1760787428, now seen corresponding path program 1 times [2020-07-29 01:00:37,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:00:37,124 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930330074] [2020-07-29 01:00:37,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:00:37,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:37,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:00:37,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:37,251 INFO L280 TraceCheckUtils]: 0: Hoare triple {1791#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1777#true} is VALID [2020-07-29 01:00:37,252 INFO L280 TraceCheckUtils]: 1: Hoare triple {1777#true} assume true; {1777#true} is VALID [2020-07-29 01:00:37,252 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1777#true} {1777#true} #74#return; {1777#true} is VALID [2020-07-29 01:00:37,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-07-29 01:00:37,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:37,262 INFO L280 TraceCheckUtils]: 0: Hoare triple {1777#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {1777#true} is VALID [2020-07-29 01:00:37,263 INFO L280 TraceCheckUtils]: 1: Hoare triple {1777#true} assume !(~i~0 < ~size); {1777#true} is VALID [2020-07-29 01:00:37,263 INFO L280 TraceCheckUtils]: 2: Hoare triple {1777#true} #res := ~i~0; {1777#true} is VALID [2020-07-29 01:00:37,263 INFO L280 TraceCheckUtils]: 3: Hoare triple {1777#true} assume true; {1777#true} is VALID [2020-07-29 01:00:37,265 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1777#true} {1782#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} #78#return; {1782#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:37,266 INFO L263 TraceCheckUtils]: 0: Hoare triple {1777#true} call ULTIMATE.init(); {1791#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:00:37,267 INFO L280 TraceCheckUtils]: 1: Hoare triple {1791#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1777#true} is VALID [2020-07-29 01:00:37,267 INFO L280 TraceCheckUtils]: 2: Hoare triple {1777#true} assume true; {1777#true} is VALID [2020-07-29 01:00:37,267 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1777#true} {1777#true} #74#return; {1777#true} is VALID [2020-07-29 01:00:37,268 INFO L263 TraceCheckUtils]: 4: Hoare triple {1777#true} call #t~ret6 := main(); {1777#true} is VALID [2020-07-29 01:00:37,269 INFO L280 TraceCheckUtils]: 5: Hoare triple {1777#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(128);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {1782#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:37,270 INFO L280 TraceCheckUtils]: 6: Hoare triple {1782#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {1782#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:37,271 INFO L263 TraceCheckUtils]: 7: Hoare triple {1782#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {1777#true} is VALID [2020-07-29 01:00:37,271 INFO L280 TraceCheckUtils]: 8: Hoare triple {1777#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {1777#true} is VALID [2020-07-29 01:00:37,271 INFO L280 TraceCheckUtils]: 9: Hoare triple {1777#true} assume !(~i~0 < ~size); {1777#true} is VALID [2020-07-29 01:00:37,271 INFO L280 TraceCheckUtils]: 10: Hoare triple {1777#true} #res := ~i~0; {1777#true} is VALID [2020-07-29 01:00:37,272 INFO L280 TraceCheckUtils]: 11: Hoare triple {1777#true} assume true; {1777#true} is VALID [2020-07-29 01:00:37,273 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1777#true} {1782#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} #78#return; {1782#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:37,274 INFO L280 TraceCheckUtils]: 13: Hoare triple {1782#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {1782#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:37,275 INFO L280 TraceCheckUtils]: 14: Hoare triple {1782#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {1782#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:37,276 INFO L280 TraceCheckUtils]: 15: Hoare triple {1782#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} havoc #t~ret3; {1782#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:37,277 INFO L280 TraceCheckUtils]: 16: Hoare triple {1782#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1782#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:37,278 INFO L280 TraceCheckUtils]: 17: Hoare triple {1782#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {1788#(and (= 32 (select |#length| main_~c~0.base)) (= main_~c~0.offset 0))} is VALID [2020-07-29 01:00:37,279 INFO L263 TraceCheckUtils]: 18: Hoare triple {1788#(and (= 32 (select |#length| main_~c~0.base)) (= main_~c~0.offset 0))} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {1789#(and (= 32 (select |#length| |foo_#in~b.base|)) (= 0 |foo_#in~b.offset|))} is VALID [2020-07-29 01:00:37,280 INFO L280 TraceCheckUtils]: 19: Hoare triple {1789#(and (= 32 (select |#length| |foo_#in~b.base|)) (= 0 |foo_#in~b.offset|))} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {1790#(and (= 32 (select |#length| foo_~b.base)) (= 0 foo_~i~0) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:37,281 INFO L280 TraceCheckUtils]: 20: Hoare triple {1790#(and (= 32 (select |#length| foo_~b.base)) (= 0 foo_~i~0) (= foo_~b.offset 0))} assume !!(~i~0 < ~size); {1790#(and (= 32 (select |#length| foo_~b.base)) (= 0 foo_~i~0) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:37,282 INFO L280 TraceCheckUtils]: 21: Hoare triple {1790#(and (= 32 (select |#length| foo_~b.base)) (= 0 foo_~i~0) (= foo_~b.offset 0))} assume 0 <= ~i~0 && ~i~0 < 32; {1790#(and (= 32 (select |#length| foo_~b.base)) (= 0 foo_~i~0) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:37,283 INFO L280 TraceCheckUtils]: 22: Hoare triple {1790#(and (= 32 (select |#length| foo_~b.base)) (= 0 foo_~i~0) (= foo_~b.offset 0))} assume !(1 + (~b.offset + ~i~0) <= #length[~b.base] && 0 <= ~b.offset + ~i~0); {1778#false} is VALID [2020-07-29 01:00:37,285 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 01:00:37,285 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930330074] [2020-07-29 01:00:37,286 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14344378] [2020-07-29 01:00:37,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:00:37,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:37,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-29 01:00:37,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:37,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:00:37,384 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:00:37,385 INFO L384 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 1 case distinctions, treesize of input 9 treesize of output 25 [2020-07-29 01:00:37,386 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:00:37,411 INFO L624 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2020-07-29 01:00:37,414 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:00:37,414 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2020-07-29 01:00:37,416 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:00:37,416 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_12|, |main_~#b~0.base|]. (and (= (store (store |v_#length_12| |main_~#b~0.base| 128) |main_~#mask~0.base| 32) |#length|) (= 0 |main_~#mask~0.offset|)) [2020-07-29 01:00:37,417 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)) [2020-07-29 01:00:37,542 INFO L263 TraceCheckUtils]: 0: Hoare triple {1777#true} call ULTIMATE.init(); {1777#true} is VALID [2020-07-29 01:00:37,543 INFO L280 TraceCheckUtils]: 1: Hoare triple {1777#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1777#true} is VALID [2020-07-29 01:00:37,543 INFO L280 TraceCheckUtils]: 2: Hoare triple {1777#true} assume true; {1777#true} is VALID [2020-07-29 01:00:37,543 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1777#true} {1777#true} #74#return; {1777#true} is VALID [2020-07-29 01:00:37,544 INFO L263 TraceCheckUtils]: 4: Hoare triple {1777#true} call #t~ret6 := main(); {1777#true} is VALID [2020-07-29 01:00:37,545 INFO L280 TraceCheckUtils]: 5: Hoare triple {1777#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(128);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {1782#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:37,546 INFO L280 TraceCheckUtils]: 6: Hoare triple {1782#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {1782#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:37,547 INFO L263 TraceCheckUtils]: 7: Hoare triple {1782#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {1816#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_2| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_2|)))} is VALID [2020-07-29 01:00:37,548 INFO L280 TraceCheckUtils]: 8: Hoare triple {1816#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_2| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_2|)))} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {1816#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_2| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_2|)))} is VALID [2020-07-29 01:00:37,549 INFO L280 TraceCheckUtils]: 9: Hoare triple {1816#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_2| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_2|)))} assume !(~i~0 < ~size); {1816#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_2| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_2|)))} is VALID [2020-07-29 01:00:37,550 INFO L280 TraceCheckUtils]: 10: Hoare triple {1816#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_2| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_2|)))} #res := ~i~0; {1816#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_2| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_2|)))} is VALID [2020-07-29 01:00:37,551 INFO L280 TraceCheckUtils]: 11: Hoare triple {1816#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_2| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_2|)))} assume true; {1816#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_2| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_2|)))} is VALID [2020-07-29 01:00:37,553 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1816#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_2| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_2|)))} {1782#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} #78#return; {1782#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:37,559 INFO L280 TraceCheckUtils]: 13: Hoare triple {1782#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {1782#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:37,560 INFO L280 TraceCheckUtils]: 14: Hoare triple {1782#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {1782#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:37,563 INFO L280 TraceCheckUtils]: 15: Hoare triple {1782#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} havoc #t~ret3; {1782#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:37,564 INFO L280 TraceCheckUtils]: 16: Hoare triple {1782#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1782#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:37,566 INFO L280 TraceCheckUtils]: 17: Hoare triple {1782#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {1788#(and (= 32 (select |#length| main_~c~0.base)) (= main_~c~0.offset 0))} is VALID [2020-07-29 01:00:37,568 INFO L263 TraceCheckUtils]: 18: Hoare triple {1788#(and (= 32 (select |#length| main_~c~0.base)) (= main_~c~0.offset 0))} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {1789#(and (= 32 (select |#length| |foo_#in~b.base|)) (= 0 |foo_#in~b.offset|))} is VALID [2020-07-29 01:00:37,569 INFO L280 TraceCheckUtils]: 19: Hoare triple {1789#(and (= 32 (select |#length| |foo_#in~b.base|)) (= 0 |foo_#in~b.offset|))} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {1790#(and (= 32 (select |#length| foo_~b.base)) (= 0 foo_~i~0) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:37,570 INFO L280 TraceCheckUtils]: 20: Hoare triple {1790#(and (= 32 (select |#length| foo_~b.base)) (= 0 foo_~i~0) (= foo_~b.offset 0))} assume !!(~i~0 < ~size); {1790#(and (= 32 (select |#length| foo_~b.base)) (= 0 foo_~i~0) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:37,571 INFO L280 TraceCheckUtils]: 21: Hoare triple {1790#(and (= 32 (select |#length| foo_~b.base)) (= 0 foo_~i~0) (= foo_~b.offset 0))} assume 0 <= ~i~0 && ~i~0 < 32; {1790#(and (= 32 (select |#length| foo_~b.base)) (= 0 foo_~i~0) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:37,572 INFO L280 TraceCheckUtils]: 22: Hoare triple {1790#(and (= 32 (select |#length| foo_~b.base)) (= 0 foo_~i~0) (= foo_~b.offset 0))} assume !(1 + (~b.offset + ~i~0) <= #length[~b.base] && 0 <= ~b.offset + ~i~0); {1778#false} is VALID [2020-07-29 01:00:37,574 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 01:00:37,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:00:37,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-07-29 01:00:37,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814274437] [2020-07-29 01:00:37,576 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2020-07-29 01:00:37,577 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:00:37,577 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-29 01:00:37,637 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:37,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-29 01:00:37,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:00:37,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-29 01:00:37,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-29 01:00:37,639 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 8 states. [2020-07-29 01:00:38,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:38,161 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2020-07-29 01:00:38,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:00:38,161 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2020-07-29 01:00:38,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:00:38,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:00:38,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 48 transitions. [2020-07-29 01:00:38,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:00:38,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 48 transitions. [2020-07-29 01:00:38,166 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 48 transitions. [2020-07-29 01:00:38,239 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:38,241 INFO L225 Difference]: With dead ends: 59 [2020-07-29 01:00:38,241 INFO L226 Difference]: Without dead ends: 59 [2020-07-29 01:00:38,242 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-07-29 01:00:38,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-29 01:00:38,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 54. [2020-07-29 01:00:38,248 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:00:38,248 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 54 states. [2020-07-29 01:00:38,248 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 54 states. [2020-07-29 01:00:38,249 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 54 states. [2020-07-29 01:00:38,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:38,253 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2020-07-29 01:00:38,254 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2020-07-29 01:00:38,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:38,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:38,254 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 59 states. [2020-07-29 01:00:38,255 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 59 states. [2020-07-29 01:00:38,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:38,258 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2020-07-29 01:00:38,258 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2020-07-29 01:00:38,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:38,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:38,259 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:00:38,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:00:38,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-29 01:00:38,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2020-07-29 01:00:38,262 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 23 [2020-07-29 01:00:38,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:00:38,263 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2020-07-29 01:00:38,263 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-29 01:00:38,263 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2020-07-29 01:00:38,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-29 01:00:38,264 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:00:38,265 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:00:38,478 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:00:38,479 INFO L427 AbstractCegarLoop]: === Iteration 9 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:00:38,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:00:38,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1134972881, now seen corresponding path program 1 times [2020-07-29 01:00:38,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:00:38,481 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462597943] [2020-07-29 01:00:38,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:00:38,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:38,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:00:38,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:38,535 INFO L280 TraceCheckUtils]: 0: Hoare triple {2117#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2100#true} is VALID [2020-07-29 01:00:38,535 INFO L280 TraceCheckUtils]: 1: Hoare triple {2100#true} assume true; {2100#true} is VALID [2020-07-29 01:00:38,535 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2100#true} {2100#true} #74#return; {2100#true} is VALID [2020-07-29 01:00:38,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-07-29 01:00:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:38,548 INFO L280 TraceCheckUtils]: 0: Hoare triple {2100#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {2100#true} is VALID [2020-07-29 01:00:38,548 INFO L280 TraceCheckUtils]: 1: Hoare triple {2100#true} assume !(~i~0 < ~size); {2100#true} is VALID [2020-07-29 01:00:38,548 INFO L280 TraceCheckUtils]: 2: Hoare triple {2100#true} #res := ~i~0; {2100#true} is VALID [2020-07-29 01:00:38,548 INFO L280 TraceCheckUtils]: 3: Hoare triple {2100#true} assume true; {2100#true} is VALID [2020-07-29 01:00:38,550 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2100#true} {2105#(= 0 main_~i~1)} #78#return; {2105#(= 0 main_~i~1)} is VALID [2020-07-29 01:00:38,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-07-29 01:00:38,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:38,591 INFO L280 TraceCheckUtils]: 0: Hoare triple {2100#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {2118#(and (<= foo_~i~0 0) (= foo_~size |foo_#in~size|))} is VALID [2020-07-29 01:00:38,592 INFO L280 TraceCheckUtils]: 1: Hoare triple {2118#(and (<= foo_~i~0 0) (= foo_~size |foo_#in~size|))} assume !(~i~0 < ~size); {2119#(<= |foo_#in~size| 0)} is VALID [2020-07-29 01:00:38,595 INFO L280 TraceCheckUtils]: 2: Hoare triple {2119#(<= |foo_#in~size| 0)} #res := ~i~0; {2119#(<= |foo_#in~size| 0)} is VALID [2020-07-29 01:00:38,595 INFO L280 TraceCheckUtils]: 3: Hoare triple {2119#(<= |foo_#in~size| 0)} assume true; {2119#(<= |foo_#in~size| 0)} is VALID [2020-07-29 01:00:38,596 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2119#(<= |foo_#in~size| 0)} {2111#(<= 1 main_~i~1)} #78#return; {2101#false} is VALID [2020-07-29 01:00:38,597 INFO L263 TraceCheckUtils]: 0: Hoare triple {2100#true} call ULTIMATE.init(); {2117#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:00:38,597 INFO L280 TraceCheckUtils]: 1: Hoare triple {2117#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2100#true} is VALID [2020-07-29 01:00:38,597 INFO L280 TraceCheckUtils]: 2: Hoare triple {2100#true} assume true; {2100#true} is VALID [2020-07-29 01:00:38,598 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2100#true} {2100#true} #74#return; {2100#true} is VALID [2020-07-29 01:00:38,598 INFO L263 TraceCheckUtils]: 4: Hoare triple {2100#true} call #t~ret6 := main(); {2100#true} is VALID [2020-07-29 01:00:38,598 INFO L280 TraceCheckUtils]: 5: Hoare triple {2100#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(128);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {2105#(= 0 main_~i~1)} is VALID [2020-07-29 01:00:38,599 INFO L280 TraceCheckUtils]: 6: Hoare triple {2105#(= 0 main_~i~1)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {2105#(= 0 main_~i~1)} is VALID [2020-07-29 01:00:38,599 INFO L263 TraceCheckUtils]: 7: Hoare triple {2105#(= 0 main_~i~1)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {2100#true} is VALID [2020-07-29 01:00:38,599 INFO L280 TraceCheckUtils]: 8: Hoare triple {2100#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {2100#true} is VALID [2020-07-29 01:00:38,600 INFO L280 TraceCheckUtils]: 9: Hoare triple {2100#true} assume !(~i~0 < ~size); {2100#true} is VALID [2020-07-29 01:00:38,600 INFO L280 TraceCheckUtils]: 10: Hoare triple {2100#true} #res := ~i~0; {2100#true} is VALID [2020-07-29 01:00:38,600 INFO L280 TraceCheckUtils]: 11: Hoare triple {2100#true} assume true; {2100#true} is VALID [2020-07-29 01:00:38,601 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {2100#true} {2105#(= 0 main_~i~1)} #78#return; {2105#(= 0 main_~i~1)} is VALID [2020-07-29 01:00:38,606 INFO L280 TraceCheckUtils]: 13: Hoare triple {2105#(= 0 main_~i~1)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {2105#(= 0 main_~i~1)} is VALID [2020-07-29 01:00:38,607 INFO L280 TraceCheckUtils]: 14: Hoare triple {2105#(= 0 main_~i~1)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {2105#(= 0 main_~i~1)} is VALID [2020-07-29 01:00:38,608 INFO L280 TraceCheckUtils]: 15: Hoare triple {2105#(= 0 main_~i~1)} havoc #t~ret3; {2105#(= 0 main_~i~1)} is VALID [2020-07-29 01:00:38,608 INFO L280 TraceCheckUtils]: 16: Hoare triple {2105#(= 0 main_~i~1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2111#(<= 1 main_~i~1)} is VALID [2020-07-29 01:00:38,609 INFO L280 TraceCheckUtils]: 17: Hoare triple {2111#(<= 1 main_~i~1)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {2111#(<= 1 main_~i~1)} is VALID [2020-07-29 01:00:38,609 INFO L263 TraceCheckUtils]: 18: Hoare triple {2111#(<= 1 main_~i~1)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {2100#true} is VALID [2020-07-29 01:00:38,610 INFO L280 TraceCheckUtils]: 19: Hoare triple {2100#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {2118#(and (<= foo_~i~0 0) (= foo_~size |foo_#in~size|))} is VALID [2020-07-29 01:00:38,611 INFO L280 TraceCheckUtils]: 20: Hoare triple {2118#(and (<= foo_~i~0 0) (= foo_~size |foo_#in~size|))} assume !(~i~0 < ~size); {2119#(<= |foo_#in~size| 0)} is VALID [2020-07-29 01:00:38,611 INFO L280 TraceCheckUtils]: 21: Hoare triple {2119#(<= |foo_#in~size| 0)} #res := ~i~0; {2119#(<= |foo_#in~size| 0)} is VALID [2020-07-29 01:00:38,612 INFO L280 TraceCheckUtils]: 22: Hoare triple {2119#(<= |foo_#in~size| 0)} assume true; {2119#(<= |foo_#in~size| 0)} is VALID [2020-07-29 01:00:38,613 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {2119#(<= |foo_#in~size| 0)} {2111#(<= 1 main_~i~1)} #78#return; {2101#false} is VALID [2020-07-29 01:00:38,614 INFO L280 TraceCheckUtils]: 24: Hoare triple {2101#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {2101#false} is VALID [2020-07-29 01:00:38,614 INFO L280 TraceCheckUtils]: 25: Hoare triple {2101#false} assume !(4 + (~#b~0.offset + 4 * ~i~1) <= #length[~#b~0.base] && 0 <= ~#b~0.offset + 4 * ~i~1); {2101#false} is VALID [2020-07-29 01:00:38,615 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 01:00:38,615 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462597943] [2020-07-29 01:00:38,615 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275899975] [2020-07-29 01:00:38,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:00:38,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:38,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:00:38,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:38,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:00:38,871 INFO L263 TraceCheckUtils]: 0: Hoare triple {2100#true} call ULTIMATE.init(); {2100#true} is VALID [2020-07-29 01:00:38,871 INFO L280 TraceCheckUtils]: 1: Hoare triple {2100#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2100#true} is VALID [2020-07-29 01:00:38,872 INFO L280 TraceCheckUtils]: 2: Hoare triple {2100#true} assume true; {2100#true} is VALID [2020-07-29 01:00:38,872 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2100#true} {2100#true} #74#return; {2100#true} is VALID [2020-07-29 01:00:38,872 INFO L263 TraceCheckUtils]: 4: Hoare triple {2100#true} call #t~ret6 := main(); {2100#true} is VALID [2020-07-29 01:00:38,874 INFO L280 TraceCheckUtils]: 5: Hoare triple {2100#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(128);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {2138#(<= 0 main_~i~1)} is VALID [2020-07-29 01:00:38,875 INFO L280 TraceCheckUtils]: 6: Hoare triple {2138#(<= 0 main_~i~1)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {2138#(<= 0 main_~i~1)} is VALID [2020-07-29 01:00:38,875 INFO L263 TraceCheckUtils]: 7: Hoare triple {2138#(<= 0 main_~i~1)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {2100#true} is VALID [2020-07-29 01:00:38,875 INFO L280 TraceCheckUtils]: 8: Hoare triple {2100#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {2100#true} is VALID [2020-07-29 01:00:38,875 INFO L280 TraceCheckUtils]: 9: Hoare triple {2100#true} assume !(~i~0 < ~size); {2100#true} is VALID [2020-07-29 01:00:38,875 INFO L280 TraceCheckUtils]: 10: Hoare triple {2100#true} #res := ~i~0; {2100#true} is VALID [2020-07-29 01:00:38,876 INFO L280 TraceCheckUtils]: 11: Hoare triple {2100#true} assume true; {2100#true} is VALID [2020-07-29 01:00:38,876 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {2100#true} {2138#(<= 0 main_~i~1)} #78#return; {2138#(<= 0 main_~i~1)} is VALID [2020-07-29 01:00:38,877 INFO L280 TraceCheckUtils]: 13: Hoare triple {2138#(<= 0 main_~i~1)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {2138#(<= 0 main_~i~1)} is VALID [2020-07-29 01:00:38,877 INFO L280 TraceCheckUtils]: 14: Hoare triple {2138#(<= 0 main_~i~1)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {2138#(<= 0 main_~i~1)} is VALID [2020-07-29 01:00:38,878 INFO L280 TraceCheckUtils]: 15: Hoare triple {2138#(<= 0 main_~i~1)} havoc #t~ret3; {2138#(<= 0 main_~i~1)} is VALID [2020-07-29 01:00:38,878 INFO L280 TraceCheckUtils]: 16: Hoare triple {2138#(<= 0 main_~i~1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2111#(<= 1 main_~i~1)} is VALID [2020-07-29 01:00:38,879 INFO L280 TraceCheckUtils]: 17: Hoare triple {2111#(<= 1 main_~i~1)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {2111#(<= 1 main_~i~1)} is VALID [2020-07-29 01:00:38,879 INFO L263 TraceCheckUtils]: 18: Hoare triple {2111#(<= 1 main_~i~1)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {2100#true} is VALID [2020-07-29 01:00:38,879 INFO L280 TraceCheckUtils]: 19: Hoare triple {2100#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {2181#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:00:38,880 INFO L280 TraceCheckUtils]: 20: Hoare triple {2181#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} assume !(~i~0 < ~size); {2119#(<= |foo_#in~size| 0)} is VALID [2020-07-29 01:00:38,880 INFO L280 TraceCheckUtils]: 21: Hoare triple {2119#(<= |foo_#in~size| 0)} #res := ~i~0; {2119#(<= |foo_#in~size| 0)} is VALID [2020-07-29 01:00:38,881 INFO L280 TraceCheckUtils]: 22: Hoare triple {2119#(<= |foo_#in~size| 0)} assume true; {2119#(<= |foo_#in~size| 0)} is VALID [2020-07-29 01:00:38,882 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {2119#(<= |foo_#in~size| 0)} {2111#(<= 1 main_~i~1)} #78#return; {2101#false} is VALID [2020-07-29 01:00:38,882 INFO L280 TraceCheckUtils]: 24: Hoare triple {2101#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {2101#false} is VALID [2020-07-29 01:00:38,882 INFO L280 TraceCheckUtils]: 25: Hoare triple {2101#false} assume !(4 + (~#b~0.offset + 4 * ~i~1) <= #length[~#b~0.base] && 0 <= ~#b~0.offset + 4 * ~i~1); {2101#false} is VALID [2020-07-29 01:00:38,883 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 01:00:38,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-29 01:00:38,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2020-07-29 01:00:38,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581312641] [2020-07-29 01:00:38,884 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-07-29 01:00:38,884 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:00:38,884 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:00:38,913 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:38,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-29 01:00:38,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:00:38,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:00:38,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:00:38,914 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 6 states. [2020-07-29 01:00:39,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:39,212 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2020-07-29 01:00:39,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:00:39,213 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-07-29 01:00:39,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:00:39,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:00:39,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2020-07-29 01:00:39,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:00:39,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2020-07-29 01:00:39,218 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 61 transitions. [2020-07-29 01:00:39,289 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:39,291 INFO L225 Difference]: With dead ends: 63 [2020-07-29 01:00:39,291 INFO L226 Difference]: Without dead ends: 60 [2020-07-29 01:00:39,291 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:00:39,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-07-29 01:00:39,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2020-07-29 01:00:39,296 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:00:39,297 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 54 states. [2020-07-29 01:00:39,297 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 54 states. [2020-07-29 01:00:39,297 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 54 states. [2020-07-29 01:00:39,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:39,299 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2020-07-29 01:00:39,300 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2020-07-29 01:00:39,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:39,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:39,301 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 60 states. [2020-07-29 01:00:39,301 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 60 states. [2020-07-29 01:00:39,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:39,303 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2020-07-29 01:00:39,303 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2020-07-29 01:00:39,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:39,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:39,304 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:00:39,304 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:00:39,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-29 01:00:39,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2020-07-29 01:00:39,307 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 26 [2020-07-29 01:00:39,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:00:39,307 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2020-07-29 01:00:39,307 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-29 01:00:39,308 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2020-07-29 01:00:39,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-29 01:00:39,308 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:00:39,309 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:00:39,522 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:00:39,523 INFO L427 AbstractCegarLoop]: === Iteration 10 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:00:39,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:00:39,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1992931931, now seen corresponding path program 1 times [2020-07-29 01:00:39,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:00:39,525 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244035528] [2020-07-29 01:00:39,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:00:39,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:39,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:00:39,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:39,639 INFO L280 TraceCheckUtils]: 0: Hoare triple {2453#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2438#true} is VALID [2020-07-29 01:00:39,639 INFO L280 TraceCheckUtils]: 1: Hoare triple {2438#true} assume true; {2438#true} is VALID [2020-07-29 01:00:39,640 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2438#true} {2438#true} #74#return; {2438#true} is VALID [2020-07-29 01:00:39,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-07-29 01:00:39,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:39,647 INFO L280 TraceCheckUtils]: 0: Hoare triple {2438#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {2438#true} is VALID [2020-07-29 01:00:39,647 INFO L280 TraceCheckUtils]: 1: Hoare triple {2438#true} assume !(~i~0 < ~size); {2438#true} is VALID [2020-07-29 01:00:39,648 INFO L280 TraceCheckUtils]: 2: Hoare triple {2438#true} #res := ~i~0; {2438#true} is VALID [2020-07-29 01:00:39,648 INFO L280 TraceCheckUtils]: 3: Hoare triple {2438#true} assume true; {2438#true} is VALID [2020-07-29 01:00:39,650 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2438#true} {2443#(= 0 main_~i~1)} #78#return; {2443#(= 0 main_~i~1)} is VALID [2020-07-29 01:00:39,656 INFO L263 TraceCheckUtils]: 0: Hoare triple {2438#true} call ULTIMATE.init(); {2453#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:00:39,657 INFO L280 TraceCheckUtils]: 1: Hoare triple {2453#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2438#true} is VALID [2020-07-29 01:00:39,657 INFO L280 TraceCheckUtils]: 2: Hoare triple {2438#true} assume true; {2438#true} is VALID [2020-07-29 01:00:39,657 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2438#true} {2438#true} #74#return; {2438#true} is VALID [2020-07-29 01:00:39,657 INFO L263 TraceCheckUtils]: 4: Hoare triple {2438#true} call #t~ret6 := main(); {2438#true} is VALID [2020-07-29 01:00:39,659 INFO L280 TraceCheckUtils]: 5: Hoare triple {2438#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(128);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {2443#(= 0 main_~i~1)} is VALID [2020-07-29 01:00:39,659 INFO L280 TraceCheckUtils]: 6: Hoare triple {2443#(= 0 main_~i~1)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {2443#(= 0 main_~i~1)} is VALID [2020-07-29 01:00:39,659 INFO L263 TraceCheckUtils]: 7: Hoare triple {2443#(= 0 main_~i~1)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {2438#true} is VALID [2020-07-29 01:00:39,660 INFO L280 TraceCheckUtils]: 8: Hoare triple {2438#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {2438#true} is VALID [2020-07-29 01:00:39,660 INFO L280 TraceCheckUtils]: 9: Hoare triple {2438#true} assume !(~i~0 < ~size); {2438#true} is VALID [2020-07-29 01:00:39,660 INFO L280 TraceCheckUtils]: 10: Hoare triple {2438#true} #res := ~i~0; {2438#true} is VALID [2020-07-29 01:00:39,660 INFO L280 TraceCheckUtils]: 11: Hoare triple {2438#true} assume true; {2438#true} is VALID [2020-07-29 01:00:39,662 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {2438#true} {2443#(= 0 main_~i~1)} #78#return; {2443#(= 0 main_~i~1)} is VALID [2020-07-29 01:00:39,662 INFO L280 TraceCheckUtils]: 13: Hoare triple {2443#(= 0 main_~i~1)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {2443#(= 0 main_~i~1)} is VALID [2020-07-29 01:00:39,663 INFO L280 TraceCheckUtils]: 14: Hoare triple {2443#(= 0 main_~i~1)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {2443#(= 0 main_~i~1)} is VALID [2020-07-29 01:00:39,663 INFO L280 TraceCheckUtils]: 15: Hoare triple {2443#(= 0 main_~i~1)} havoc #t~ret3; {2443#(= 0 main_~i~1)} is VALID [2020-07-29 01:00:39,664 INFO L280 TraceCheckUtils]: 16: Hoare triple {2443#(= 0 main_~i~1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2449#(<= main_~i~1 1)} is VALID [2020-07-29 01:00:39,665 INFO L280 TraceCheckUtils]: 17: Hoare triple {2449#(<= main_~i~1 1)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {2449#(<= main_~i~1 1)} is VALID [2020-07-29 01:00:39,666 INFO L263 TraceCheckUtils]: 18: Hoare triple {2449#(<= main_~i~1 1)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {2450#(<= |foo_#in~size| 1)} is VALID [2020-07-29 01:00:39,667 INFO L280 TraceCheckUtils]: 19: Hoare triple {2450#(<= |foo_#in~size| 1)} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {2451#(and (<= foo_~size 1) (= 0 foo_~i~0))} is VALID [2020-07-29 01:00:39,668 INFO L280 TraceCheckUtils]: 20: Hoare triple {2451#(and (<= foo_~size 1) (= 0 foo_~i~0))} assume !!(~i~0 < ~size); {2451#(and (<= foo_~size 1) (= 0 foo_~i~0))} is VALID [2020-07-29 01:00:39,669 INFO L280 TraceCheckUtils]: 21: Hoare triple {2451#(and (<= foo_~size 1) (= 0 foo_~i~0))} assume 0 <= ~i~0 && ~i~0 < 32; {2451#(and (<= foo_~size 1) (= 0 foo_~i~0))} is VALID [2020-07-29 01:00:39,670 INFO L280 TraceCheckUtils]: 22: Hoare triple {2451#(and (<= foo_~size 1) (= 0 foo_~i~0))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {2451#(and (<= foo_~size 1) (= 0 foo_~i~0))} is VALID [2020-07-29 01:00:39,671 INFO L280 TraceCheckUtils]: 23: Hoare triple {2451#(and (<= foo_~size 1) (= 0 foo_~i~0))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {2451#(and (<= foo_~size 1) (= 0 foo_~i~0))} is VALID [2020-07-29 01:00:39,672 INFO L280 TraceCheckUtils]: 24: Hoare triple {2451#(and (<= foo_~size 1) (= 0 foo_~i~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2452#(<= foo_~size foo_~i~0)} is VALID [2020-07-29 01:00:39,673 INFO L280 TraceCheckUtils]: 25: Hoare triple {2452#(<= foo_~size foo_~i~0)} assume !!(~i~0 < ~size); {2439#false} is VALID [2020-07-29 01:00:39,673 INFO L280 TraceCheckUtils]: 26: Hoare triple {2439#false} assume !(0 <= ~i~0 && ~i~0 < 32); {2439#false} is VALID [2020-07-29 01:00:39,674 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:00:39,674 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244035528] [2020-07-29 01:00:39,675 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007878462] [2020-07-29 01:00:39,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:00:39,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:39,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:00:39,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:39,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:00:39,928 INFO L263 TraceCheckUtils]: 0: Hoare triple {2438#true} call ULTIMATE.init(); {2438#true} is VALID [2020-07-29 01:00:39,929 INFO L280 TraceCheckUtils]: 1: Hoare triple {2438#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2438#true} is VALID [2020-07-29 01:00:39,929 INFO L280 TraceCheckUtils]: 2: Hoare triple {2438#true} assume true; {2438#true} is VALID [2020-07-29 01:00:39,929 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2438#true} {2438#true} #74#return; {2438#true} is VALID [2020-07-29 01:00:39,930 INFO L263 TraceCheckUtils]: 4: Hoare triple {2438#true} call #t~ret6 := main(); {2438#true} is VALID [2020-07-29 01:00:39,932 INFO L280 TraceCheckUtils]: 5: Hoare triple {2438#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(128);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {2472#(<= main_~i~1 0)} is VALID [2020-07-29 01:00:39,932 INFO L280 TraceCheckUtils]: 6: Hoare triple {2472#(<= main_~i~1 0)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {2472#(<= main_~i~1 0)} is VALID [2020-07-29 01:00:39,932 INFO L263 TraceCheckUtils]: 7: Hoare triple {2472#(<= main_~i~1 0)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {2438#true} is VALID [2020-07-29 01:00:39,932 INFO L280 TraceCheckUtils]: 8: Hoare triple {2438#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {2438#true} is VALID [2020-07-29 01:00:39,933 INFO L280 TraceCheckUtils]: 9: Hoare triple {2438#true} assume !(~i~0 < ~size); {2438#true} is VALID [2020-07-29 01:00:39,933 INFO L280 TraceCheckUtils]: 10: Hoare triple {2438#true} #res := ~i~0; {2438#true} is VALID [2020-07-29 01:00:39,933 INFO L280 TraceCheckUtils]: 11: Hoare triple {2438#true} assume true; {2438#true} is VALID [2020-07-29 01:00:39,934 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {2438#true} {2472#(<= main_~i~1 0)} #78#return; {2472#(<= main_~i~1 0)} is VALID [2020-07-29 01:00:39,935 INFO L280 TraceCheckUtils]: 13: Hoare triple {2472#(<= main_~i~1 0)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {2472#(<= main_~i~1 0)} is VALID [2020-07-29 01:00:39,935 INFO L280 TraceCheckUtils]: 14: Hoare triple {2472#(<= main_~i~1 0)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {2472#(<= main_~i~1 0)} is VALID [2020-07-29 01:00:39,936 INFO L280 TraceCheckUtils]: 15: Hoare triple {2472#(<= main_~i~1 0)} havoc #t~ret3; {2472#(<= main_~i~1 0)} is VALID [2020-07-29 01:00:39,936 INFO L280 TraceCheckUtils]: 16: Hoare triple {2472#(<= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2449#(<= main_~i~1 1)} is VALID [2020-07-29 01:00:39,937 INFO L280 TraceCheckUtils]: 17: Hoare triple {2449#(<= main_~i~1 1)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {2449#(<= main_~i~1 1)} is VALID [2020-07-29 01:00:39,939 INFO L263 TraceCheckUtils]: 18: Hoare triple {2449#(<= main_~i~1 1)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {2450#(<= |foo_#in~size| 1)} is VALID [2020-07-29 01:00:39,939 INFO L280 TraceCheckUtils]: 19: Hoare triple {2450#(<= |foo_#in~size| 1)} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {2515#(and (<= 0 foo_~i~0) (<= foo_~size 1))} is VALID [2020-07-29 01:00:39,940 INFO L280 TraceCheckUtils]: 20: Hoare triple {2515#(and (<= 0 foo_~i~0) (<= foo_~size 1))} assume !!(~i~0 < ~size); {2515#(and (<= 0 foo_~i~0) (<= foo_~size 1))} is VALID [2020-07-29 01:00:39,941 INFO L280 TraceCheckUtils]: 21: Hoare triple {2515#(and (<= 0 foo_~i~0) (<= foo_~size 1))} assume 0 <= ~i~0 && ~i~0 < 32; {2515#(and (<= 0 foo_~i~0) (<= foo_~size 1))} is VALID [2020-07-29 01:00:39,941 INFO L280 TraceCheckUtils]: 22: Hoare triple {2515#(and (<= 0 foo_~i~0) (<= foo_~size 1))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {2515#(and (<= 0 foo_~i~0) (<= foo_~size 1))} is VALID [2020-07-29 01:00:39,944 INFO L280 TraceCheckUtils]: 23: Hoare triple {2515#(and (<= 0 foo_~i~0) (<= foo_~size 1))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {2515#(and (<= 0 foo_~i~0) (<= foo_~size 1))} is VALID [2020-07-29 01:00:39,947 INFO L280 TraceCheckUtils]: 24: Hoare triple {2515#(and (<= 0 foo_~i~0) (<= foo_~size 1))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2531#(and (<= foo_~size 1) (<= 1 foo_~i~0))} is VALID [2020-07-29 01:00:39,948 INFO L280 TraceCheckUtils]: 25: Hoare triple {2531#(and (<= foo_~size 1) (<= 1 foo_~i~0))} assume !!(~i~0 < ~size); {2439#false} is VALID [2020-07-29 01:00:39,949 INFO L280 TraceCheckUtils]: 26: Hoare triple {2439#false} assume !(0 <= ~i~0 && ~i~0 < 32); {2439#false} is VALID [2020-07-29 01:00:39,950 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:00:39,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:00:39,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2020-07-29 01:00:39,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187922301] [2020-07-29 01:00:39,951 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2020-07-29 01:00:39,952 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:00:39,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-29 01:00:40,000 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:40,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-29 01:00:40,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:00:40,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-29 01:00:40,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-07-29 01:00:40,001 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 11 states. [2020-07-29 01:00:40,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:40,709 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2020-07-29 01:00:40,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-29 01:00:40,709 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2020-07-29 01:00:40,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:00:40,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-29 01:00:40,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2020-07-29 01:00:40,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-29 01:00:40,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2020-07-29 01:00:40,714 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 81 transitions. [2020-07-29 01:00:40,826 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:40,829 INFO L225 Difference]: With dead ends: 81 [2020-07-29 01:00:40,829 INFO L226 Difference]: Without dead ends: 81 [2020-07-29 01:00:40,830 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2020-07-29 01:00:40,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-07-29 01:00:40,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 65. [2020-07-29 01:00:40,835 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:00:40,835 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 65 states. [2020-07-29 01:00:40,835 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 65 states. [2020-07-29 01:00:40,835 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 65 states. [2020-07-29 01:00:40,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:40,838 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2020-07-29 01:00:40,838 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2020-07-29 01:00:40,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:40,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:40,839 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 81 states. [2020-07-29 01:00:40,839 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 81 states. [2020-07-29 01:00:40,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:40,842 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2020-07-29 01:00:40,842 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2020-07-29 01:00:40,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:40,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:40,842 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:00:40,843 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:00:40,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-07-29 01:00:40,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2020-07-29 01:00:40,845 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 27 [2020-07-29 01:00:40,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:00:40,845 INFO L479 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2020-07-29 01:00:40,845 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-29 01:00:40,845 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2020-07-29 01:00:40,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-29 01:00:40,846 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:00:40,846 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:00:41,057 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-07-29 01:00:41,058 INFO L427 AbstractCegarLoop]: === Iteration 11 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:00:41,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:00:41,059 INFO L82 PathProgramCache]: Analyzing trace with hash -790766996, now seen corresponding path program 1 times [2020-07-29 01:00:41,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:00:41,060 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049791837] [2020-07-29 01:00:41,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:00:41,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:41,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:00:41,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:41,161 INFO L280 TraceCheckUtils]: 0: Hoare triple {2880#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2858#true} is VALID [2020-07-29 01:00:41,162 INFO L280 TraceCheckUtils]: 1: Hoare triple {2858#true} assume true; {2858#true} is VALID [2020-07-29 01:00:41,162 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2858#true} {2858#true} #74#return; {2858#true} is VALID [2020-07-29 01:00:41,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-07-29 01:00:41,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:41,168 INFO L280 TraceCheckUtils]: 0: Hoare triple {2858#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {2858#true} is VALID [2020-07-29 01:00:41,168 INFO L280 TraceCheckUtils]: 1: Hoare triple {2858#true} assume !(~i~0 < ~size); {2858#true} is VALID [2020-07-29 01:00:41,169 INFO L280 TraceCheckUtils]: 2: Hoare triple {2858#true} #res := ~i~0; {2858#true} is VALID [2020-07-29 01:00:41,169 INFO L280 TraceCheckUtils]: 3: Hoare triple {2858#true} assume true; {2858#true} is VALID [2020-07-29 01:00:41,170 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2858#true} {2863#(and (= 0 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} #78#return; {2863#(and (= 0 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} is VALID [2020-07-29 01:00:41,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-07-29 01:00:41,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:41,180 INFO L280 TraceCheckUtils]: 0: Hoare triple {2858#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {2858#true} is VALID [2020-07-29 01:00:41,180 INFO L280 TraceCheckUtils]: 1: Hoare triple {2858#true} assume !!(~i~0 < ~size); {2858#true} is VALID [2020-07-29 01:00:41,180 INFO L280 TraceCheckUtils]: 2: Hoare triple {2858#true} assume 0 <= ~i~0 && ~i~0 < 32; {2858#true} is VALID [2020-07-29 01:00:41,180 INFO L280 TraceCheckUtils]: 3: Hoare triple {2858#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {2858#true} is VALID [2020-07-29 01:00:41,180 INFO L280 TraceCheckUtils]: 4: Hoare triple {2858#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {2858#true} is VALID [2020-07-29 01:00:41,181 INFO L280 TraceCheckUtils]: 5: Hoare triple {2858#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2858#true} is VALID [2020-07-29 01:00:41,181 INFO L280 TraceCheckUtils]: 6: Hoare triple {2858#true} assume !(~i~0 < ~size); {2858#true} is VALID [2020-07-29 01:00:41,181 INFO L280 TraceCheckUtils]: 7: Hoare triple {2858#true} #res := ~i~0; {2858#true} is VALID [2020-07-29 01:00:41,181 INFO L280 TraceCheckUtils]: 8: Hoare triple {2858#true} assume true; {2858#true} is VALID [2020-07-29 01:00:41,183 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {2858#true} {2869#(and (<= 1 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)) (<= main_~i~1 1))} #78#return; {2869#(and (<= 1 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)) (<= main_~i~1 1))} is VALID [2020-07-29 01:00:41,184 INFO L263 TraceCheckUtils]: 0: Hoare triple {2858#true} call ULTIMATE.init(); {2880#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:00:41,184 INFO L280 TraceCheckUtils]: 1: Hoare triple {2880#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2858#true} is VALID [2020-07-29 01:00:41,184 INFO L280 TraceCheckUtils]: 2: Hoare triple {2858#true} assume true; {2858#true} is VALID [2020-07-29 01:00:41,184 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2858#true} {2858#true} #74#return; {2858#true} is VALID [2020-07-29 01:00:41,184 INFO L263 TraceCheckUtils]: 4: Hoare triple {2858#true} call #t~ret6 := main(); {2858#true} is VALID [2020-07-29 01:00:41,186 INFO L280 TraceCheckUtils]: 5: Hoare triple {2858#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(128);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {2863#(and (= 0 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} is VALID [2020-07-29 01:00:41,187 INFO L280 TraceCheckUtils]: 6: Hoare triple {2863#(and (= 0 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {2863#(and (= 0 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} is VALID [2020-07-29 01:00:41,187 INFO L263 TraceCheckUtils]: 7: Hoare triple {2863#(and (= 0 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {2858#true} is VALID [2020-07-29 01:00:41,187 INFO L280 TraceCheckUtils]: 8: Hoare triple {2858#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {2858#true} is VALID [2020-07-29 01:00:41,187 INFO L280 TraceCheckUtils]: 9: Hoare triple {2858#true} assume !(~i~0 < ~size); {2858#true} is VALID [2020-07-29 01:00:41,187 INFO L280 TraceCheckUtils]: 10: Hoare triple {2858#true} #res := ~i~0; {2858#true} is VALID [2020-07-29 01:00:41,188 INFO L280 TraceCheckUtils]: 11: Hoare triple {2858#true} assume true; {2858#true} is VALID [2020-07-29 01:00:41,189 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {2858#true} {2863#(and (= 0 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} #78#return; {2863#(and (= 0 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} is VALID [2020-07-29 01:00:41,190 INFO L280 TraceCheckUtils]: 13: Hoare triple {2863#(and (= 0 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {2863#(and (= 0 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} is VALID [2020-07-29 01:00:41,191 INFO L280 TraceCheckUtils]: 14: Hoare triple {2863#(and (= 0 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {2863#(and (= 0 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} is VALID [2020-07-29 01:00:41,191 INFO L280 TraceCheckUtils]: 15: Hoare triple {2863#(and (= 0 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} havoc #t~ret3; {2863#(and (= 0 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} is VALID [2020-07-29 01:00:41,192 INFO L280 TraceCheckUtils]: 16: Hoare triple {2863#(and (= 0 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2869#(and (<= 1 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)) (<= main_~i~1 1))} is VALID [2020-07-29 01:00:41,193 INFO L280 TraceCheckUtils]: 17: Hoare triple {2869#(and (<= 1 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)) (<= main_~i~1 1))} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {2869#(and (<= 1 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)) (<= main_~i~1 1))} is VALID [2020-07-29 01:00:41,194 INFO L263 TraceCheckUtils]: 18: Hoare triple {2869#(and (<= 1 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)) (<= main_~i~1 1))} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {2858#true} is VALID [2020-07-29 01:00:41,194 INFO L280 TraceCheckUtils]: 19: Hoare triple {2858#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {2858#true} is VALID [2020-07-29 01:00:41,194 INFO L280 TraceCheckUtils]: 20: Hoare triple {2858#true} assume !!(~i~0 < ~size); {2858#true} is VALID [2020-07-29 01:00:41,194 INFO L280 TraceCheckUtils]: 21: Hoare triple {2858#true} assume 0 <= ~i~0 && ~i~0 < 32; {2858#true} is VALID [2020-07-29 01:00:41,194 INFO L280 TraceCheckUtils]: 22: Hoare triple {2858#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {2858#true} is VALID [2020-07-29 01:00:41,195 INFO L280 TraceCheckUtils]: 23: Hoare triple {2858#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {2858#true} is VALID [2020-07-29 01:00:41,195 INFO L280 TraceCheckUtils]: 24: Hoare triple {2858#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2858#true} is VALID [2020-07-29 01:00:41,195 INFO L280 TraceCheckUtils]: 25: Hoare triple {2858#true} assume !(~i~0 < ~size); {2858#true} is VALID [2020-07-29 01:00:41,195 INFO L280 TraceCheckUtils]: 26: Hoare triple {2858#true} #res := ~i~0; {2858#true} is VALID [2020-07-29 01:00:41,195 INFO L280 TraceCheckUtils]: 27: Hoare triple {2858#true} assume true; {2858#true} is VALID [2020-07-29 01:00:41,197 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {2858#true} {2869#(and (<= 1 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)) (<= main_~i~1 1))} #78#return; {2869#(and (<= 1 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)) (<= main_~i~1 1))} is VALID [2020-07-29 01:00:41,198 INFO L280 TraceCheckUtils]: 29: Hoare triple {2869#(and (<= 1 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)) (<= main_~i~1 1))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {2869#(and (<= 1 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)) (<= main_~i~1 1))} is VALID [2020-07-29 01:00:41,199 INFO L280 TraceCheckUtils]: 30: Hoare triple {2869#(and (<= 1 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)) (<= main_~i~1 1))} assume !(4 + (~#b~0.offset + 4 * ~i~1) <= #length[~#b~0.base] && 0 <= ~#b~0.offset + 4 * ~i~1); {2859#false} is VALID [2020-07-29 01:00:41,201 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-29 01:00:41,201 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049791837] [2020-07-29 01:00:41,201 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610927817] [2020-07-29 01:00:41,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:00:41,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:41,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 15 conjunts are in the unsatisfiable core [2020-07-29 01:00:41,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:41,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:00:41,284 INFO L440 ElimStorePlain]: Different costs {0=[|v_#length_13|], 1=[|v_#valid_25|]} [2020-07-29 01:00:41,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-29 01:00:41,291 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2020-07-29 01:00:41,292 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:00:41,301 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:00:41,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-29 01:00:41,310 INFO L384 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 5 treesize of output 3 [2020-07-29 01:00:41,313 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-29 01:00:41,327 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:00:41,327 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:00:41,328 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2020-07-29 01:00:41,330 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:00:41,331 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_13|, |v_#valid_25|]. (and (= (store (store |v_#length_13| |main_~#b~0.base| 128) |main_~#mask~0.base| 32) |#length|) (<= (select (store |v_#valid_25| |main_~#b~0.base| 1) |main_~#mask~0.base|) 0) (= 0 main_~i~1) (= 0 |main_~#b~0.offset|)) [2020-07-29 01:00:41,331 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|))) [2020-07-29 01:00:41,692 INFO L263 TraceCheckUtils]: 0: Hoare triple {2858#true} call ULTIMATE.init(); {2858#true} is VALID [2020-07-29 01:00:41,693 INFO L280 TraceCheckUtils]: 1: Hoare triple {2858#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2858#true} is VALID [2020-07-29 01:00:41,693 INFO L280 TraceCheckUtils]: 2: Hoare triple {2858#true} assume true; {2858#true} is VALID [2020-07-29 01:00:41,693 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2858#true} {2858#true} #74#return; {2858#true} is VALID [2020-07-29 01:00:41,693 INFO L263 TraceCheckUtils]: 4: Hoare triple {2858#true} call #t~ret6 := main(); {2858#true} is VALID [2020-07-29 01:00:41,694 INFO L280 TraceCheckUtils]: 5: Hoare triple {2858#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(128);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {2899#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} is VALID [2020-07-29 01:00:41,695 INFO L280 TraceCheckUtils]: 6: Hoare triple {2899#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {2899#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} is VALID [2020-07-29 01:00:41,696 INFO L263 TraceCheckUtils]: 7: Hoare triple {2899#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {2906#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_3| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_3|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_1|))))} is VALID [2020-07-29 01:00:41,697 INFO L280 TraceCheckUtils]: 8: Hoare triple {2906#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_3| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_3|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_1|))))} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {2906#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_3| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_3|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_1|))))} is VALID [2020-07-29 01:00:41,697 INFO L280 TraceCheckUtils]: 9: Hoare triple {2906#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_3| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_3|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_1|))))} assume !(~i~0 < ~size); {2906#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_3| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_3|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_1|))))} is VALID [2020-07-29 01:00:41,698 INFO L280 TraceCheckUtils]: 10: Hoare triple {2906#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_3| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_3|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_1|))))} #res := ~i~0; {2906#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_3| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_3|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_1|))))} is VALID [2020-07-29 01:00:41,698 INFO L280 TraceCheckUtils]: 11: Hoare triple {2906#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_3| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_3|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_1|))))} assume true; {2906#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_3| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_3|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_1|))))} is VALID [2020-07-29 01:00:41,699 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {2906#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_3| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_3|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_1|))))} {2899#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} #78#return; {2899#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} is VALID [2020-07-29 01:00:41,700 INFO L280 TraceCheckUtils]: 13: Hoare triple {2899#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {2899#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} is VALID [2020-07-29 01:00:41,701 INFO L280 TraceCheckUtils]: 14: Hoare triple {2899#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {2899#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} is VALID [2020-07-29 01:00:41,701 INFO L280 TraceCheckUtils]: 15: Hoare triple {2899#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} havoc #t~ret3; {2899#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} is VALID [2020-07-29 01:00:41,702 INFO L280 TraceCheckUtils]: 16: Hoare triple {2899#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2934#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 1 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} is VALID [2020-07-29 01:00:41,702 INFO L280 TraceCheckUtils]: 17: Hoare triple {2934#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 1 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {2938#(and (= 1 main_~i~1) (= 32 (select |#length| main_~c~0.base)) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} is VALID [2020-07-29 01:00:41,707 INFO L263 TraceCheckUtils]: 18: Hoare triple {2938#(and (= 1 main_~i~1) (= 32 (select |#length| main_~c~0.base)) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {2906#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_3| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_3|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_1|))))} is VALID [2020-07-29 01:00:41,710 INFO L280 TraceCheckUtils]: 19: Hoare triple {2906#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_3| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_3|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_1|))))} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {2906#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_3| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_3|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_1|))))} is VALID [2020-07-29 01:00:41,711 INFO L280 TraceCheckUtils]: 20: Hoare triple {2906#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_3| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_3|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_1|))))} assume !!(~i~0 < ~size); {2906#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_3| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_3|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_1|))))} is VALID [2020-07-29 01:00:41,712 INFO L280 TraceCheckUtils]: 21: Hoare triple {2906#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_3| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_3|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_1|))))} assume 0 <= ~i~0 && ~i~0 < 32; {2906#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_3| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_3|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_1|))))} is VALID [2020-07-29 01:00:41,713 INFO L280 TraceCheckUtils]: 22: Hoare triple {2906#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_3| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_3|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_1|))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {2906#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_3| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_3|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_1|))))} is VALID [2020-07-29 01:00:41,714 INFO L280 TraceCheckUtils]: 23: Hoare triple {2906#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_3| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_3|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_1|))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {2906#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_3| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_3|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_1|))))} is VALID [2020-07-29 01:00:41,714 INFO L280 TraceCheckUtils]: 24: Hoare triple {2906#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_3| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_3|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_1|))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2906#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_3| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_3|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_1|))))} is VALID [2020-07-29 01:00:41,715 INFO L280 TraceCheckUtils]: 25: Hoare triple {2906#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_3| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_3|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_1|))))} assume !(~i~0 < ~size); {2906#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_3| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_3|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_1|))))} is VALID [2020-07-29 01:00:41,716 INFO L280 TraceCheckUtils]: 26: Hoare triple {2906#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_3| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_3|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_1|))))} #res := ~i~0; {2906#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_3| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_3|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_1|))))} is VALID [2020-07-29 01:00:41,717 INFO L280 TraceCheckUtils]: 27: Hoare triple {2906#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_3| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_3|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_1|))))} assume true; {2906#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_3| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_3|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_1|))))} is VALID [2020-07-29 01:00:41,718 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {2906#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_3| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_3|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_1|))))} {2938#(and (= 1 main_~i~1) (= 32 (select |#length| main_~c~0.base)) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} #78#return; {2972#(and (= 1 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)) (exists ((main_~c~0.base Int)) (= 32 (select |#length| main_~c~0.base))))} is VALID [2020-07-29 01:00:41,719 INFO L280 TraceCheckUtils]: 29: Hoare triple {2972#(and (= 1 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)) (exists ((main_~c~0.base Int)) (= 32 (select |#length| main_~c~0.base))))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {2972#(and (= 1 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)) (exists ((main_~c~0.base Int)) (= 32 (select |#length| main_~c~0.base))))} is VALID [2020-07-29 01:00:41,720 INFO L280 TraceCheckUtils]: 30: Hoare triple {2972#(and (= 1 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)) (exists ((main_~c~0.base Int)) (= 32 (select |#length| main_~c~0.base))))} assume !(4 + (~#b~0.offset + 4 * ~i~1) <= #length[~#b~0.base] && 0 <= ~#b~0.offset + 4 * ~i~1); {2859#false} is VALID [2020-07-29 01:00:41,724 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-29 01:00:41,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:00:41,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6] total 9 [2020-07-29 01:00:41,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806555077] [2020-07-29 01:00:41,725 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2020-07-29 01:00:41,726 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:00:41,726 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-29 01:00:41,800 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:41,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-29 01:00:41,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:00:41,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-29 01:00:41,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:00:41,801 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 10 states. [2020-07-29 01:00:42,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:42,378 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2020-07-29 01:00:42,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:00:42,378 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2020-07-29 01:00:42,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:00:42,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:00:42,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2020-07-29 01:00:42,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:00:42,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2020-07-29 01:00:42,383 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 52 transitions. [2020-07-29 01:00:42,479 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:42,481 INFO L225 Difference]: With dead ends: 69 [2020-07-29 01:00:42,481 INFO L226 Difference]: Without dead ends: 69 [2020-07-29 01:00:42,482 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-07-29 01:00:42,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-07-29 01:00:42,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2020-07-29 01:00:42,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:00:42,485 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 67 states. [2020-07-29 01:00:42,485 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 67 states. [2020-07-29 01:00:42,486 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 67 states. [2020-07-29 01:00:42,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:42,487 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2020-07-29 01:00:42,488 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2020-07-29 01:00:42,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:42,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:42,488 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 69 states. [2020-07-29 01:00:42,488 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 69 states. [2020-07-29 01:00:42,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:42,490 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2020-07-29 01:00:42,491 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2020-07-29 01:00:42,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:42,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:42,491 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:00:42,491 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:00:42,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-07-29 01:00:42,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2020-07-29 01:00:42,493 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 31 [2020-07-29 01:00:42,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:00:42,493 INFO L479 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2020-07-29 01:00:42,493 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-29 01:00:42,493 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2020-07-29 01:00:42,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-29 01:00:42,494 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:00:42,494 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:00:42,709 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:00:42,710 INFO L427 AbstractCegarLoop]: === Iteration 12 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:00:42,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:00:42,710 INFO L82 PathProgramCache]: Analyzing trace with hash 894123677, now seen corresponding path program 1 times [2020-07-29 01:00:42,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:00:42,710 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427288560] [2020-07-29 01:00:42,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:00:42,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:42,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:00:42,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:42,790 INFO L280 TraceCheckUtils]: 0: Hoare triple {3280#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3257#true} is VALID [2020-07-29 01:00:42,790 INFO L280 TraceCheckUtils]: 1: Hoare triple {3257#true} assume true; {3257#true} is VALID [2020-07-29 01:00:42,790 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3257#true} {3257#true} #74#return; {3257#true} is VALID [2020-07-29 01:00:42,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-07-29 01:00:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:42,795 INFO L280 TraceCheckUtils]: 0: Hoare triple {3257#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {3257#true} is VALID [2020-07-29 01:00:42,795 INFO L280 TraceCheckUtils]: 1: Hoare triple {3257#true} assume !(~i~0 < ~size); {3257#true} is VALID [2020-07-29 01:00:42,795 INFO L280 TraceCheckUtils]: 2: Hoare triple {3257#true} #res := ~i~0; {3257#true} is VALID [2020-07-29 01:00:42,795 INFO L280 TraceCheckUtils]: 3: Hoare triple {3257#true} assume true; {3257#true} is VALID [2020-07-29 01:00:42,796 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3257#true} {3262#(= 0 main_~i~1)} #78#return; {3262#(= 0 main_~i~1)} is VALID [2020-07-29 01:00:42,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-07-29 01:00:42,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:42,804 INFO L280 TraceCheckUtils]: 0: Hoare triple {3257#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {3257#true} is VALID [2020-07-29 01:00:42,804 INFO L280 TraceCheckUtils]: 1: Hoare triple {3257#true} assume !!(~i~0 < ~size); {3257#true} is VALID [2020-07-29 01:00:42,804 INFO L280 TraceCheckUtils]: 2: Hoare triple {3257#true} assume 0 <= ~i~0 && ~i~0 < 32; {3257#true} is VALID [2020-07-29 01:00:42,805 INFO L280 TraceCheckUtils]: 3: Hoare triple {3257#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {3257#true} is VALID [2020-07-29 01:00:42,805 INFO L280 TraceCheckUtils]: 4: Hoare triple {3257#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {3257#true} is VALID [2020-07-29 01:00:42,805 INFO L280 TraceCheckUtils]: 5: Hoare triple {3257#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3257#true} is VALID [2020-07-29 01:00:42,805 INFO L280 TraceCheckUtils]: 6: Hoare triple {3257#true} assume !(~i~0 < ~size); {3257#true} is VALID [2020-07-29 01:00:42,806 INFO L280 TraceCheckUtils]: 7: Hoare triple {3257#true} #res := ~i~0; {3257#true} is VALID [2020-07-29 01:00:42,806 INFO L280 TraceCheckUtils]: 8: Hoare triple {3257#true} assume true; {3257#true} is VALID [2020-07-29 01:00:42,807 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {3257#true} {3268#(<= main_~i~1 1)} #78#return; {3268#(<= main_~i~1 1)} is VALID [2020-07-29 01:00:42,808 INFO L263 TraceCheckUtils]: 0: Hoare triple {3257#true} call ULTIMATE.init(); {3280#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:00:42,808 INFO L280 TraceCheckUtils]: 1: Hoare triple {3280#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3257#true} is VALID [2020-07-29 01:00:42,809 INFO L280 TraceCheckUtils]: 2: Hoare triple {3257#true} assume true; {3257#true} is VALID [2020-07-29 01:00:42,809 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3257#true} {3257#true} #74#return; {3257#true} is VALID [2020-07-29 01:00:42,809 INFO L263 TraceCheckUtils]: 4: Hoare triple {3257#true} call #t~ret6 := main(); {3257#true} is VALID [2020-07-29 01:00:42,810 INFO L280 TraceCheckUtils]: 5: Hoare triple {3257#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(128);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {3262#(= 0 main_~i~1)} is VALID [2020-07-29 01:00:42,810 INFO L280 TraceCheckUtils]: 6: Hoare triple {3262#(= 0 main_~i~1)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {3262#(= 0 main_~i~1)} is VALID [2020-07-29 01:00:42,811 INFO L263 TraceCheckUtils]: 7: Hoare triple {3262#(= 0 main_~i~1)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {3257#true} is VALID [2020-07-29 01:00:42,811 INFO L280 TraceCheckUtils]: 8: Hoare triple {3257#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {3257#true} is VALID [2020-07-29 01:00:42,811 INFO L280 TraceCheckUtils]: 9: Hoare triple {3257#true} assume !(~i~0 < ~size); {3257#true} is VALID [2020-07-29 01:00:42,811 INFO L280 TraceCheckUtils]: 10: Hoare triple {3257#true} #res := ~i~0; {3257#true} is VALID [2020-07-29 01:00:42,811 INFO L280 TraceCheckUtils]: 11: Hoare triple {3257#true} assume true; {3257#true} is VALID [2020-07-29 01:00:42,812 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {3257#true} {3262#(= 0 main_~i~1)} #78#return; {3262#(= 0 main_~i~1)} is VALID [2020-07-29 01:00:42,813 INFO L280 TraceCheckUtils]: 13: Hoare triple {3262#(= 0 main_~i~1)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {3262#(= 0 main_~i~1)} is VALID [2020-07-29 01:00:42,814 INFO L280 TraceCheckUtils]: 14: Hoare triple {3262#(= 0 main_~i~1)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {3262#(= 0 main_~i~1)} is VALID [2020-07-29 01:00:42,814 INFO L280 TraceCheckUtils]: 15: Hoare triple {3262#(= 0 main_~i~1)} havoc #t~ret3; {3262#(= 0 main_~i~1)} is VALID [2020-07-29 01:00:42,815 INFO L280 TraceCheckUtils]: 16: Hoare triple {3262#(= 0 main_~i~1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3268#(<= main_~i~1 1)} is VALID [2020-07-29 01:00:42,815 INFO L280 TraceCheckUtils]: 17: Hoare triple {3268#(<= main_~i~1 1)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {3268#(<= main_~i~1 1)} is VALID [2020-07-29 01:00:42,815 INFO L263 TraceCheckUtils]: 18: Hoare triple {3268#(<= main_~i~1 1)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {3257#true} is VALID [2020-07-29 01:00:42,816 INFO L280 TraceCheckUtils]: 19: Hoare triple {3257#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {3257#true} is VALID [2020-07-29 01:00:42,816 INFO L280 TraceCheckUtils]: 20: Hoare triple {3257#true} assume !!(~i~0 < ~size); {3257#true} is VALID [2020-07-29 01:00:42,816 INFO L280 TraceCheckUtils]: 21: Hoare triple {3257#true} assume 0 <= ~i~0 && ~i~0 < 32; {3257#true} is VALID [2020-07-29 01:00:42,816 INFO L280 TraceCheckUtils]: 22: Hoare triple {3257#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {3257#true} is VALID [2020-07-29 01:00:42,816 INFO L280 TraceCheckUtils]: 23: Hoare triple {3257#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {3257#true} is VALID [2020-07-29 01:00:42,816 INFO L280 TraceCheckUtils]: 24: Hoare triple {3257#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3257#true} is VALID [2020-07-29 01:00:42,817 INFO L280 TraceCheckUtils]: 25: Hoare triple {3257#true} assume !(~i~0 < ~size); {3257#true} is VALID [2020-07-29 01:00:42,817 INFO L280 TraceCheckUtils]: 26: Hoare triple {3257#true} #res := ~i~0; {3257#true} is VALID [2020-07-29 01:00:42,817 INFO L280 TraceCheckUtils]: 27: Hoare triple {3257#true} assume true; {3257#true} is VALID [2020-07-29 01:00:42,831 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {3257#true} {3268#(<= main_~i~1 1)} #78#return; {3268#(<= main_~i~1 1)} is VALID [2020-07-29 01:00:42,838 INFO L280 TraceCheckUtils]: 29: Hoare triple {3268#(<= main_~i~1 1)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {3268#(<= main_~i~1 1)} is VALID [2020-07-29 01:00:42,838 INFO L280 TraceCheckUtils]: 30: Hoare triple {3268#(<= main_~i~1 1)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {3268#(<= main_~i~1 1)} is VALID [2020-07-29 01:00:42,839 INFO L280 TraceCheckUtils]: 31: Hoare triple {3268#(<= main_~i~1 1)} havoc #t~ret3; {3268#(<= main_~i~1 1)} is VALID [2020-07-29 01:00:42,839 INFO L280 TraceCheckUtils]: 32: Hoare triple {3268#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3279#(<= main_~i~1 2)} is VALID [2020-07-29 01:00:42,840 INFO L280 TraceCheckUtils]: 33: Hoare triple {3279#(<= main_~i~1 2)} assume !(~i~1 < 32); {3258#false} is VALID [2020-07-29 01:00:42,840 INFO L280 TraceCheckUtils]: 34: Hoare triple {3258#false} ~i~1 := 0; {3258#false} is VALID [2020-07-29 01:00:42,840 INFO L280 TraceCheckUtils]: 35: Hoare triple {3258#false} assume !!(~i~1 < 32); {3258#false} is VALID [2020-07-29 01:00:42,841 INFO L280 TraceCheckUtils]: 36: Hoare triple {3258#false} assume !(4 + (~#b~0.offset + 4 * ~i~1) <= #length[~#b~0.base] && 0 <= ~#b~0.offset + 4 * ~i~1); {3258#false} is VALID [2020-07-29 01:00:42,842 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-29 01:00:42,842 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427288560] [2020-07-29 01:00:42,842 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096547056] [2020-07-29 01:00:42,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:00:42,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:42,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:00:42,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:42,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:00:43,022 INFO L263 TraceCheckUtils]: 0: Hoare triple {3257#true} call ULTIMATE.init(); {3257#true} is VALID [2020-07-29 01:00:43,022 INFO L280 TraceCheckUtils]: 1: Hoare triple {3257#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3257#true} is VALID [2020-07-29 01:00:43,023 INFO L280 TraceCheckUtils]: 2: Hoare triple {3257#true} assume true; {3257#true} is VALID [2020-07-29 01:00:43,023 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3257#true} {3257#true} #74#return; {3257#true} is VALID [2020-07-29 01:00:43,023 INFO L263 TraceCheckUtils]: 4: Hoare triple {3257#true} call #t~ret6 := main(); {3257#true} is VALID [2020-07-29 01:00:43,024 INFO L280 TraceCheckUtils]: 5: Hoare triple {3257#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(128);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {3299#(<= main_~i~1 0)} is VALID [2020-07-29 01:00:43,025 INFO L280 TraceCheckUtils]: 6: Hoare triple {3299#(<= main_~i~1 0)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {3299#(<= main_~i~1 0)} is VALID [2020-07-29 01:00:43,025 INFO L263 TraceCheckUtils]: 7: Hoare triple {3299#(<= main_~i~1 0)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {3257#true} is VALID [2020-07-29 01:00:43,026 INFO L280 TraceCheckUtils]: 8: Hoare triple {3257#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {3257#true} is VALID [2020-07-29 01:00:43,026 INFO L280 TraceCheckUtils]: 9: Hoare triple {3257#true} assume !(~i~0 < ~size); {3257#true} is VALID [2020-07-29 01:00:43,026 INFO L280 TraceCheckUtils]: 10: Hoare triple {3257#true} #res := ~i~0; {3257#true} is VALID [2020-07-29 01:00:43,026 INFO L280 TraceCheckUtils]: 11: Hoare triple {3257#true} assume true; {3257#true} is VALID [2020-07-29 01:00:43,028 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {3257#true} {3299#(<= main_~i~1 0)} #78#return; {3299#(<= main_~i~1 0)} is VALID [2020-07-29 01:00:43,029 INFO L280 TraceCheckUtils]: 13: Hoare triple {3299#(<= main_~i~1 0)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {3299#(<= main_~i~1 0)} is VALID [2020-07-29 01:00:43,029 INFO L280 TraceCheckUtils]: 14: Hoare triple {3299#(<= main_~i~1 0)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {3299#(<= main_~i~1 0)} is VALID [2020-07-29 01:00:43,030 INFO L280 TraceCheckUtils]: 15: Hoare triple {3299#(<= main_~i~1 0)} havoc #t~ret3; {3299#(<= main_~i~1 0)} is VALID [2020-07-29 01:00:43,031 INFO L280 TraceCheckUtils]: 16: Hoare triple {3299#(<= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3268#(<= main_~i~1 1)} is VALID [2020-07-29 01:00:43,032 INFO L280 TraceCheckUtils]: 17: Hoare triple {3268#(<= main_~i~1 1)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {3268#(<= main_~i~1 1)} is VALID [2020-07-29 01:00:43,032 INFO L263 TraceCheckUtils]: 18: Hoare triple {3268#(<= main_~i~1 1)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {3257#true} is VALID [2020-07-29 01:00:43,032 INFO L280 TraceCheckUtils]: 19: Hoare triple {3257#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {3257#true} is VALID [2020-07-29 01:00:43,032 INFO L280 TraceCheckUtils]: 20: Hoare triple {3257#true} assume !!(~i~0 < ~size); {3257#true} is VALID [2020-07-29 01:00:43,032 INFO L280 TraceCheckUtils]: 21: Hoare triple {3257#true} assume 0 <= ~i~0 && ~i~0 < 32; {3257#true} is VALID [2020-07-29 01:00:43,032 INFO L280 TraceCheckUtils]: 22: Hoare triple {3257#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {3257#true} is VALID [2020-07-29 01:00:43,033 INFO L280 TraceCheckUtils]: 23: Hoare triple {3257#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {3257#true} is VALID [2020-07-29 01:00:43,033 INFO L280 TraceCheckUtils]: 24: Hoare triple {3257#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3257#true} is VALID [2020-07-29 01:00:43,033 INFO L280 TraceCheckUtils]: 25: Hoare triple {3257#true} assume !(~i~0 < ~size); {3257#true} is VALID [2020-07-29 01:00:43,033 INFO L280 TraceCheckUtils]: 26: Hoare triple {3257#true} #res := ~i~0; {3257#true} is VALID [2020-07-29 01:00:43,033 INFO L280 TraceCheckUtils]: 27: Hoare triple {3257#true} assume true; {3257#true} is VALID [2020-07-29 01:00:43,035 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {3257#true} {3268#(<= main_~i~1 1)} #78#return; {3268#(<= main_~i~1 1)} is VALID [2020-07-29 01:00:43,035 INFO L280 TraceCheckUtils]: 29: Hoare triple {3268#(<= main_~i~1 1)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {3268#(<= main_~i~1 1)} is VALID [2020-07-29 01:00:43,036 INFO L280 TraceCheckUtils]: 30: Hoare triple {3268#(<= main_~i~1 1)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {3268#(<= main_~i~1 1)} is VALID [2020-07-29 01:00:43,036 INFO L280 TraceCheckUtils]: 31: Hoare triple {3268#(<= main_~i~1 1)} havoc #t~ret3; {3268#(<= main_~i~1 1)} is VALID [2020-07-29 01:00:43,037 INFO L280 TraceCheckUtils]: 32: Hoare triple {3268#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3279#(<= main_~i~1 2)} is VALID [2020-07-29 01:00:43,038 INFO L280 TraceCheckUtils]: 33: Hoare triple {3279#(<= main_~i~1 2)} assume !(~i~1 < 32); {3258#false} is VALID [2020-07-29 01:00:43,038 INFO L280 TraceCheckUtils]: 34: Hoare triple {3258#false} ~i~1 := 0; {3258#false} is VALID [2020-07-29 01:00:43,038 INFO L280 TraceCheckUtils]: 35: Hoare triple {3258#false} assume !!(~i~1 < 32); {3258#false} is VALID [2020-07-29 01:00:43,039 INFO L280 TraceCheckUtils]: 36: Hoare triple {3258#false} assume !(4 + (~#b~0.offset + 4 * ~i~1) <= #length[~#b~0.base] && 0 <= ~#b~0.offset + 4 * ~i~1); {3258#false} is VALID [2020-07-29 01:00:43,041 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-29 01:00:43,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:00:43,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2020-07-29 01:00:43,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288274768] [2020-07-29 01:00:43,042 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2020-07-29 01:00:43,042 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:00:43,043 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:00:43,092 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:43,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-29 01:00:43,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:00:43,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 01:00:43,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:00:43,093 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand 7 states. [2020-07-29 01:00:43,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:43,420 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2020-07-29 01:00:43,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:00:43,420 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2020-07-29 01:00:43,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:00:43,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:00:43,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2020-07-29 01:00:43,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:00:43,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2020-07-29 01:00:43,424 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 85 transitions. [2020-07-29 01:00:43,525 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:43,528 INFO L225 Difference]: With dead ends: 95 [2020-07-29 01:00:43,528 INFO L226 Difference]: Without dead ends: 95 [2020-07-29 01:00:43,528 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:00:43,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-07-29 01:00:43,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 74. [2020-07-29 01:00:43,544 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:00:43,545 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 74 states. [2020-07-29 01:00:43,545 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 74 states. [2020-07-29 01:00:43,545 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 74 states. [2020-07-29 01:00:43,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:43,550 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2020-07-29 01:00:43,551 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2020-07-29 01:00:43,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:43,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:43,552 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 95 states. [2020-07-29 01:00:43,552 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 95 states. [2020-07-29 01:00:43,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:43,556 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2020-07-29 01:00:43,556 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2020-07-29 01:00:43,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:43,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:43,557 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:00:43,558 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:00:43,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-07-29 01:00:43,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2020-07-29 01:00:43,561 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 37 [2020-07-29 01:00:43,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:00:43,561 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2020-07-29 01:00:43,562 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-29 01:00:43,562 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2020-07-29 01:00:43,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-29 01:00:43,563 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:00:43,563 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:00:43,778 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:00:43,779 INFO L427 AbstractCegarLoop]: === Iteration 13 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:00:43,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:00:43,779 INFO L82 PathProgramCache]: Analyzing trace with hash -174164318, now seen corresponding path program 2 times [2020-07-29 01:00:43,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:00:43,780 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982850604] [2020-07-29 01:00:43,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:00:43,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:43,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:00:43,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:43,878 INFO L280 TraceCheckUtils]: 0: Hoare triple {3773#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3751#true} is VALID [2020-07-29 01:00:43,878 INFO L280 TraceCheckUtils]: 1: Hoare triple {3751#true} assume true; {3751#true} is VALID [2020-07-29 01:00:43,878 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3751#true} {3751#true} #74#return; {3751#true} is VALID [2020-07-29 01:00:43,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-07-29 01:00:43,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:43,883 INFO L280 TraceCheckUtils]: 0: Hoare triple {3751#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {3751#true} is VALID [2020-07-29 01:00:43,883 INFO L280 TraceCheckUtils]: 1: Hoare triple {3751#true} assume !(~i~0 < ~size); {3751#true} is VALID [2020-07-29 01:00:43,883 INFO L280 TraceCheckUtils]: 2: Hoare triple {3751#true} #res := ~i~0; {3751#true} is VALID [2020-07-29 01:00:43,883 INFO L280 TraceCheckUtils]: 3: Hoare triple {3751#true} assume true; {3751#true} is VALID [2020-07-29 01:00:43,883 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3751#true} {3751#true} #78#return; {3751#true} is VALID [2020-07-29 01:00:43,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-07-29 01:00:43,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:43,890 INFO L280 TraceCheckUtils]: 0: Hoare triple {3751#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {3751#true} is VALID [2020-07-29 01:00:43,890 INFO L280 TraceCheckUtils]: 1: Hoare triple {3751#true} assume !!(~i~0 < ~size); {3751#true} is VALID [2020-07-29 01:00:43,890 INFO L280 TraceCheckUtils]: 2: Hoare triple {3751#true} assume 0 <= ~i~0 && ~i~0 < 32; {3751#true} is VALID [2020-07-29 01:00:43,891 INFO L280 TraceCheckUtils]: 3: Hoare triple {3751#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {3751#true} is VALID [2020-07-29 01:00:43,891 INFO L280 TraceCheckUtils]: 4: Hoare triple {3751#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {3751#true} is VALID [2020-07-29 01:00:43,891 INFO L280 TraceCheckUtils]: 5: Hoare triple {3751#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3751#true} is VALID [2020-07-29 01:00:43,891 INFO L280 TraceCheckUtils]: 6: Hoare triple {3751#true} assume !(~i~0 < ~size); {3751#true} is VALID [2020-07-29 01:00:43,891 INFO L280 TraceCheckUtils]: 7: Hoare triple {3751#true} #res := ~i~0; {3751#true} is VALID [2020-07-29 01:00:43,892 INFO L280 TraceCheckUtils]: 8: Hoare triple {3751#true} assume true; {3751#true} is VALID [2020-07-29 01:00:43,892 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {3751#true} {3751#true} #78#return; {3751#true} is VALID [2020-07-29 01:00:43,893 INFO L263 TraceCheckUtils]: 0: Hoare triple {3751#true} call ULTIMATE.init(); {3773#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:00:43,894 INFO L280 TraceCheckUtils]: 1: Hoare triple {3773#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3751#true} is VALID [2020-07-29 01:00:43,894 INFO L280 TraceCheckUtils]: 2: Hoare triple {3751#true} assume true; {3751#true} is VALID [2020-07-29 01:00:43,894 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3751#true} {3751#true} #74#return; {3751#true} is VALID [2020-07-29 01:00:43,894 INFO L263 TraceCheckUtils]: 4: Hoare triple {3751#true} call #t~ret6 := main(); {3751#true} is VALID [2020-07-29 01:00:43,894 INFO L280 TraceCheckUtils]: 5: Hoare triple {3751#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(128);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {3751#true} is VALID [2020-07-29 01:00:43,894 INFO L280 TraceCheckUtils]: 6: Hoare triple {3751#true} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {3751#true} is VALID [2020-07-29 01:00:43,895 INFO L263 TraceCheckUtils]: 7: Hoare triple {3751#true} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {3751#true} is VALID [2020-07-29 01:00:43,895 INFO L280 TraceCheckUtils]: 8: Hoare triple {3751#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {3751#true} is VALID [2020-07-29 01:00:43,895 INFO L280 TraceCheckUtils]: 9: Hoare triple {3751#true} assume !(~i~0 < ~size); {3751#true} is VALID [2020-07-29 01:00:43,895 INFO L280 TraceCheckUtils]: 10: Hoare triple {3751#true} #res := ~i~0; {3751#true} is VALID [2020-07-29 01:00:43,895 INFO L280 TraceCheckUtils]: 11: Hoare triple {3751#true} assume true; {3751#true} is VALID [2020-07-29 01:00:43,895 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {3751#true} {3751#true} #78#return; {3751#true} is VALID [2020-07-29 01:00:43,896 INFO L280 TraceCheckUtils]: 13: Hoare triple {3751#true} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {3751#true} is VALID [2020-07-29 01:00:43,896 INFO L280 TraceCheckUtils]: 14: Hoare triple {3751#true} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {3751#true} is VALID [2020-07-29 01:00:43,896 INFO L280 TraceCheckUtils]: 15: Hoare triple {3751#true} havoc #t~ret3; {3751#true} is VALID [2020-07-29 01:00:43,896 INFO L280 TraceCheckUtils]: 16: Hoare triple {3751#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3751#true} is VALID [2020-07-29 01:00:43,896 INFO L280 TraceCheckUtils]: 17: Hoare triple {3751#true} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {3751#true} is VALID [2020-07-29 01:00:43,896 INFO L263 TraceCheckUtils]: 18: Hoare triple {3751#true} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {3751#true} is VALID [2020-07-29 01:00:43,896 INFO L280 TraceCheckUtils]: 19: Hoare triple {3751#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {3751#true} is VALID [2020-07-29 01:00:43,897 INFO L280 TraceCheckUtils]: 20: Hoare triple {3751#true} assume !!(~i~0 < ~size); {3751#true} is VALID [2020-07-29 01:00:43,897 INFO L280 TraceCheckUtils]: 21: Hoare triple {3751#true} assume 0 <= ~i~0 && ~i~0 < 32; {3751#true} is VALID [2020-07-29 01:00:43,897 INFO L280 TraceCheckUtils]: 22: Hoare triple {3751#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {3751#true} is VALID [2020-07-29 01:00:43,897 INFO L280 TraceCheckUtils]: 23: Hoare triple {3751#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {3751#true} is VALID [2020-07-29 01:00:43,897 INFO L280 TraceCheckUtils]: 24: Hoare triple {3751#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3751#true} is VALID [2020-07-29 01:00:43,897 INFO L280 TraceCheckUtils]: 25: Hoare triple {3751#true} assume !(~i~0 < ~size); {3751#true} is VALID [2020-07-29 01:00:43,897 INFO L280 TraceCheckUtils]: 26: Hoare triple {3751#true} #res := ~i~0; {3751#true} is VALID [2020-07-29 01:00:43,898 INFO L280 TraceCheckUtils]: 27: Hoare triple {3751#true} assume true; {3751#true} is VALID [2020-07-29 01:00:43,898 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {3751#true} {3751#true} #78#return; {3751#true} is VALID [2020-07-29 01:00:43,898 INFO L280 TraceCheckUtils]: 29: Hoare triple {3751#true} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {3751#true} is VALID [2020-07-29 01:00:43,898 INFO L280 TraceCheckUtils]: 30: Hoare triple {3751#true} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {3751#true} is VALID [2020-07-29 01:00:43,898 INFO L280 TraceCheckUtils]: 31: Hoare triple {3751#true} havoc #t~ret3; {3751#true} is VALID [2020-07-29 01:00:43,898 INFO L280 TraceCheckUtils]: 32: Hoare triple {3751#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3751#true} is VALID [2020-07-29 01:00:43,898 INFO L280 TraceCheckUtils]: 33: Hoare triple {3751#true} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {3751#true} is VALID [2020-07-29 01:00:43,899 INFO L263 TraceCheckUtils]: 34: Hoare triple {3751#true} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {3751#true} is VALID [2020-07-29 01:00:43,899 INFO L280 TraceCheckUtils]: 35: Hoare triple {3751#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {3771#(= 0 foo_~i~0)} is VALID [2020-07-29 01:00:43,900 INFO L280 TraceCheckUtils]: 36: Hoare triple {3771#(= 0 foo_~i~0)} assume !!(~i~0 < ~size); {3771#(= 0 foo_~i~0)} is VALID [2020-07-29 01:00:43,901 INFO L280 TraceCheckUtils]: 37: Hoare triple {3771#(= 0 foo_~i~0)} assume 0 <= ~i~0 && ~i~0 < 32; {3771#(= 0 foo_~i~0)} is VALID [2020-07-29 01:00:43,903 INFO L280 TraceCheckUtils]: 38: Hoare triple {3771#(= 0 foo_~i~0)} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {3771#(= 0 foo_~i~0)} is VALID [2020-07-29 01:00:43,904 INFO L280 TraceCheckUtils]: 39: Hoare triple {3771#(= 0 foo_~i~0)} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {3771#(= 0 foo_~i~0)} is VALID [2020-07-29 01:00:43,905 INFO L280 TraceCheckUtils]: 40: Hoare triple {3771#(= 0 foo_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3772#(and (<= 1 foo_~i~0) (<= foo_~i~0 1))} is VALID [2020-07-29 01:00:43,906 INFO L280 TraceCheckUtils]: 41: Hoare triple {3772#(and (<= 1 foo_~i~0) (<= foo_~i~0 1))} assume !!(~i~0 < ~size); {3772#(and (<= 1 foo_~i~0) (<= foo_~i~0 1))} is VALID [2020-07-29 01:00:43,907 INFO L280 TraceCheckUtils]: 42: Hoare triple {3772#(and (<= 1 foo_~i~0) (<= foo_~i~0 1))} assume !(0 <= ~i~0 && ~i~0 < 32); {3752#false} is VALID [2020-07-29 01:00:43,908 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-07-29 01:00:43,909 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982850604] [2020-07-29 01:00:43,909 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189773687] [2020-07-29 01:00:43,909 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:00:43,955 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 01:00:43,955 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:00:43,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-29 01:00:43,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:43,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:00:44,244 INFO L263 TraceCheckUtils]: 0: Hoare triple {3751#true} call ULTIMATE.init(); {3751#true} is VALID [2020-07-29 01:00:44,245 INFO L280 TraceCheckUtils]: 1: Hoare triple {3751#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3751#true} is VALID [2020-07-29 01:00:44,245 INFO L280 TraceCheckUtils]: 2: Hoare triple {3751#true} assume true; {3751#true} is VALID [2020-07-29 01:00:44,245 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3751#true} {3751#true} #74#return; {3751#true} is VALID [2020-07-29 01:00:44,246 INFO L263 TraceCheckUtils]: 4: Hoare triple {3751#true} call #t~ret6 := main(); {3751#true} is VALID [2020-07-29 01:00:44,247 INFO L280 TraceCheckUtils]: 5: Hoare triple {3751#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(128);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {3792#(<= main_~i~1 0)} is VALID [2020-07-29 01:00:44,247 INFO L280 TraceCheckUtils]: 6: Hoare triple {3792#(<= main_~i~1 0)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {3792#(<= main_~i~1 0)} is VALID [2020-07-29 01:00:44,247 INFO L263 TraceCheckUtils]: 7: Hoare triple {3792#(<= main_~i~1 0)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {3751#true} is VALID [2020-07-29 01:00:44,247 INFO L280 TraceCheckUtils]: 8: Hoare triple {3751#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {3751#true} is VALID [2020-07-29 01:00:44,248 INFO L280 TraceCheckUtils]: 9: Hoare triple {3751#true} assume !(~i~0 < ~size); {3751#true} is VALID [2020-07-29 01:00:44,248 INFO L280 TraceCheckUtils]: 10: Hoare triple {3751#true} #res := ~i~0; {3751#true} is VALID [2020-07-29 01:00:44,248 INFO L280 TraceCheckUtils]: 11: Hoare triple {3751#true} assume true; {3751#true} is VALID [2020-07-29 01:00:44,249 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {3751#true} {3792#(<= main_~i~1 0)} #78#return; {3792#(<= main_~i~1 0)} is VALID [2020-07-29 01:00:44,249 INFO L280 TraceCheckUtils]: 13: Hoare triple {3792#(<= main_~i~1 0)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {3792#(<= main_~i~1 0)} is VALID [2020-07-29 01:00:44,250 INFO L280 TraceCheckUtils]: 14: Hoare triple {3792#(<= main_~i~1 0)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {3792#(<= main_~i~1 0)} is VALID [2020-07-29 01:00:44,250 INFO L280 TraceCheckUtils]: 15: Hoare triple {3792#(<= main_~i~1 0)} havoc #t~ret3; {3792#(<= main_~i~1 0)} is VALID [2020-07-29 01:00:44,251 INFO L280 TraceCheckUtils]: 16: Hoare triple {3792#(<= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3826#(<= main_~i~1 1)} is VALID [2020-07-29 01:00:44,251 INFO L280 TraceCheckUtils]: 17: Hoare triple {3826#(<= main_~i~1 1)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {3826#(<= main_~i~1 1)} is VALID [2020-07-29 01:00:44,251 INFO L263 TraceCheckUtils]: 18: Hoare triple {3826#(<= main_~i~1 1)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {3751#true} is VALID [2020-07-29 01:00:44,251 INFO L280 TraceCheckUtils]: 19: Hoare triple {3751#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {3751#true} is VALID [2020-07-29 01:00:44,251 INFO L280 TraceCheckUtils]: 20: Hoare triple {3751#true} assume !!(~i~0 < ~size); {3751#true} is VALID [2020-07-29 01:00:44,252 INFO L280 TraceCheckUtils]: 21: Hoare triple {3751#true} assume 0 <= ~i~0 && ~i~0 < 32; {3751#true} is VALID [2020-07-29 01:00:44,252 INFO L280 TraceCheckUtils]: 22: Hoare triple {3751#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {3751#true} is VALID [2020-07-29 01:00:44,252 INFO L280 TraceCheckUtils]: 23: Hoare triple {3751#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {3751#true} is VALID [2020-07-29 01:00:44,252 INFO L280 TraceCheckUtils]: 24: Hoare triple {3751#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3751#true} is VALID [2020-07-29 01:00:44,252 INFO L280 TraceCheckUtils]: 25: Hoare triple {3751#true} assume !(~i~0 < ~size); {3751#true} is VALID [2020-07-29 01:00:44,252 INFO L280 TraceCheckUtils]: 26: Hoare triple {3751#true} #res := ~i~0; {3751#true} is VALID [2020-07-29 01:00:44,252 INFO L280 TraceCheckUtils]: 27: Hoare triple {3751#true} assume true; {3751#true} is VALID [2020-07-29 01:00:44,253 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {3751#true} {3826#(<= main_~i~1 1)} #78#return; {3826#(<= main_~i~1 1)} is VALID [2020-07-29 01:00:44,253 INFO L280 TraceCheckUtils]: 29: Hoare triple {3826#(<= main_~i~1 1)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {3826#(<= main_~i~1 1)} is VALID [2020-07-29 01:00:44,254 INFO L280 TraceCheckUtils]: 30: Hoare triple {3826#(<= main_~i~1 1)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {3826#(<= main_~i~1 1)} is VALID [2020-07-29 01:00:44,254 INFO L280 TraceCheckUtils]: 31: Hoare triple {3826#(<= main_~i~1 1)} havoc #t~ret3; {3826#(<= main_~i~1 1)} is VALID [2020-07-29 01:00:44,255 INFO L280 TraceCheckUtils]: 32: Hoare triple {3826#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3875#(<= main_~i~1 2)} is VALID [2020-07-29 01:00:44,255 INFO L280 TraceCheckUtils]: 33: Hoare triple {3875#(<= main_~i~1 2)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {3875#(<= main_~i~1 2)} is VALID [2020-07-29 01:00:44,256 INFO L263 TraceCheckUtils]: 34: Hoare triple {3875#(<= main_~i~1 2)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {3882#(<= |foo_#in~size| 2)} is VALID [2020-07-29 01:00:44,257 INFO L280 TraceCheckUtils]: 35: Hoare triple {3882#(<= |foo_#in~size| 2)} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {3886#(and (<= 0 foo_~i~0) (<= foo_~size 2))} is VALID [2020-07-29 01:00:44,257 INFO L280 TraceCheckUtils]: 36: Hoare triple {3886#(and (<= 0 foo_~i~0) (<= foo_~size 2))} assume !!(~i~0 < ~size); {3886#(and (<= 0 foo_~i~0) (<= foo_~size 2))} is VALID [2020-07-29 01:00:44,257 INFO L280 TraceCheckUtils]: 37: Hoare triple {3886#(and (<= 0 foo_~i~0) (<= foo_~size 2))} assume 0 <= ~i~0 && ~i~0 < 32; {3886#(and (<= 0 foo_~i~0) (<= foo_~size 2))} is VALID [2020-07-29 01:00:44,258 INFO L280 TraceCheckUtils]: 38: Hoare triple {3886#(and (<= 0 foo_~i~0) (<= foo_~size 2))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {3886#(and (<= 0 foo_~i~0) (<= foo_~size 2))} is VALID [2020-07-29 01:00:44,259 INFO L280 TraceCheckUtils]: 39: Hoare triple {3886#(and (<= 0 foo_~i~0) (<= foo_~size 2))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {3886#(and (<= 0 foo_~i~0) (<= foo_~size 2))} is VALID [2020-07-29 01:00:44,259 INFO L280 TraceCheckUtils]: 40: Hoare triple {3886#(and (<= 0 foo_~i~0) (<= foo_~size 2))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3902#(and (<= 1 foo_~i~0) (<= foo_~size 2))} is VALID [2020-07-29 01:00:44,260 INFO L280 TraceCheckUtils]: 41: Hoare triple {3902#(and (<= 1 foo_~i~0) (<= foo_~size 2))} assume !!(~i~0 < ~size); {3772#(and (<= 1 foo_~i~0) (<= foo_~i~0 1))} is VALID [2020-07-29 01:00:44,260 INFO L280 TraceCheckUtils]: 42: Hoare triple {3772#(and (<= 1 foo_~i~0) (<= foo_~i~0 1))} assume !(0 <= ~i~0 && ~i~0 < 32); {3752#false} is VALID [2020-07-29 01:00:44,262 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-29 01:00:44,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:00:44,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8] total 10 [2020-07-29 01:00:44,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290148431] [2020-07-29 01:00:44,263 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2020-07-29 01:00:44,264 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:00:44,264 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-29 01:00:44,328 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:44,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-29 01:00:44,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:00:44,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-29 01:00:44,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-07-29 01:00:44,329 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 11 states. [2020-07-29 01:00:45,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:45,340 INFO L93 Difference]: Finished difference Result 125 states and 131 transitions. [2020-07-29 01:00:45,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-29 01:00:45,340 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2020-07-29 01:00:45,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:00:45,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-29 01:00:45,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 123 transitions. [2020-07-29 01:00:45,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-29 01:00:45,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 123 transitions. [2020-07-29 01:00:45,345 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 123 transitions. [2020-07-29 01:00:45,500 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:45,503 INFO L225 Difference]: With dead ends: 125 [2020-07-29 01:00:45,503 INFO L226 Difference]: Without dead ends: 125 [2020-07-29 01:00:45,504 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-07-29 01:00:45,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-07-29 01:00:45,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 91. [2020-07-29 01:00:45,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:00:45,510 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand 91 states. [2020-07-29 01:00:45,510 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 91 states. [2020-07-29 01:00:45,511 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 91 states. [2020-07-29 01:00:45,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:45,515 INFO L93 Difference]: Finished difference Result 125 states and 131 transitions. [2020-07-29 01:00:45,516 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 131 transitions. [2020-07-29 01:00:45,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:45,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:45,517 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 125 states. [2020-07-29 01:00:45,517 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 125 states. [2020-07-29 01:00:45,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:45,521 INFO L93 Difference]: Finished difference Result 125 states and 131 transitions. [2020-07-29 01:00:45,521 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 131 transitions. [2020-07-29 01:00:45,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:45,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:45,522 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:00:45,522 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:00:45,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-07-29 01:00:45,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2020-07-29 01:00:45,525 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 43 [2020-07-29 01:00:45,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:00:45,526 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2020-07-29 01:00:45,526 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-29 01:00:45,526 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2020-07-29 01:00:45,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-07-29 01:00:45,527 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:00:45,527 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:00:45,741 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-07-29 01:00:45,742 INFO L427 AbstractCegarLoop]: === Iteration 14 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:00:45,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:00:45,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1104126516, now seen corresponding path program 1 times [2020-07-29 01:00:45,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:00:45,744 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725209149] [2020-07-29 01:00:45,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:00:45,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:45,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:00:45,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:45,900 INFO L280 TraceCheckUtils]: 0: Hoare triple {4416#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4390#true} is VALID [2020-07-29 01:00:45,900 INFO L280 TraceCheckUtils]: 1: Hoare triple {4390#true} assume true; {4390#true} is VALID [2020-07-29 01:00:45,901 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4390#true} {4390#true} #74#return; {4390#true} is VALID [2020-07-29 01:00:45,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-07-29 01:00:45,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:45,906 INFO L280 TraceCheckUtils]: 0: Hoare triple {4390#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {4390#true} is VALID [2020-07-29 01:00:45,906 INFO L280 TraceCheckUtils]: 1: Hoare triple {4390#true} assume !(~i~0 < ~size); {4390#true} is VALID [2020-07-29 01:00:45,906 INFO L280 TraceCheckUtils]: 2: Hoare triple {4390#true} #res := ~i~0; {4390#true} is VALID [2020-07-29 01:00:45,907 INFO L280 TraceCheckUtils]: 3: Hoare triple {4390#true} assume true; {4390#true} is VALID [2020-07-29 01:00:45,908 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {4390#true} {4395#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} #78#return; {4395#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:45,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-07-29 01:00:45,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:45,916 INFO L280 TraceCheckUtils]: 0: Hoare triple {4390#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {4390#true} is VALID [2020-07-29 01:00:45,916 INFO L280 TraceCheckUtils]: 1: Hoare triple {4390#true} assume !!(~i~0 < ~size); {4390#true} is VALID [2020-07-29 01:00:45,916 INFO L280 TraceCheckUtils]: 2: Hoare triple {4390#true} assume 0 <= ~i~0 && ~i~0 < 32; {4390#true} is VALID [2020-07-29 01:00:45,916 INFO L280 TraceCheckUtils]: 3: Hoare triple {4390#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {4390#true} is VALID [2020-07-29 01:00:45,917 INFO L280 TraceCheckUtils]: 4: Hoare triple {4390#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {4390#true} is VALID [2020-07-29 01:00:45,917 INFO L280 TraceCheckUtils]: 5: Hoare triple {4390#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4390#true} is VALID [2020-07-29 01:00:45,917 INFO L280 TraceCheckUtils]: 6: Hoare triple {4390#true} assume !(~i~0 < ~size); {4390#true} is VALID [2020-07-29 01:00:45,917 INFO L280 TraceCheckUtils]: 7: Hoare triple {4390#true} #res := ~i~0; {4390#true} is VALID [2020-07-29 01:00:45,917 INFO L280 TraceCheckUtils]: 8: Hoare triple {4390#true} assume true; {4390#true} is VALID [2020-07-29 01:00:45,918 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {4390#true} {4395#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} #78#return; {4395#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:45,919 INFO L263 TraceCheckUtils]: 0: Hoare triple {4390#true} call ULTIMATE.init(); {4416#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:00:45,920 INFO L280 TraceCheckUtils]: 1: Hoare triple {4416#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4390#true} is VALID [2020-07-29 01:00:45,920 INFO L280 TraceCheckUtils]: 2: Hoare triple {4390#true} assume true; {4390#true} is VALID [2020-07-29 01:00:45,920 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4390#true} {4390#true} #74#return; {4390#true} is VALID [2020-07-29 01:00:45,920 INFO L263 TraceCheckUtils]: 4: Hoare triple {4390#true} call #t~ret6 := main(); {4390#true} is VALID [2020-07-29 01:00:45,922 INFO L280 TraceCheckUtils]: 5: Hoare triple {4390#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(128);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {4395#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:45,922 INFO L280 TraceCheckUtils]: 6: Hoare triple {4395#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {4395#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:45,923 INFO L263 TraceCheckUtils]: 7: Hoare triple {4395#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {4390#true} is VALID [2020-07-29 01:00:45,923 INFO L280 TraceCheckUtils]: 8: Hoare triple {4390#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {4390#true} is VALID [2020-07-29 01:00:45,923 INFO L280 TraceCheckUtils]: 9: Hoare triple {4390#true} assume !(~i~0 < ~size); {4390#true} is VALID [2020-07-29 01:00:45,923 INFO L280 TraceCheckUtils]: 10: Hoare triple {4390#true} #res := ~i~0; {4390#true} is VALID [2020-07-29 01:00:45,923 INFO L280 TraceCheckUtils]: 11: Hoare triple {4390#true} assume true; {4390#true} is VALID [2020-07-29 01:00:45,925 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {4390#true} {4395#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} #78#return; {4395#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:45,925 INFO L280 TraceCheckUtils]: 13: Hoare triple {4395#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {4395#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:45,926 INFO L280 TraceCheckUtils]: 14: Hoare triple {4395#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {4395#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:45,927 INFO L280 TraceCheckUtils]: 15: Hoare triple {4395#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} havoc #t~ret3; {4395#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:45,928 INFO L280 TraceCheckUtils]: 16: Hoare triple {4395#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4395#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:45,928 INFO L280 TraceCheckUtils]: 17: Hoare triple {4395#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {4395#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:45,928 INFO L263 TraceCheckUtils]: 18: Hoare triple {4395#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {4390#true} is VALID [2020-07-29 01:00:45,929 INFO L280 TraceCheckUtils]: 19: Hoare triple {4390#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {4390#true} is VALID [2020-07-29 01:00:45,929 INFO L280 TraceCheckUtils]: 20: Hoare triple {4390#true} assume !!(~i~0 < ~size); {4390#true} is VALID [2020-07-29 01:00:45,929 INFO L280 TraceCheckUtils]: 21: Hoare triple {4390#true} assume 0 <= ~i~0 && ~i~0 < 32; {4390#true} is VALID [2020-07-29 01:00:45,929 INFO L280 TraceCheckUtils]: 22: Hoare triple {4390#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {4390#true} is VALID [2020-07-29 01:00:45,929 INFO L280 TraceCheckUtils]: 23: Hoare triple {4390#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {4390#true} is VALID [2020-07-29 01:00:45,930 INFO L280 TraceCheckUtils]: 24: Hoare triple {4390#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4390#true} is VALID [2020-07-29 01:00:45,930 INFO L280 TraceCheckUtils]: 25: Hoare triple {4390#true} assume !(~i~0 < ~size); {4390#true} is VALID [2020-07-29 01:00:45,930 INFO L280 TraceCheckUtils]: 26: Hoare triple {4390#true} #res := ~i~0; {4390#true} is VALID [2020-07-29 01:00:45,930 INFO L280 TraceCheckUtils]: 27: Hoare triple {4390#true} assume true; {4390#true} is VALID [2020-07-29 01:00:45,932 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {4390#true} {4395#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} #78#return; {4395#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:45,932 INFO L280 TraceCheckUtils]: 29: Hoare triple {4395#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {4395#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:45,933 INFO L280 TraceCheckUtils]: 30: Hoare triple {4395#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {4395#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:45,934 INFO L280 TraceCheckUtils]: 31: Hoare triple {4395#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} havoc #t~ret3; {4395#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:45,934 INFO L280 TraceCheckUtils]: 32: Hoare triple {4395#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4395#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:45,935 INFO L280 TraceCheckUtils]: 33: Hoare triple {4395#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {4411#(and (= 32 (select |#length| main_~c~0.base)) (= main_~c~0.offset 0))} is VALID [2020-07-29 01:00:45,937 INFO L263 TraceCheckUtils]: 34: Hoare triple {4411#(and (= 32 (select |#length| main_~c~0.base)) (= main_~c~0.offset 0))} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {4412#(and (= 32 (select |#length| |foo_#in~b.base|)) (= 0 |foo_#in~b.offset|))} is VALID [2020-07-29 01:00:45,938 INFO L280 TraceCheckUtils]: 35: Hoare triple {4412#(and (= 32 (select |#length| |foo_#in~b.base|)) (= 0 |foo_#in~b.offset|))} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {4413#(and (= 32 (select |#length| foo_~b.base)) (= 0 foo_~i~0) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:45,938 INFO L280 TraceCheckUtils]: 36: Hoare triple {4413#(and (= 32 (select |#length| foo_~b.base)) (= 0 foo_~i~0) (= foo_~b.offset 0))} assume !!(~i~0 < ~size); {4413#(and (= 32 (select |#length| foo_~b.base)) (= 0 foo_~i~0) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:45,939 INFO L280 TraceCheckUtils]: 37: Hoare triple {4413#(and (= 32 (select |#length| foo_~b.base)) (= 0 foo_~i~0) (= foo_~b.offset 0))} assume 0 <= ~i~0 && ~i~0 < 32; {4413#(and (= 32 (select |#length| foo_~b.base)) (= 0 foo_~i~0) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:45,940 INFO L280 TraceCheckUtils]: 38: Hoare triple {4413#(and (= 32 (select |#length| foo_~b.base)) (= 0 foo_~i~0) (= foo_~b.offset 0))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {4413#(and (= 32 (select |#length| foo_~b.base)) (= 0 foo_~i~0) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:45,941 INFO L280 TraceCheckUtils]: 39: Hoare triple {4413#(and (= 32 (select |#length| foo_~b.base)) (= 0 foo_~i~0) (= foo_~b.offset 0))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {4413#(and (= 32 (select |#length| foo_~b.base)) (= 0 foo_~i~0) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:45,942 INFO L280 TraceCheckUtils]: 40: Hoare triple {4413#(and (= 32 (select |#length| foo_~b.base)) (= 0 foo_~i~0) (= foo_~b.offset 0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4414#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0) (<= foo_~i~0 1))} is VALID [2020-07-29 01:00:45,943 INFO L280 TraceCheckUtils]: 41: Hoare triple {4414#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0) (<= foo_~i~0 1))} assume !!(~i~0 < ~size); {4414#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0) (<= foo_~i~0 1))} is VALID [2020-07-29 01:00:45,944 INFO L280 TraceCheckUtils]: 42: Hoare triple {4414#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0) (<= foo_~i~0 1))} assume 0 <= ~i~0 && ~i~0 < 32; {4415#(and (<= 0 foo_~i~0) (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0) (<= foo_~i~0 1))} is VALID [2020-07-29 01:00:45,945 INFO L280 TraceCheckUtils]: 43: Hoare triple {4415#(and (<= 0 foo_~i~0) (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0) (<= foo_~i~0 1))} assume !(1 + (~b.offset + ~i~0) <= #length[~b.base] && 0 <= ~b.offset + ~i~0); {4391#false} is VALID [2020-07-29 01:00:45,950 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-07-29 01:00:45,950 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725209149] [2020-07-29 01:00:45,951 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163974934] [2020-07-29 01:00:45,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:00:46,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:46,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 26 conjunts are in the unsatisfiable core [2020-07-29 01:00:46,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:46,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:00:46,051 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:00:46,052 INFO L384 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 1 case distinctions, treesize of input 9 treesize of output 25 [2020-07-29 01:00:46,052 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:00:46,073 INFO L624 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2020-07-29 01:00:46,075 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:00:46,076 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2020-07-29 01:00:46,079 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:00:46,079 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_14|, |main_~#b~0.base|]. (and (= (store (store |v_#length_14| |main_~#b~0.base| 128) |main_~#mask~0.base| 32) |#length|) (= 0 |main_~#mask~0.offset|)) [2020-07-29 01:00:46,080 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)) [2020-07-29 01:00:46,330 INFO L263 TraceCheckUtils]: 0: Hoare triple {4390#true} call ULTIMATE.init(); {4390#true} is VALID [2020-07-29 01:00:46,330 INFO L280 TraceCheckUtils]: 1: Hoare triple {4390#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4390#true} is VALID [2020-07-29 01:00:46,330 INFO L280 TraceCheckUtils]: 2: Hoare triple {4390#true} assume true; {4390#true} is VALID [2020-07-29 01:00:46,331 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4390#true} {4390#true} #74#return; {4390#true} is VALID [2020-07-29 01:00:46,331 INFO L263 TraceCheckUtils]: 4: Hoare triple {4390#true} call #t~ret6 := main(); {4390#true} is VALID [2020-07-29 01:00:46,332 INFO L280 TraceCheckUtils]: 5: Hoare triple {4390#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(128);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {4395#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:46,333 INFO L280 TraceCheckUtils]: 6: Hoare triple {4395#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {4395#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:46,335 INFO L263 TraceCheckUtils]: 7: Hoare triple {4395#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {4441#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_4| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_4|)))} is VALID [2020-07-29 01:00:46,336 INFO L280 TraceCheckUtils]: 8: Hoare triple {4441#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_4| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_4|)))} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {4441#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_4| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_4|)))} is VALID [2020-07-29 01:00:46,337 INFO L280 TraceCheckUtils]: 9: Hoare triple {4441#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_4| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_4|)))} assume !(~i~0 < ~size); {4441#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_4| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_4|)))} is VALID [2020-07-29 01:00:46,338 INFO L280 TraceCheckUtils]: 10: Hoare triple {4441#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_4| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_4|)))} #res := ~i~0; {4441#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_4| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_4|)))} is VALID [2020-07-29 01:00:46,338 INFO L280 TraceCheckUtils]: 11: Hoare triple {4441#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_4| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_4|)))} assume true; {4441#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_4| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_4|)))} is VALID [2020-07-29 01:00:46,340 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {4441#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_4| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_4|)))} {4395#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} #78#return; {4395#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:46,341 INFO L280 TraceCheckUtils]: 13: Hoare triple {4395#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {4395#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:46,342 INFO L280 TraceCheckUtils]: 14: Hoare triple {4395#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {4395#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:46,343 INFO L280 TraceCheckUtils]: 15: Hoare triple {4395#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} havoc #t~ret3; {4395#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:46,343 INFO L280 TraceCheckUtils]: 16: Hoare triple {4395#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4395#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:46,344 INFO L280 TraceCheckUtils]: 17: Hoare triple {4395#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {4472#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|) (= main_~c~0.base |main_~#mask~0.base|))} is VALID [2020-07-29 01:00:46,346 INFO L263 TraceCheckUtils]: 18: Hoare triple {4472#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|) (= main_~c~0.base |main_~#mask~0.base|))} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {4441#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_4| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_4|)))} is VALID [2020-07-29 01:00:46,346 INFO L280 TraceCheckUtils]: 19: Hoare triple {4441#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_4| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_4|)))} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {4441#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_4| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_4|)))} is VALID [2020-07-29 01:00:46,347 INFO L280 TraceCheckUtils]: 20: Hoare triple {4441#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_4| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_4|)))} assume !!(~i~0 < ~size); {4441#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_4| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_4|)))} is VALID [2020-07-29 01:00:46,348 INFO L280 TraceCheckUtils]: 21: Hoare triple {4441#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_4| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_4|)))} assume 0 <= ~i~0 && ~i~0 < 32; {4441#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_4| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_4|)))} is VALID [2020-07-29 01:00:46,348 INFO L280 TraceCheckUtils]: 22: Hoare triple {4441#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_4| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_4|)))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {4441#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_4| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_4|)))} is VALID [2020-07-29 01:00:46,349 INFO L280 TraceCheckUtils]: 23: Hoare triple {4441#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_4| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_4|)))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {4441#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_4| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_4|)))} is VALID [2020-07-29 01:00:46,349 INFO L280 TraceCheckUtils]: 24: Hoare triple {4441#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_4| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_4|)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4441#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_4| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_4|)))} is VALID [2020-07-29 01:00:46,350 INFO L280 TraceCheckUtils]: 25: Hoare triple {4441#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_4| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_4|)))} assume !(~i~0 < ~size); {4441#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_4| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_4|)))} is VALID [2020-07-29 01:00:46,351 INFO L280 TraceCheckUtils]: 26: Hoare triple {4441#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_4| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_4|)))} #res := ~i~0; {4441#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_4| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_4|)))} is VALID [2020-07-29 01:00:46,351 INFO L280 TraceCheckUtils]: 27: Hoare triple {4441#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_4| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_4|)))} assume true; {4441#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_4| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_4|)))} is VALID [2020-07-29 01:00:46,353 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {4441#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_4| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_4|)))} {4472#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|) (= main_~c~0.base |main_~#mask~0.base|))} #78#return; {4395#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:46,354 INFO L280 TraceCheckUtils]: 29: Hoare triple {4395#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {4395#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:46,355 INFO L280 TraceCheckUtils]: 30: Hoare triple {4395#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {4395#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:46,356 INFO L280 TraceCheckUtils]: 31: Hoare triple {4395#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} havoc #t~ret3; {4395#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:46,357 INFO L280 TraceCheckUtils]: 32: Hoare triple {4395#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4395#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:46,357 INFO L280 TraceCheckUtils]: 33: Hoare triple {4395#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {4411#(and (= 32 (select |#length| main_~c~0.base)) (= main_~c~0.offset 0))} is VALID [2020-07-29 01:00:46,359 INFO L263 TraceCheckUtils]: 34: Hoare triple {4411#(and (= 32 (select |#length| main_~c~0.base)) (= main_~c~0.offset 0))} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {4412#(and (= 32 (select |#length| |foo_#in~b.base|)) (= 0 |foo_#in~b.offset|))} is VALID [2020-07-29 01:00:46,360 INFO L280 TraceCheckUtils]: 35: Hoare triple {4412#(and (= 32 (select |#length| |foo_#in~b.base|)) (= 0 |foo_#in~b.offset|))} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {4413#(and (= 32 (select |#length| foo_~b.base)) (= 0 foo_~i~0) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:46,360 INFO L280 TraceCheckUtils]: 36: Hoare triple {4413#(and (= 32 (select |#length| foo_~b.base)) (= 0 foo_~i~0) (= foo_~b.offset 0))} assume !!(~i~0 < ~size); {4413#(and (= 32 (select |#length| foo_~b.base)) (= 0 foo_~i~0) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:46,361 INFO L280 TraceCheckUtils]: 37: Hoare triple {4413#(and (= 32 (select |#length| foo_~b.base)) (= 0 foo_~i~0) (= foo_~b.offset 0))} assume 0 <= ~i~0 && ~i~0 < 32; {4413#(and (= 32 (select |#length| foo_~b.base)) (= 0 foo_~i~0) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:46,362 INFO L280 TraceCheckUtils]: 38: Hoare triple {4413#(and (= 32 (select |#length| foo_~b.base)) (= 0 foo_~i~0) (= foo_~b.offset 0))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {4413#(and (= 32 (select |#length| foo_~b.base)) (= 0 foo_~i~0) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:46,363 INFO L280 TraceCheckUtils]: 39: Hoare triple {4413#(and (= 32 (select |#length| foo_~b.base)) (= 0 foo_~i~0) (= foo_~b.offset 0))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {4413#(and (= 32 (select |#length| foo_~b.base)) (= 0 foo_~i~0) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:46,363 INFO L280 TraceCheckUtils]: 40: Hoare triple {4413#(and (= 32 (select |#length| foo_~b.base)) (= 0 foo_~i~0) (= foo_~b.offset 0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4542#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0) (= 1 foo_~i~0))} is VALID [2020-07-29 01:00:46,364 INFO L280 TraceCheckUtils]: 41: Hoare triple {4542#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0) (= 1 foo_~i~0))} assume !!(~i~0 < ~size); {4542#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0) (= 1 foo_~i~0))} is VALID [2020-07-29 01:00:46,365 INFO L280 TraceCheckUtils]: 42: Hoare triple {4542#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0) (= 1 foo_~i~0))} assume 0 <= ~i~0 && ~i~0 < 32; {4542#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0) (= 1 foo_~i~0))} is VALID [2020-07-29 01:00:46,365 INFO L280 TraceCheckUtils]: 43: Hoare triple {4542#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0) (= 1 foo_~i~0))} assume !(1 + (~b.offset + ~i~0) <= #length[~b.base] && 0 <= ~b.offset + ~i~0); {4391#false} is VALID [2020-07-29 01:00:46,370 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-07-29 01:00:46,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:00:46,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2020-07-29 01:00:46,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138607252] [2020-07-29 01:00:46,371 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 44 [2020-07-29 01:00:46,372 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:00:46,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-29 01:00:46,444 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:46,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-29 01:00:46,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:00:46,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-29 01:00:46,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-07-29 01:00:46,445 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand 12 states. [2020-07-29 01:00:47,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:47,213 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2020-07-29 01:00:47,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 01:00:47,214 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 44 [2020-07-29 01:00:47,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:00:47,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 01:00:47,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 57 transitions. [2020-07-29 01:00:47,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 01:00:47,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 57 transitions. [2020-07-29 01:00:47,217 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 57 transitions. [2020-07-29 01:00:47,315 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:47,317 INFO L225 Difference]: With dead ends: 107 [2020-07-29 01:00:47,317 INFO L226 Difference]: Without dead ends: 107 [2020-07-29 01:00:47,318 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2020-07-29 01:00:47,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-07-29 01:00:47,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 97. [2020-07-29 01:00:47,322 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:00:47,322 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand 97 states. [2020-07-29 01:00:47,322 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 97 states. [2020-07-29 01:00:47,322 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 97 states. [2020-07-29 01:00:47,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:47,325 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2020-07-29 01:00:47,326 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2020-07-29 01:00:47,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:47,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:47,326 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 107 states. [2020-07-29 01:00:47,326 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 107 states. [2020-07-29 01:00:47,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:47,329 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2020-07-29 01:00:47,329 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2020-07-29 01:00:47,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:47,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:47,330 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:00:47,330 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:00:47,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-07-29 01:00:47,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2020-07-29 01:00:47,333 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 44 [2020-07-29 01:00:47,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:00:47,333 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2020-07-29 01:00:47,333 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-29 01:00:47,333 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2020-07-29 01:00:47,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-07-29 01:00:47,334 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:00:47,334 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:00:47,547 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:00:47,548 INFO L427 AbstractCegarLoop]: === Iteration 15 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:00:47,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:00:47,548 INFO L82 PathProgramCache]: Analyzing trace with hash 2073773289, now seen corresponding path program 2 times [2020-07-29 01:00:47,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:00:47,549 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328142953] [2020-07-29 01:00:47,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:00:47,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:47,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:00:47,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:47,618 INFO L280 TraceCheckUtils]: 0: Hoare triple {5011#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4978#true} is VALID [2020-07-29 01:00:47,618 INFO L280 TraceCheckUtils]: 1: Hoare triple {4978#true} assume true; {4978#true} is VALID [2020-07-29 01:00:47,618 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4978#true} {4978#true} #74#return; {4978#true} is VALID [2020-07-29 01:00:47,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-07-29 01:00:47,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:47,623 INFO L280 TraceCheckUtils]: 0: Hoare triple {4978#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {4978#true} is VALID [2020-07-29 01:00:47,623 INFO L280 TraceCheckUtils]: 1: Hoare triple {4978#true} assume !(~i~0 < ~size); {4978#true} is VALID [2020-07-29 01:00:47,624 INFO L280 TraceCheckUtils]: 2: Hoare triple {4978#true} #res := ~i~0; {4978#true} is VALID [2020-07-29 01:00:47,624 INFO L280 TraceCheckUtils]: 3: Hoare triple {4978#true} assume true; {4978#true} is VALID [2020-07-29 01:00:47,625 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {4978#true} {4983#(= 0 main_~i~1)} #78#return; {4983#(= 0 main_~i~1)} is VALID [2020-07-29 01:00:47,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-07-29 01:00:47,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:47,633 INFO L280 TraceCheckUtils]: 0: Hoare triple {4978#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {4978#true} is VALID [2020-07-29 01:00:47,633 INFO L280 TraceCheckUtils]: 1: Hoare triple {4978#true} assume !!(~i~0 < ~size); {4978#true} is VALID [2020-07-29 01:00:47,633 INFO L280 TraceCheckUtils]: 2: Hoare triple {4978#true} assume 0 <= ~i~0 && ~i~0 < 32; {4978#true} is VALID [2020-07-29 01:00:47,634 INFO L280 TraceCheckUtils]: 3: Hoare triple {4978#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {4978#true} is VALID [2020-07-29 01:00:47,634 INFO L280 TraceCheckUtils]: 4: Hoare triple {4978#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {4978#true} is VALID [2020-07-29 01:00:47,634 INFO L280 TraceCheckUtils]: 5: Hoare triple {4978#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4978#true} is VALID [2020-07-29 01:00:47,634 INFO L280 TraceCheckUtils]: 6: Hoare triple {4978#true} assume !(~i~0 < ~size); {4978#true} is VALID [2020-07-29 01:00:47,635 INFO L280 TraceCheckUtils]: 7: Hoare triple {4978#true} #res := ~i~0; {4978#true} is VALID [2020-07-29 01:00:47,635 INFO L280 TraceCheckUtils]: 8: Hoare triple {4978#true} assume true; {4978#true} is VALID [2020-07-29 01:00:47,636 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {4978#true} {4989#(<= 1 main_~i~1)} #78#return; {4989#(<= 1 main_~i~1)} is VALID [2020-07-29 01:00:47,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-07-29 01:00:47,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:47,688 INFO L280 TraceCheckUtils]: 0: Hoare triple {4978#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {5012#(and (<= foo_~i~0 0) (= foo_~size |foo_#in~size|))} is VALID [2020-07-29 01:00:47,689 INFO L280 TraceCheckUtils]: 1: Hoare triple {5012#(and (<= foo_~i~0 0) (= foo_~size |foo_#in~size|))} assume !!(~i~0 < ~size); {5012#(and (<= foo_~i~0 0) (= foo_~size |foo_#in~size|))} is VALID [2020-07-29 01:00:47,690 INFO L280 TraceCheckUtils]: 2: Hoare triple {5012#(and (<= foo_~i~0 0) (= foo_~size |foo_#in~size|))} assume 0 <= ~i~0 && ~i~0 < 32; {5012#(and (<= foo_~i~0 0) (= foo_~size |foo_#in~size|))} is VALID [2020-07-29 01:00:47,691 INFO L280 TraceCheckUtils]: 3: Hoare triple {5012#(and (<= foo_~i~0 0) (= foo_~size |foo_#in~size|))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5012#(and (<= foo_~i~0 0) (= foo_~size |foo_#in~size|))} is VALID [2020-07-29 01:00:47,692 INFO L280 TraceCheckUtils]: 4: Hoare triple {5012#(and (<= foo_~i~0 0) (= foo_~size |foo_#in~size|))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5012#(and (<= foo_~i~0 0) (= foo_~size |foo_#in~size|))} is VALID [2020-07-29 01:00:47,693 INFO L280 TraceCheckUtils]: 5: Hoare triple {5012#(and (<= foo_~i~0 0) (= foo_~size |foo_#in~size|))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5013#(and (= foo_~size |foo_#in~size|) (<= foo_~i~0 1))} is VALID [2020-07-29 01:00:47,694 INFO L280 TraceCheckUtils]: 6: Hoare triple {5013#(and (= foo_~size |foo_#in~size|) (<= foo_~i~0 1))} assume !(~i~0 < ~size); {5014#(<= |foo_#in~size| 1)} is VALID [2020-07-29 01:00:47,694 INFO L280 TraceCheckUtils]: 7: Hoare triple {5014#(<= |foo_#in~size| 1)} #res := ~i~0; {5014#(<= |foo_#in~size| 1)} is VALID [2020-07-29 01:00:47,695 INFO L280 TraceCheckUtils]: 8: Hoare triple {5014#(<= |foo_#in~size| 1)} assume true; {5014#(<= |foo_#in~size| 1)} is VALID [2020-07-29 01:00:47,697 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {5014#(<= |foo_#in~size| 1)} {5000#(<= 2 main_~i~1)} #78#return; {4979#false} is VALID [2020-07-29 01:00:47,698 INFO L263 TraceCheckUtils]: 0: Hoare triple {4978#true} call ULTIMATE.init(); {5011#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:00:47,698 INFO L280 TraceCheckUtils]: 1: Hoare triple {5011#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4978#true} is VALID [2020-07-29 01:00:47,698 INFO L280 TraceCheckUtils]: 2: Hoare triple {4978#true} assume true; {4978#true} is VALID [2020-07-29 01:00:47,699 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4978#true} {4978#true} #74#return; {4978#true} is VALID [2020-07-29 01:00:47,699 INFO L263 TraceCheckUtils]: 4: Hoare triple {4978#true} call #t~ret6 := main(); {4978#true} is VALID [2020-07-29 01:00:47,700 INFO L280 TraceCheckUtils]: 5: Hoare triple {4978#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(128);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {4983#(= 0 main_~i~1)} is VALID [2020-07-29 01:00:47,701 INFO L280 TraceCheckUtils]: 6: Hoare triple {4983#(= 0 main_~i~1)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {4983#(= 0 main_~i~1)} is VALID [2020-07-29 01:00:47,701 INFO L263 TraceCheckUtils]: 7: Hoare triple {4983#(= 0 main_~i~1)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {4978#true} is VALID [2020-07-29 01:00:47,701 INFO L280 TraceCheckUtils]: 8: Hoare triple {4978#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {4978#true} is VALID [2020-07-29 01:00:47,701 INFO L280 TraceCheckUtils]: 9: Hoare triple {4978#true} assume !(~i~0 < ~size); {4978#true} is VALID [2020-07-29 01:00:47,701 INFO L280 TraceCheckUtils]: 10: Hoare triple {4978#true} #res := ~i~0; {4978#true} is VALID [2020-07-29 01:00:47,702 INFO L280 TraceCheckUtils]: 11: Hoare triple {4978#true} assume true; {4978#true} is VALID [2020-07-29 01:00:47,704 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {4978#true} {4983#(= 0 main_~i~1)} #78#return; {4983#(= 0 main_~i~1)} is VALID [2020-07-29 01:00:47,705 INFO L280 TraceCheckUtils]: 13: Hoare triple {4983#(= 0 main_~i~1)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {4983#(= 0 main_~i~1)} is VALID [2020-07-29 01:00:47,706 INFO L280 TraceCheckUtils]: 14: Hoare triple {4983#(= 0 main_~i~1)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {4983#(= 0 main_~i~1)} is VALID [2020-07-29 01:00:47,706 INFO L280 TraceCheckUtils]: 15: Hoare triple {4983#(= 0 main_~i~1)} havoc #t~ret3; {4983#(= 0 main_~i~1)} is VALID [2020-07-29 01:00:47,707 INFO L280 TraceCheckUtils]: 16: Hoare triple {4983#(= 0 main_~i~1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4989#(<= 1 main_~i~1)} is VALID [2020-07-29 01:00:47,708 INFO L280 TraceCheckUtils]: 17: Hoare triple {4989#(<= 1 main_~i~1)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {4989#(<= 1 main_~i~1)} is VALID [2020-07-29 01:00:47,708 INFO L263 TraceCheckUtils]: 18: Hoare triple {4989#(<= 1 main_~i~1)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {4978#true} is VALID [2020-07-29 01:00:47,708 INFO L280 TraceCheckUtils]: 19: Hoare triple {4978#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {4978#true} is VALID [2020-07-29 01:00:47,709 INFO L280 TraceCheckUtils]: 20: Hoare triple {4978#true} assume !!(~i~0 < ~size); {4978#true} is VALID [2020-07-29 01:00:47,709 INFO L280 TraceCheckUtils]: 21: Hoare triple {4978#true} assume 0 <= ~i~0 && ~i~0 < 32; {4978#true} is VALID [2020-07-29 01:00:47,709 INFO L280 TraceCheckUtils]: 22: Hoare triple {4978#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {4978#true} is VALID [2020-07-29 01:00:47,709 INFO L280 TraceCheckUtils]: 23: Hoare triple {4978#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {4978#true} is VALID [2020-07-29 01:00:47,709 INFO L280 TraceCheckUtils]: 24: Hoare triple {4978#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4978#true} is VALID [2020-07-29 01:00:47,710 INFO L280 TraceCheckUtils]: 25: Hoare triple {4978#true} assume !(~i~0 < ~size); {4978#true} is VALID [2020-07-29 01:00:47,710 INFO L280 TraceCheckUtils]: 26: Hoare triple {4978#true} #res := ~i~0; {4978#true} is VALID [2020-07-29 01:00:47,710 INFO L280 TraceCheckUtils]: 27: Hoare triple {4978#true} assume true; {4978#true} is VALID [2020-07-29 01:00:47,712 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {4978#true} {4989#(<= 1 main_~i~1)} #78#return; {4989#(<= 1 main_~i~1)} is VALID [2020-07-29 01:00:47,713 INFO L280 TraceCheckUtils]: 29: Hoare triple {4989#(<= 1 main_~i~1)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {4989#(<= 1 main_~i~1)} is VALID [2020-07-29 01:00:47,713 INFO L280 TraceCheckUtils]: 30: Hoare triple {4989#(<= 1 main_~i~1)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {4989#(<= 1 main_~i~1)} is VALID [2020-07-29 01:00:47,714 INFO L280 TraceCheckUtils]: 31: Hoare triple {4989#(<= 1 main_~i~1)} havoc #t~ret3; {4989#(<= 1 main_~i~1)} is VALID [2020-07-29 01:00:47,715 INFO L280 TraceCheckUtils]: 32: Hoare triple {4989#(<= 1 main_~i~1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5000#(<= 2 main_~i~1)} is VALID [2020-07-29 01:00:47,715 INFO L280 TraceCheckUtils]: 33: Hoare triple {5000#(<= 2 main_~i~1)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {5000#(<= 2 main_~i~1)} is VALID [2020-07-29 01:00:47,716 INFO L263 TraceCheckUtils]: 34: Hoare triple {5000#(<= 2 main_~i~1)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {4978#true} is VALID [2020-07-29 01:00:47,716 INFO L280 TraceCheckUtils]: 35: Hoare triple {4978#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {5012#(and (<= foo_~i~0 0) (= foo_~size |foo_#in~size|))} is VALID [2020-07-29 01:00:47,717 INFO L280 TraceCheckUtils]: 36: Hoare triple {5012#(and (<= foo_~i~0 0) (= foo_~size |foo_#in~size|))} assume !!(~i~0 < ~size); {5012#(and (<= foo_~i~0 0) (= foo_~size |foo_#in~size|))} is VALID [2020-07-29 01:00:47,718 INFO L280 TraceCheckUtils]: 37: Hoare triple {5012#(and (<= foo_~i~0 0) (= foo_~size |foo_#in~size|))} assume 0 <= ~i~0 && ~i~0 < 32; {5012#(and (<= foo_~i~0 0) (= foo_~size |foo_#in~size|))} is VALID [2020-07-29 01:00:47,719 INFO L280 TraceCheckUtils]: 38: Hoare triple {5012#(and (<= foo_~i~0 0) (= foo_~size |foo_#in~size|))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5012#(and (<= foo_~i~0 0) (= foo_~size |foo_#in~size|))} is VALID [2020-07-29 01:00:47,719 INFO L280 TraceCheckUtils]: 39: Hoare triple {5012#(and (<= foo_~i~0 0) (= foo_~size |foo_#in~size|))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5012#(and (<= foo_~i~0 0) (= foo_~size |foo_#in~size|))} is VALID [2020-07-29 01:00:47,720 INFO L280 TraceCheckUtils]: 40: Hoare triple {5012#(and (<= foo_~i~0 0) (= foo_~size |foo_#in~size|))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5013#(and (= foo_~size |foo_#in~size|) (<= foo_~i~0 1))} is VALID [2020-07-29 01:00:47,721 INFO L280 TraceCheckUtils]: 41: Hoare triple {5013#(and (= foo_~size |foo_#in~size|) (<= foo_~i~0 1))} assume !(~i~0 < ~size); {5014#(<= |foo_#in~size| 1)} is VALID [2020-07-29 01:00:47,722 INFO L280 TraceCheckUtils]: 42: Hoare triple {5014#(<= |foo_#in~size| 1)} #res := ~i~0; {5014#(<= |foo_#in~size| 1)} is VALID [2020-07-29 01:00:47,722 INFO L280 TraceCheckUtils]: 43: Hoare triple {5014#(<= |foo_#in~size| 1)} assume true; {5014#(<= |foo_#in~size| 1)} is VALID [2020-07-29 01:00:47,724 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {5014#(<= |foo_#in~size| 1)} {5000#(<= 2 main_~i~1)} #78#return; {4979#false} is VALID [2020-07-29 01:00:47,724 INFO L280 TraceCheckUtils]: 45: Hoare triple {4979#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {4979#false} is VALID [2020-07-29 01:00:47,724 INFO L280 TraceCheckUtils]: 46: Hoare triple {4979#false} assume !(4 + (~#b~0.offset + 4 * ~i~1) <= #length[~#b~0.base] && 0 <= ~#b~0.offset + 4 * ~i~1); {4979#false} is VALID [2020-07-29 01:00:47,728 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-07-29 01:00:47,728 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328142953] [2020-07-29 01:00:47,728 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337717957] [2020-07-29 01:00:47,728 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:00:47,788 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 01:00:47,788 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:00:47,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:00:47,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:47,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:00:48,044 INFO L263 TraceCheckUtils]: 0: Hoare triple {4978#true} call ULTIMATE.init(); {4978#true} is VALID [2020-07-29 01:00:48,044 INFO L280 TraceCheckUtils]: 1: Hoare triple {4978#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4978#true} is VALID [2020-07-29 01:00:48,044 INFO L280 TraceCheckUtils]: 2: Hoare triple {4978#true} assume true; {4978#true} is VALID [2020-07-29 01:00:48,044 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4978#true} {4978#true} #74#return; {4978#true} is VALID [2020-07-29 01:00:48,045 INFO L263 TraceCheckUtils]: 4: Hoare triple {4978#true} call #t~ret6 := main(); {4978#true} is VALID [2020-07-29 01:00:48,046 INFO L280 TraceCheckUtils]: 5: Hoare triple {4978#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(128);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {5033#(<= 0 main_~i~1)} is VALID [2020-07-29 01:00:48,046 INFO L280 TraceCheckUtils]: 6: Hoare triple {5033#(<= 0 main_~i~1)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {5033#(<= 0 main_~i~1)} is VALID [2020-07-29 01:00:48,046 INFO L263 TraceCheckUtils]: 7: Hoare triple {5033#(<= 0 main_~i~1)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {4978#true} is VALID [2020-07-29 01:00:48,047 INFO L280 TraceCheckUtils]: 8: Hoare triple {4978#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {4978#true} is VALID [2020-07-29 01:00:48,047 INFO L280 TraceCheckUtils]: 9: Hoare triple {4978#true} assume !(~i~0 < ~size); {4978#true} is VALID [2020-07-29 01:00:48,047 INFO L280 TraceCheckUtils]: 10: Hoare triple {4978#true} #res := ~i~0; {4978#true} is VALID [2020-07-29 01:00:48,047 INFO L280 TraceCheckUtils]: 11: Hoare triple {4978#true} assume true; {4978#true} is VALID [2020-07-29 01:00:48,048 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {4978#true} {5033#(<= 0 main_~i~1)} #78#return; {5033#(<= 0 main_~i~1)} is VALID [2020-07-29 01:00:48,048 INFO L280 TraceCheckUtils]: 13: Hoare triple {5033#(<= 0 main_~i~1)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {5033#(<= 0 main_~i~1)} is VALID [2020-07-29 01:00:48,048 INFO L280 TraceCheckUtils]: 14: Hoare triple {5033#(<= 0 main_~i~1)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {5033#(<= 0 main_~i~1)} is VALID [2020-07-29 01:00:48,049 INFO L280 TraceCheckUtils]: 15: Hoare triple {5033#(<= 0 main_~i~1)} havoc #t~ret3; {5033#(<= 0 main_~i~1)} is VALID [2020-07-29 01:00:48,049 INFO L280 TraceCheckUtils]: 16: Hoare triple {5033#(<= 0 main_~i~1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4989#(<= 1 main_~i~1)} is VALID [2020-07-29 01:00:48,050 INFO L280 TraceCheckUtils]: 17: Hoare triple {4989#(<= 1 main_~i~1)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {4989#(<= 1 main_~i~1)} is VALID [2020-07-29 01:00:48,050 INFO L263 TraceCheckUtils]: 18: Hoare triple {4989#(<= 1 main_~i~1)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {4978#true} is VALID [2020-07-29 01:00:48,050 INFO L280 TraceCheckUtils]: 19: Hoare triple {4978#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {4978#true} is VALID [2020-07-29 01:00:48,050 INFO L280 TraceCheckUtils]: 20: Hoare triple {4978#true} assume !!(~i~0 < ~size); {4978#true} is VALID [2020-07-29 01:00:48,051 INFO L280 TraceCheckUtils]: 21: Hoare triple {4978#true} assume 0 <= ~i~0 && ~i~0 < 32; {4978#true} is VALID [2020-07-29 01:00:48,051 INFO L280 TraceCheckUtils]: 22: Hoare triple {4978#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {4978#true} is VALID [2020-07-29 01:00:48,051 INFO L280 TraceCheckUtils]: 23: Hoare triple {4978#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {4978#true} is VALID [2020-07-29 01:00:48,051 INFO L280 TraceCheckUtils]: 24: Hoare triple {4978#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4978#true} is VALID [2020-07-29 01:00:48,051 INFO L280 TraceCheckUtils]: 25: Hoare triple {4978#true} assume !(~i~0 < ~size); {4978#true} is VALID [2020-07-29 01:00:48,051 INFO L280 TraceCheckUtils]: 26: Hoare triple {4978#true} #res := ~i~0; {4978#true} is VALID [2020-07-29 01:00:48,052 INFO L280 TraceCheckUtils]: 27: Hoare triple {4978#true} assume true; {4978#true} is VALID [2020-07-29 01:00:48,052 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {4978#true} {4989#(<= 1 main_~i~1)} #78#return; {4989#(<= 1 main_~i~1)} is VALID [2020-07-29 01:00:48,053 INFO L280 TraceCheckUtils]: 29: Hoare triple {4989#(<= 1 main_~i~1)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {4989#(<= 1 main_~i~1)} is VALID [2020-07-29 01:00:48,053 INFO L280 TraceCheckUtils]: 30: Hoare triple {4989#(<= 1 main_~i~1)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {4989#(<= 1 main_~i~1)} is VALID [2020-07-29 01:00:48,053 INFO L280 TraceCheckUtils]: 31: Hoare triple {4989#(<= 1 main_~i~1)} havoc #t~ret3; {4989#(<= 1 main_~i~1)} is VALID [2020-07-29 01:00:48,054 INFO L280 TraceCheckUtils]: 32: Hoare triple {4989#(<= 1 main_~i~1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5000#(<= 2 main_~i~1)} is VALID [2020-07-29 01:00:48,054 INFO L280 TraceCheckUtils]: 33: Hoare triple {5000#(<= 2 main_~i~1)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {5000#(<= 2 main_~i~1)} is VALID [2020-07-29 01:00:48,055 INFO L263 TraceCheckUtils]: 34: Hoare triple {5000#(<= 2 main_~i~1)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {4978#true} is VALID [2020-07-29 01:00:48,055 INFO L280 TraceCheckUtils]: 35: Hoare triple {4978#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {5124#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:00:48,056 INFO L280 TraceCheckUtils]: 36: Hoare triple {5124#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} assume !!(~i~0 < ~size); {5124#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:00:48,056 INFO L280 TraceCheckUtils]: 37: Hoare triple {5124#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} assume 0 <= ~i~0 && ~i~0 < 32; {5124#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:00:48,057 INFO L280 TraceCheckUtils]: 38: Hoare triple {5124#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5124#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:00:48,057 INFO L280 TraceCheckUtils]: 39: Hoare triple {5124#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5124#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:00:48,058 INFO L280 TraceCheckUtils]: 40: Hoare triple {5124#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5140#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} is VALID [2020-07-29 01:00:48,058 INFO L280 TraceCheckUtils]: 41: Hoare triple {5140#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} assume !(~i~0 < ~size); {5014#(<= |foo_#in~size| 1)} is VALID [2020-07-29 01:00:48,059 INFO L280 TraceCheckUtils]: 42: Hoare triple {5014#(<= |foo_#in~size| 1)} #res := ~i~0; {5014#(<= |foo_#in~size| 1)} is VALID [2020-07-29 01:00:48,059 INFO L280 TraceCheckUtils]: 43: Hoare triple {5014#(<= |foo_#in~size| 1)} assume true; {5014#(<= |foo_#in~size| 1)} is VALID [2020-07-29 01:00:48,060 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {5014#(<= |foo_#in~size| 1)} {5000#(<= 2 main_~i~1)} #78#return; {4979#false} is VALID [2020-07-29 01:00:48,061 INFO L280 TraceCheckUtils]: 45: Hoare triple {4979#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {4979#false} is VALID [2020-07-29 01:00:48,061 INFO L280 TraceCheckUtils]: 46: Hoare triple {4979#false} assume !(4 + (~#b~0.offset + 4 * ~i~1) <= #length[~#b~0.base] && 0 <= ~#b~0.offset + 4 * ~i~1); {4979#false} is VALID [2020-07-29 01:00:48,063 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-07-29 01:00:48,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:00:48,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2020-07-29 01:00:48,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117558854] [2020-07-29 01:00:48,063 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2020-07-29 01:00:48,064 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:00:48,064 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-29 01:00:48,128 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:48,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-29 01:00:48,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:00:48,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-29 01:00:48,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-07-29 01:00:48,129 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand 12 states. [2020-07-29 01:00:49,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:49,215 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2020-07-29 01:00:49,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-29 01:00:49,215 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2020-07-29 01:00:49,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:00:49,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 01:00:49,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 85 transitions. [2020-07-29 01:00:49,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 01:00:49,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 85 transitions. [2020-07-29 01:00:49,219 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 85 transitions. [2020-07-29 01:00:49,311 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:49,313 INFO L225 Difference]: With dead ends: 115 [2020-07-29 01:00:49,313 INFO L226 Difference]: Without dead ends: 109 [2020-07-29 01:00:49,314 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2020-07-29 01:00:49,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-07-29 01:00:49,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 97. [2020-07-29 01:00:49,317 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:00:49,318 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand 97 states. [2020-07-29 01:00:49,318 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 97 states. [2020-07-29 01:00:49,318 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 97 states. [2020-07-29 01:00:49,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:49,321 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2020-07-29 01:00:49,321 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2020-07-29 01:00:49,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:49,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:49,322 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 109 states. [2020-07-29 01:00:49,322 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 109 states. [2020-07-29 01:00:49,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:49,325 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2020-07-29 01:00:49,325 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2020-07-29 01:00:49,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:49,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:49,326 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:00:49,326 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:00:49,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-07-29 01:00:49,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2020-07-29 01:00:49,328 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 47 [2020-07-29 01:00:49,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:00:49,329 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2020-07-29 01:00:49,329 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-29 01:00:49,329 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2020-07-29 01:00:49,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-07-29 01:00:49,329 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:00:49,330 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:00:49,543 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-07-29 01:00:49,544 INFO L427 AbstractCegarLoop]: === Iteration 16 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:00:49,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:00:49,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1407287743, now seen corresponding path program 2 times [2020-07-29 01:00:49,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:00:49,545 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329574683] [2020-07-29 01:00:49,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:00:49,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:49,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:00:49,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:49,692 INFO L280 TraceCheckUtils]: 0: Hoare triple {5625#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {5598#true} is VALID [2020-07-29 01:00:49,692 INFO L280 TraceCheckUtils]: 1: Hoare triple {5598#true} assume true; {5598#true} is VALID [2020-07-29 01:00:49,692 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5598#true} {5598#true} #74#return; {5598#true} is VALID [2020-07-29 01:00:49,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-07-29 01:00:49,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:49,698 INFO L280 TraceCheckUtils]: 0: Hoare triple {5598#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {5598#true} is VALID [2020-07-29 01:00:49,698 INFO L280 TraceCheckUtils]: 1: Hoare triple {5598#true} assume !(~i~0 < ~size); {5598#true} is VALID [2020-07-29 01:00:49,699 INFO L280 TraceCheckUtils]: 2: Hoare triple {5598#true} #res := ~i~0; {5598#true} is VALID [2020-07-29 01:00:49,699 INFO L280 TraceCheckUtils]: 3: Hoare triple {5598#true} assume true; {5598#true} is VALID [2020-07-29 01:00:49,701 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {5598#true} {5603#(= 0 main_~i~1)} #78#return; {5603#(= 0 main_~i~1)} is VALID [2020-07-29 01:00:49,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-07-29 01:00:49,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:49,708 INFO L280 TraceCheckUtils]: 0: Hoare triple {5598#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {5598#true} is VALID [2020-07-29 01:00:49,709 INFO L280 TraceCheckUtils]: 1: Hoare triple {5598#true} assume !!(~i~0 < ~size); {5598#true} is VALID [2020-07-29 01:00:49,709 INFO L280 TraceCheckUtils]: 2: Hoare triple {5598#true} assume 0 <= ~i~0 && ~i~0 < 32; {5598#true} is VALID [2020-07-29 01:00:49,709 INFO L280 TraceCheckUtils]: 3: Hoare triple {5598#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5598#true} is VALID [2020-07-29 01:00:49,710 INFO L280 TraceCheckUtils]: 4: Hoare triple {5598#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5598#true} is VALID [2020-07-29 01:00:49,710 INFO L280 TraceCheckUtils]: 5: Hoare triple {5598#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5598#true} is VALID [2020-07-29 01:00:49,710 INFO L280 TraceCheckUtils]: 6: Hoare triple {5598#true} assume !(~i~0 < ~size); {5598#true} is VALID [2020-07-29 01:00:49,711 INFO L280 TraceCheckUtils]: 7: Hoare triple {5598#true} #res := ~i~0; {5598#true} is VALID [2020-07-29 01:00:49,711 INFO L280 TraceCheckUtils]: 8: Hoare triple {5598#true} assume true; {5598#true} is VALID [2020-07-29 01:00:49,713 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {5598#true} {5609#(<= main_~i~1 1)} #78#return; {5609#(<= main_~i~1 1)} is VALID [2020-07-29 01:00:49,714 INFO L263 TraceCheckUtils]: 0: Hoare triple {5598#true} call ULTIMATE.init(); {5625#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:00:49,714 INFO L280 TraceCheckUtils]: 1: Hoare triple {5625#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {5598#true} is VALID [2020-07-29 01:00:49,715 INFO L280 TraceCheckUtils]: 2: Hoare triple {5598#true} assume true; {5598#true} is VALID [2020-07-29 01:00:49,715 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5598#true} {5598#true} #74#return; {5598#true} is VALID [2020-07-29 01:00:49,715 INFO L263 TraceCheckUtils]: 4: Hoare triple {5598#true} call #t~ret6 := main(); {5598#true} is VALID [2020-07-29 01:00:49,716 INFO L280 TraceCheckUtils]: 5: Hoare triple {5598#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(128);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {5603#(= 0 main_~i~1)} is VALID [2020-07-29 01:00:49,717 INFO L280 TraceCheckUtils]: 6: Hoare triple {5603#(= 0 main_~i~1)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {5603#(= 0 main_~i~1)} is VALID [2020-07-29 01:00:49,717 INFO L263 TraceCheckUtils]: 7: Hoare triple {5603#(= 0 main_~i~1)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {5598#true} is VALID [2020-07-29 01:00:49,718 INFO L280 TraceCheckUtils]: 8: Hoare triple {5598#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {5598#true} is VALID [2020-07-29 01:00:49,718 INFO L280 TraceCheckUtils]: 9: Hoare triple {5598#true} assume !(~i~0 < ~size); {5598#true} is VALID [2020-07-29 01:00:49,718 INFO L280 TraceCheckUtils]: 10: Hoare triple {5598#true} #res := ~i~0; {5598#true} is VALID [2020-07-29 01:00:49,718 INFO L280 TraceCheckUtils]: 11: Hoare triple {5598#true} assume true; {5598#true} is VALID [2020-07-29 01:00:49,719 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {5598#true} {5603#(= 0 main_~i~1)} #78#return; {5603#(= 0 main_~i~1)} is VALID [2020-07-29 01:00:49,720 INFO L280 TraceCheckUtils]: 13: Hoare triple {5603#(= 0 main_~i~1)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {5603#(= 0 main_~i~1)} is VALID [2020-07-29 01:00:49,721 INFO L280 TraceCheckUtils]: 14: Hoare triple {5603#(= 0 main_~i~1)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {5603#(= 0 main_~i~1)} is VALID [2020-07-29 01:00:49,721 INFO L280 TraceCheckUtils]: 15: Hoare triple {5603#(= 0 main_~i~1)} havoc #t~ret3; {5603#(= 0 main_~i~1)} is VALID [2020-07-29 01:00:49,722 INFO L280 TraceCheckUtils]: 16: Hoare triple {5603#(= 0 main_~i~1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5609#(<= main_~i~1 1)} is VALID [2020-07-29 01:00:49,722 INFO L280 TraceCheckUtils]: 17: Hoare triple {5609#(<= main_~i~1 1)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {5609#(<= main_~i~1 1)} is VALID [2020-07-29 01:00:49,723 INFO L263 TraceCheckUtils]: 18: Hoare triple {5609#(<= main_~i~1 1)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {5598#true} is VALID [2020-07-29 01:00:49,723 INFO L280 TraceCheckUtils]: 19: Hoare triple {5598#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {5598#true} is VALID [2020-07-29 01:00:49,723 INFO L280 TraceCheckUtils]: 20: Hoare triple {5598#true} assume !!(~i~0 < ~size); {5598#true} is VALID [2020-07-29 01:00:49,723 INFO L280 TraceCheckUtils]: 21: Hoare triple {5598#true} assume 0 <= ~i~0 && ~i~0 < 32; {5598#true} is VALID [2020-07-29 01:00:49,723 INFO L280 TraceCheckUtils]: 22: Hoare triple {5598#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5598#true} is VALID [2020-07-29 01:00:49,724 INFO L280 TraceCheckUtils]: 23: Hoare triple {5598#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5598#true} is VALID [2020-07-29 01:00:49,724 INFO L280 TraceCheckUtils]: 24: Hoare triple {5598#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5598#true} is VALID [2020-07-29 01:00:49,724 INFO L280 TraceCheckUtils]: 25: Hoare triple {5598#true} assume !(~i~0 < ~size); {5598#true} is VALID [2020-07-29 01:00:49,724 INFO L280 TraceCheckUtils]: 26: Hoare triple {5598#true} #res := ~i~0; {5598#true} is VALID [2020-07-29 01:00:49,724 INFO L280 TraceCheckUtils]: 27: Hoare triple {5598#true} assume true; {5598#true} is VALID [2020-07-29 01:00:49,726 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {5598#true} {5609#(<= main_~i~1 1)} #78#return; {5609#(<= main_~i~1 1)} is VALID [2020-07-29 01:00:49,726 INFO L280 TraceCheckUtils]: 29: Hoare triple {5609#(<= main_~i~1 1)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {5609#(<= main_~i~1 1)} is VALID [2020-07-29 01:00:49,727 INFO L280 TraceCheckUtils]: 30: Hoare triple {5609#(<= main_~i~1 1)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {5609#(<= main_~i~1 1)} is VALID [2020-07-29 01:00:49,727 INFO L280 TraceCheckUtils]: 31: Hoare triple {5609#(<= main_~i~1 1)} havoc #t~ret3; {5609#(<= main_~i~1 1)} is VALID [2020-07-29 01:00:49,728 INFO L280 TraceCheckUtils]: 32: Hoare triple {5609#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5620#(<= main_~i~1 2)} is VALID [2020-07-29 01:00:49,729 INFO L280 TraceCheckUtils]: 33: Hoare triple {5620#(<= main_~i~1 2)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {5620#(<= main_~i~1 2)} is VALID [2020-07-29 01:00:49,730 INFO L263 TraceCheckUtils]: 34: Hoare triple {5620#(<= main_~i~1 2)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {5621#(<= |foo_#in~size| 2)} is VALID [2020-07-29 01:00:49,731 INFO L280 TraceCheckUtils]: 35: Hoare triple {5621#(<= |foo_#in~size| 2)} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {5622#(and (= 0 foo_~i~0) (<= foo_~size 2))} is VALID [2020-07-29 01:00:49,731 INFO L280 TraceCheckUtils]: 36: Hoare triple {5622#(and (= 0 foo_~i~0) (<= foo_~size 2))} assume !!(~i~0 < ~size); {5622#(and (= 0 foo_~i~0) (<= foo_~size 2))} is VALID [2020-07-29 01:00:49,732 INFO L280 TraceCheckUtils]: 37: Hoare triple {5622#(and (= 0 foo_~i~0) (<= foo_~size 2))} assume 0 <= ~i~0 && ~i~0 < 32; {5622#(and (= 0 foo_~i~0) (<= foo_~size 2))} is VALID [2020-07-29 01:00:49,733 INFO L280 TraceCheckUtils]: 38: Hoare triple {5622#(and (= 0 foo_~i~0) (<= foo_~size 2))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5622#(and (= 0 foo_~i~0) (<= foo_~size 2))} is VALID [2020-07-29 01:00:49,734 INFO L280 TraceCheckUtils]: 39: Hoare triple {5622#(and (= 0 foo_~i~0) (<= foo_~size 2))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5622#(and (= 0 foo_~i~0) (<= foo_~size 2))} is VALID [2020-07-29 01:00:49,734 INFO L280 TraceCheckUtils]: 40: Hoare triple {5622#(and (= 0 foo_~i~0) (<= foo_~size 2))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5623#(<= foo_~size (+ foo_~i~0 1))} is VALID [2020-07-29 01:00:49,735 INFO L280 TraceCheckUtils]: 41: Hoare triple {5623#(<= foo_~size (+ foo_~i~0 1))} assume !!(~i~0 < ~size); {5623#(<= foo_~size (+ foo_~i~0 1))} is VALID [2020-07-29 01:00:49,735 INFO L280 TraceCheckUtils]: 42: Hoare triple {5623#(<= foo_~size (+ foo_~i~0 1))} assume 0 <= ~i~0 && ~i~0 < 32; {5623#(<= foo_~size (+ foo_~i~0 1))} is VALID [2020-07-29 01:00:49,736 INFO L280 TraceCheckUtils]: 43: Hoare triple {5623#(<= foo_~size (+ foo_~i~0 1))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5623#(<= foo_~size (+ foo_~i~0 1))} is VALID [2020-07-29 01:00:49,736 INFO L280 TraceCheckUtils]: 44: Hoare triple {5623#(<= foo_~size (+ foo_~i~0 1))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5623#(<= foo_~size (+ foo_~i~0 1))} is VALID [2020-07-29 01:00:49,737 INFO L280 TraceCheckUtils]: 45: Hoare triple {5623#(<= foo_~size (+ foo_~i~0 1))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5624#(<= foo_~size foo_~i~0)} is VALID [2020-07-29 01:00:49,738 INFO L280 TraceCheckUtils]: 46: Hoare triple {5624#(<= foo_~size foo_~i~0)} assume !!(~i~0 < ~size); {5599#false} is VALID [2020-07-29 01:00:49,738 INFO L280 TraceCheckUtils]: 47: Hoare triple {5599#false} assume 0 <= ~i~0 && ~i~0 < 32; {5599#false} is VALID [2020-07-29 01:00:49,738 INFO L280 TraceCheckUtils]: 48: Hoare triple {5599#false} assume !(1 + (~b.offset + ~i~0) <= #length[~b.base] && 0 <= ~b.offset + ~i~0); {5599#false} is VALID [2020-07-29 01:00:49,741 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 26 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-29 01:00:49,742 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329574683] [2020-07-29 01:00:49,742 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428075761] [2020-07-29 01:00:49,742 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:00:49,797 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-29 01:00:49,798 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:00:49,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-29 01:00:49,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:49,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:00:49,847 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:00:49,848 INFO L384 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 1 case distinctions, treesize of input 9 treesize of output 25 [2020-07-29 01:00:49,848 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:00:49,872 INFO L624 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2020-07-29 01:00:49,874 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:00:49,875 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2020-07-29 01:00:49,878 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:00:49,878 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_15|, |main_~#b~0.base|]. (and (= |#length| (store (store |v_#length_15| |main_~#b~0.base| 128) |main_~#mask~0.base| 32)) (= 0 |main_~#mask~0.offset|)) [2020-07-29 01:00:49,879 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)) [2020-07-29 01:00:50,322 INFO L263 TraceCheckUtils]: 0: Hoare triple {5598#true} call ULTIMATE.init(); {5598#true} is VALID [2020-07-29 01:00:50,323 INFO L280 TraceCheckUtils]: 1: Hoare triple {5598#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {5598#true} is VALID [2020-07-29 01:00:50,323 INFO L280 TraceCheckUtils]: 2: Hoare triple {5598#true} assume true; {5598#true} is VALID [2020-07-29 01:00:50,324 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5598#true} {5598#true} #74#return; {5598#true} is VALID [2020-07-29 01:00:50,324 INFO L263 TraceCheckUtils]: 4: Hoare triple {5598#true} call #t~ret6 := main(); {5598#true} is VALID [2020-07-29 01:00:50,326 INFO L280 TraceCheckUtils]: 5: Hoare triple {5598#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(128);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {5644#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:50,328 INFO L280 TraceCheckUtils]: 6: Hoare triple {5644#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {5644#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:50,330 INFO L263 TraceCheckUtils]: 7: Hoare triple {5644#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {5651#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_6| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_6|)))} is VALID [2020-07-29 01:00:50,330 INFO L280 TraceCheckUtils]: 8: Hoare triple {5651#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_6| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_6|)))} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {5651#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_6| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_6|)))} is VALID [2020-07-29 01:00:50,331 INFO L280 TraceCheckUtils]: 9: Hoare triple {5651#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_6| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_6|)))} assume !(~i~0 < ~size); {5651#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_6| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_6|)))} is VALID [2020-07-29 01:00:50,332 INFO L280 TraceCheckUtils]: 10: Hoare triple {5651#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_6| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_6|)))} #res := ~i~0; {5651#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_6| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_6|)))} is VALID [2020-07-29 01:00:50,333 INFO L280 TraceCheckUtils]: 11: Hoare triple {5651#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_6| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_6|)))} assume true; {5651#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_6| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_6|)))} is VALID [2020-07-29 01:00:50,334 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {5651#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_6| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_6|)))} {5644#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} #78#return; {5644#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:50,335 INFO L280 TraceCheckUtils]: 13: Hoare triple {5644#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {5644#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:50,336 INFO L280 TraceCheckUtils]: 14: Hoare triple {5644#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {5644#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:50,338 INFO L280 TraceCheckUtils]: 15: Hoare triple {5644#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} havoc #t~ret3; {5644#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:50,339 INFO L280 TraceCheckUtils]: 16: Hoare triple {5644#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5644#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:50,340 INFO L280 TraceCheckUtils]: 17: Hoare triple {5644#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {5644#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:50,342 INFO L263 TraceCheckUtils]: 18: Hoare triple {5644#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {5651#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_6| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_6|)))} is VALID [2020-07-29 01:00:50,343 INFO L280 TraceCheckUtils]: 19: Hoare triple {5651#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_6| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_6|)))} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {5651#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_6| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_6|)))} is VALID [2020-07-29 01:00:50,344 INFO L280 TraceCheckUtils]: 20: Hoare triple {5651#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_6| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_6|)))} assume !!(~i~0 < ~size); {5651#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_6| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_6|)))} is VALID [2020-07-29 01:00:50,345 INFO L280 TraceCheckUtils]: 21: Hoare triple {5651#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_6| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_6|)))} assume 0 <= ~i~0 && ~i~0 < 32; {5651#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_6| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_6|)))} is VALID [2020-07-29 01:00:50,346 INFO L280 TraceCheckUtils]: 22: Hoare triple {5651#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_6| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_6|)))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5651#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_6| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_6|)))} is VALID [2020-07-29 01:00:50,347 INFO L280 TraceCheckUtils]: 23: Hoare triple {5651#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_6| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_6|)))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5651#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_6| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_6|)))} is VALID [2020-07-29 01:00:50,348 INFO L280 TraceCheckUtils]: 24: Hoare triple {5651#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_6| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_6|)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5651#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_6| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_6|)))} is VALID [2020-07-29 01:00:50,349 INFO L280 TraceCheckUtils]: 25: Hoare triple {5651#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_6| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_6|)))} assume !(~i~0 < ~size); {5651#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_6| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_6|)))} is VALID [2020-07-29 01:00:50,350 INFO L280 TraceCheckUtils]: 26: Hoare triple {5651#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_6| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_6|)))} #res := ~i~0; {5651#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_6| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_6|)))} is VALID [2020-07-29 01:00:50,351 INFO L280 TraceCheckUtils]: 27: Hoare triple {5651#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_6| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_6|)))} assume true; {5651#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_6| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_6|)))} is VALID [2020-07-29 01:00:50,354 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {5651#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_6| Int)) (= 32 (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_6|)))} {5644#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} #78#return; {5644#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:50,355 INFO L280 TraceCheckUtils]: 29: Hoare triple {5644#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {5644#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:50,357 INFO L280 TraceCheckUtils]: 30: Hoare triple {5644#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {5644#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:50,358 INFO L280 TraceCheckUtils]: 31: Hoare triple {5644#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} havoc #t~ret3; {5644#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:50,359 INFO L280 TraceCheckUtils]: 32: Hoare triple {5644#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5644#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:50,361 INFO L280 TraceCheckUtils]: 33: Hoare triple {5644#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {5730#(and (= 32 (select |#length| main_~c~0.base)) (= main_~c~0.offset 0))} is VALID [2020-07-29 01:00:50,363 INFO L263 TraceCheckUtils]: 34: Hoare triple {5730#(and (= 32 (select |#length| main_~c~0.base)) (= main_~c~0.offset 0))} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {5734#(and (= 32 (select |#length| |foo_#in~b.base|)) (= 0 |foo_#in~b.offset|))} is VALID [2020-07-29 01:00:50,364 INFO L280 TraceCheckUtils]: 35: Hoare triple {5734#(and (= 32 (select |#length| |foo_#in~b.base|)) (= 0 |foo_#in~b.offset|))} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {5738#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:50,366 INFO L280 TraceCheckUtils]: 36: Hoare triple {5738#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0))} assume !!(~i~0 < ~size); {5738#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:50,367 INFO L280 TraceCheckUtils]: 37: Hoare triple {5738#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0))} assume 0 <= ~i~0 && ~i~0 < 32; {5738#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:50,368 INFO L280 TraceCheckUtils]: 38: Hoare triple {5738#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5738#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:50,370 INFO L280 TraceCheckUtils]: 39: Hoare triple {5738#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5738#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:50,371 INFO L280 TraceCheckUtils]: 40: Hoare triple {5738#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5738#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:50,372 INFO L280 TraceCheckUtils]: 41: Hoare triple {5738#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0))} assume !!(~i~0 < ~size); {5738#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:50,374 INFO L280 TraceCheckUtils]: 42: Hoare triple {5738#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0))} assume 0 <= ~i~0 && ~i~0 < 32; {5738#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:50,375 INFO L280 TraceCheckUtils]: 43: Hoare triple {5738#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5738#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:50,376 INFO L280 TraceCheckUtils]: 44: Hoare triple {5738#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5738#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:50,378 INFO L280 TraceCheckUtils]: 45: Hoare triple {5738#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5738#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:50,379 INFO L280 TraceCheckUtils]: 46: Hoare triple {5738#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0))} assume !!(~i~0 < ~size); {5738#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:50,380 INFO L280 TraceCheckUtils]: 47: Hoare triple {5738#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0))} assume 0 <= ~i~0 && ~i~0 < 32; {5775#(and (<= 0 foo_~i~0) (= 32 (select |#length| foo_~b.base)) (< foo_~i~0 32) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:50,382 INFO L280 TraceCheckUtils]: 48: Hoare triple {5775#(and (<= 0 foo_~i~0) (= 32 (select |#length| foo_~b.base)) (< foo_~i~0 32) (= foo_~b.offset 0))} assume !(1 + (~b.offset + ~i~0) <= #length[~b.base] && 0 <= ~b.offset + ~i~0); {5599#false} is VALID [2020-07-29 01:00:50,395 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 23 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-07-29 01:00:50,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:00:50,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 16 [2020-07-29 01:00:50,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78772934] [2020-07-29 01:00:50,399 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 49 [2020-07-29 01:00:50,400 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:00:50,400 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2020-07-29 01:00:50,520 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:50,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-29 01:00:50,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:00:50,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-29 01:00:50,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2020-07-29 01:00:50,521 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand 16 states. [2020-07-29 01:00:52,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:52,448 INFO L93 Difference]: Finished difference Result 114 states and 117 transitions. [2020-07-29 01:00:52,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-07-29 01:00:52,448 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 49 [2020-07-29 01:00:52,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:00:52,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-29 01:00:52,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 106 transitions. [2020-07-29 01:00:52,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-29 01:00:52,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 106 transitions. [2020-07-29 01:00:52,452 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 106 transitions. [2020-07-29 01:00:52,608 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:52,612 INFO L225 Difference]: With dead ends: 114 [2020-07-29 01:00:52,612 INFO L226 Difference]: Without dead ends: 114 [2020-07-29 01:00:52,613 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=220, Invalid=902, Unknown=0, NotChecked=0, Total=1122 [2020-07-29 01:00:52,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-07-29 01:00:52,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 93. [2020-07-29 01:00:52,620 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:00:52,620 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand 93 states. [2020-07-29 01:00:52,620 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 93 states. [2020-07-29 01:00:52,620 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 93 states. [2020-07-29 01:00:52,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:52,624 INFO L93 Difference]: Finished difference Result 114 states and 117 transitions. [2020-07-29 01:00:52,624 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 117 transitions. [2020-07-29 01:00:52,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:52,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:52,625 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 114 states. [2020-07-29 01:00:52,625 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 114 states. [2020-07-29 01:00:52,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:52,628 INFO L93 Difference]: Finished difference Result 114 states and 117 transitions. [2020-07-29 01:00:52,628 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 117 transitions. [2020-07-29 01:00:52,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:52,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:52,629 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:00:52,629 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:00:52,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-07-29 01:00:52,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2020-07-29 01:00:52,632 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 49 [2020-07-29 01:00:52,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:00:52,632 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2020-07-29 01:00:52,632 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-29 01:00:52,632 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2020-07-29 01:00:52,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-29 01:00:52,633 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:00:52,633 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:00:52,846 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-07-29 01:00:52,847 INFO L427 AbstractCegarLoop]: === Iteration 17 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:00:52,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:00:52,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1381084076, now seen corresponding path program 3 times [2020-07-29 01:00:52,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:00:52,848 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289313333] [2020-07-29 01:00:52,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:00:52,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:52,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:00:52,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:52,979 INFO L280 TraceCheckUtils]: 0: Hoare triple {6289#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {6251#true} is VALID [2020-07-29 01:00:52,980 INFO L280 TraceCheckUtils]: 1: Hoare triple {6251#true} assume true; {6251#true} is VALID [2020-07-29 01:00:52,980 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {6251#true} {6251#true} #74#return; {6251#true} is VALID [2020-07-29 01:00:52,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-07-29 01:00:52,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:52,990 INFO L280 TraceCheckUtils]: 0: Hoare triple {6251#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {6251#true} is VALID [2020-07-29 01:00:52,991 INFO L280 TraceCheckUtils]: 1: Hoare triple {6251#true} assume !(~i~0 < ~size); {6251#true} is VALID [2020-07-29 01:00:52,991 INFO L280 TraceCheckUtils]: 2: Hoare triple {6251#true} #res := ~i~0; {6251#true} is VALID [2020-07-29 01:00:52,991 INFO L280 TraceCheckUtils]: 3: Hoare triple {6251#true} assume true; {6251#true} is VALID [2020-07-29 01:00:52,993 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {6251#true} {6256#(and (= 0 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} #78#return; {6256#(and (= 0 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} is VALID [2020-07-29 01:00:52,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-07-29 01:00:52,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:53,003 INFO L280 TraceCheckUtils]: 0: Hoare triple {6251#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {6251#true} is VALID [2020-07-29 01:00:53,003 INFO L280 TraceCheckUtils]: 1: Hoare triple {6251#true} assume !!(~i~0 < ~size); {6251#true} is VALID [2020-07-29 01:00:53,004 INFO L280 TraceCheckUtils]: 2: Hoare triple {6251#true} assume 0 <= ~i~0 && ~i~0 < 32; {6251#true} is VALID [2020-07-29 01:00:53,004 INFO L280 TraceCheckUtils]: 3: Hoare triple {6251#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {6251#true} is VALID [2020-07-29 01:00:53,004 INFO L280 TraceCheckUtils]: 4: Hoare triple {6251#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6251#true} is VALID [2020-07-29 01:00:53,004 INFO L280 TraceCheckUtils]: 5: Hoare triple {6251#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6251#true} is VALID [2020-07-29 01:00:53,004 INFO L280 TraceCheckUtils]: 6: Hoare triple {6251#true} assume !(~i~0 < ~size); {6251#true} is VALID [2020-07-29 01:00:53,004 INFO L280 TraceCheckUtils]: 7: Hoare triple {6251#true} #res := ~i~0; {6251#true} is VALID [2020-07-29 01:00:53,005 INFO L280 TraceCheckUtils]: 8: Hoare triple {6251#true} assume true; {6251#true} is VALID [2020-07-29 01:00:53,006 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {6251#true} {6262#(and (<= 1 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)) (<= main_~i~1 1))} #78#return; {6262#(and (<= 1 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)) (<= main_~i~1 1))} is VALID [2020-07-29 01:00:53,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-07-29 01:00:53,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:53,016 INFO L280 TraceCheckUtils]: 0: Hoare triple {6251#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {6251#true} is VALID [2020-07-29 01:00:53,016 INFO L280 TraceCheckUtils]: 1: Hoare triple {6251#true} assume !!(~i~0 < ~size); {6251#true} is VALID [2020-07-29 01:00:53,017 INFO L280 TraceCheckUtils]: 2: Hoare triple {6251#true} assume 0 <= ~i~0 && ~i~0 < 32; {6251#true} is VALID [2020-07-29 01:00:53,017 INFO L280 TraceCheckUtils]: 3: Hoare triple {6251#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {6251#true} is VALID [2020-07-29 01:00:53,017 INFO L280 TraceCheckUtils]: 4: Hoare triple {6251#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6251#true} is VALID [2020-07-29 01:00:53,017 INFO L280 TraceCheckUtils]: 5: Hoare triple {6251#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6251#true} is VALID [2020-07-29 01:00:53,017 INFO L280 TraceCheckUtils]: 6: Hoare triple {6251#true} assume !!(~i~0 < ~size); {6251#true} is VALID [2020-07-29 01:00:53,017 INFO L280 TraceCheckUtils]: 7: Hoare triple {6251#true} assume 0 <= ~i~0 && ~i~0 < 32; {6251#true} is VALID [2020-07-29 01:00:53,018 INFO L280 TraceCheckUtils]: 8: Hoare triple {6251#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {6251#true} is VALID [2020-07-29 01:00:53,018 INFO L280 TraceCheckUtils]: 9: Hoare triple {6251#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6251#true} is VALID [2020-07-29 01:00:53,018 INFO L280 TraceCheckUtils]: 10: Hoare triple {6251#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6251#true} is VALID [2020-07-29 01:00:53,019 INFO L280 TraceCheckUtils]: 11: Hoare triple {6251#true} assume !(~i~0 < ~size); {6251#true} is VALID [2020-07-29 01:00:53,019 INFO L280 TraceCheckUtils]: 12: Hoare triple {6251#true} #res := ~i~0; {6251#true} is VALID [2020-07-29 01:00:53,019 INFO L280 TraceCheckUtils]: 13: Hoare triple {6251#true} assume true; {6251#true} is VALID [2020-07-29 01:00:53,021 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {6251#true} {6273#(and (= 0 |main_~#b~0.offset|) (<= main_~i~1 2) (= 128 (select |#length| |main_~#b~0.base|)) (<= 2 main_~i~1))} #78#return; {6273#(and (= 0 |main_~#b~0.offset|) (<= main_~i~1 2) (= 128 (select |#length| |main_~#b~0.base|)) (<= 2 main_~i~1))} is VALID [2020-07-29 01:00:53,022 INFO L263 TraceCheckUtils]: 0: Hoare triple {6251#true} call ULTIMATE.init(); {6289#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:00:53,022 INFO L280 TraceCheckUtils]: 1: Hoare triple {6289#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {6251#true} is VALID [2020-07-29 01:00:53,022 INFO L280 TraceCheckUtils]: 2: Hoare triple {6251#true} assume true; {6251#true} is VALID [2020-07-29 01:00:53,022 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6251#true} {6251#true} #74#return; {6251#true} is VALID [2020-07-29 01:00:53,022 INFO L263 TraceCheckUtils]: 4: Hoare triple {6251#true} call #t~ret6 := main(); {6251#true} is VALID [2020-07-29 01:00:53,024 INFO L280 TraceCheckUtils]: 5: Hoare triple {6251#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(128);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {6256#(and (= 0 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} is VALID [2020-07-29 01:00:53,025 INFO L280 TraceCheckUtils]: 6: Hoare triple {6256#(and (= 0 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {6256#(and (= 0 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} is VALID [2020-07-29 01:00:53,025 INFO L263 TraceCheckUtils]: 7: Hoare triple {6256#(and (= 0 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {6251#true} is VALID [2020-07-29 01:00:53,025 INFO L280 TraceCheckUtils]: 8: Hoare triple {6251#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {6251#true} is VALID [2020-07-29 01:00:53,026 INFO L280 TraceCheckUtils]: 9: Hoare triple {6251#true} assume !(~i~0 < ~size); {6251#true} is VALID [2020-07-29 01:00:53,026 INFO L280 TraceCheckUtils]: 10: Hoare triple {6251#true} #res := ~i~0; {6251#true} is VALID [2020-07-29 01:00:53,026 INFO L280 TraceCheckUtils]: 11: Hoare triple {6251#true} assume true; {6251#true} is VALID [2020-07-29 01:00:53,028 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {6251#true} {6256#(and (= 0 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} #78#return; {6256#(and (= 0 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} is VALID [2020-07-29 01:00:53,028 INFO L280 TraceCheckUtils]: 13: Hoare triple {6256#(and (= 0 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {6256#(and (= 0 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} is VALID [2020-07-29 01:00:53,030 INFO L280 TraceCheckUtils]: 14: Hoare triple {6256#(and (= 0 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {6256#(and (= 0 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} is VALID [2020-07-29 01:00:53,030 INFO L280 TraceCheckUtils]: 15: Hoare triple {6256#(and (= 0 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} havoc #t~ret3; {6256#(and (= 0 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} is VALID [2020-07-29 01:00:53,031 INFO L280 TraceCheckUtils]: 16: Hoare triple {6256#(and (= 0 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6262#(and (<= 1 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)) (<= main_~i~1 1))} is VALID [2020-07-29 01:00:53,032 INFO L280 TraceCheckUtils]: 17: Hoare triple {6262#(and (<= 1 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)) (<= main_~i~1 1))} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {6262#(and (<= 1 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)) (<= main_~i~1 1))} is VALID [2020-07-29 01:00:53,032 INFO L263 TraceCheckUtils]: 18: Hoare triple {6262#(and (<= 1 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)) (<= main_~i~1 1))} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {6251#true} is VALID [2020-07-29 01:00:53,032 INFO L280 TraceCheckUtils]: 19: Hoare triple {6251#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {6251#true} is VALID [2020-07-29 01:00:53,033 INFO L280 TraceCheckUtils]: 20: Hoare triple {6251#true} assume !!(~i~0 < ~size); {6251#true} is VALID [2020-07-29 01:00:53,033 INFO L280 TraceCheckUtils]: 21: Hoare triple {6251#true} assume 0 <= ~i~0 && ~i~0 < 32; {6251#true} is VALID [2020-07-29 01:00:53,033 INFO L280 TraceCheckUtils]: 22: Hoare triple {6251#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {6251#true} is VALID [2020-07-29 01:00:53,033 INFO L280 TraceCheckUtils]: 23: Hoare triple {6251#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6251#true} is VALID [2020-07-29 01:00:53,034 INFO L280 TraceCheckUtils]: 24: Hoare triple {6251#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6251#true} is VALID [2020-07-29 01:00:53,034 INFO L280 TraceCheckUtils]: 25: Hoare triple {6251#true} assume !(~i~0 < ~size); {6251#true} is VALID [2020-07-29 01:00:53,034 INFO L280 TraceCheckUtils]: 26: Hoare triple {6251#true} #res := ~i~0; {6251#true} is VALID [2020-07-29 01:00:53,034 INFO L280 TraceCheckUtils]: 27: Hoare triple {6251#true} assume true; {6251#true} is VALID [2020-07-29 01:00:53,036 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {6251#true} {6262#(and (<= 1 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)) (<= main_~i~1 1))} #78#return; {6262#(and (<= 1 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)) (<= main_~i~1 1))} is VALID [2020-07-29 01:00:53,037 INFO L280 TraceCheckUtils]: 29: Hoare triple {6262#(and (<= 1 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)) (<= main_~i~1 1))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {6262#(and (<= 1 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)) (<= main_~i~1 1))} is VALID [2020-07-29 01:00:53,038 INFO L280 TraceCheckUtils]: 30: Hoare triple {6262#(and (<= 1 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)) (<= main_~i~1 1))} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {6262#(and (<= 1 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)) (<= main_~i~1 1))} is VALID [2020-07-29 01:00:53,039 INFO L280 TraceCheckUtils]: 31: Hoare triple {6262#(and (<= 1 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)) (<= main_~i~1 1))} havoc #t~ret3; {6262#(and (<= 1 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)) (<= main_~i~1 1))} is VALID [2020-07-29 01:00:53,040 INFO L280 TraceCheckUtils]: 32: Hoare triple {6262#(and (<= 1 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)) (<= main_~i~1 1))} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6273#(and (= 0 |main_~#b~0.offset|) (<= main_~i~1 2) (= 128 (select |#length| |main_~#b~0.base|)) (<= 2 main_~i~1))} is VALID [2020-07-29 01:00:53,041 INFO L280 TraceCheckUtils]: 33: Hoare triple {6273#(and (= 0 |main_~#b~0.offset|) (<= main_~i~1 2) (= 128 (select |#length| |main_~#b~0.base|)) (<= 2 main_~i~1))} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {6273#(and (= 0 |main_~#b~0.offset|) (<= main_~i~1 2) (= 128 (select |#length| |main_~#b~0.base|)) (<= 2 main_~i~1))} is VALID [2020-07-29 01:00:53,041 INFO L263 TraceCheckUtils]: 34: Hoare triple {6273#(and (= 0 |main_~#b~0.offset|) (<= main_~i~1 2) (= 128 (select |#length| |main_~#b~0.base|)) (<= 2 main_~i~1))} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {6251#true} is VALID [2020-07-29 01:00:53,041 INFO L280 TraceCheckUtils]: 35: Hoare triple {6251#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {6251#true} is VALID [2020-07-29 01:00:53,041 INFO L280 TraceCheckUtils]: 36: Hoare triple {6251#true} assume !!(~i~0 < ~size); {6251#true} is VALID [2020-07-29 01:00:53,041 INFO L280 TraceCheckUtils]: 37: Hoare triple {6251#true} assume 0 <= ~i~0 && ~i~0 < 32; {6251#true} is VALID [2020-07-29 01:00:53,042 INFO L280 TraceCheckUtils]: 38: Hoare triple {6251#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {6251#true} is VALID [2020-07-29 01:00:53,042 INFO L280 TraceCheckUtils]: 39: Hoare triple {6251#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6251#true} is VALID [2020-07-29 01:00:53,042 INFO L280 TraceCheckUtils]: 40: Hoare triple {6251#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6251#true} is VALID [2020-07-29 01:00:53,043 INFO L280 TraceCheckUtils]: 41: Hoare triple {6251#true} assume !!(~i~0 < ~size); {6251#true} is VALID [2020-07-29 01:00:53,043 INFO L280 TraceCheckUtils]: 42: Hoare triple {6251#true} assume 0 <= ~i~0 && ~i~0 < 32; {6251#true} is VALID [2020-07-29 01:00:53,043 INFO L280 TraceCheckUtils]: 43: Hoare triple {6251#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {6251#true} is VALID [2020-07-29 01:00:53,043 INFO L280 TraceCheckUtils]: 44: Hoare triple {6251#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6251#true} is VALID [2020-07-29 01:00:53,043 INFO L280 TraceCheckUtils]: 45: Hoare triple {6251#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6251#true} is VALID [2020-07-29 01:00:53,043 INFO L280 TraceCheckUtils]: 46: Hoare triple {6251#true} assume !(~i~0 < ~size); {6251#true} is VALID [2020-07-29 01:00:53,044 INFO L280 TraceCheckUtils]: 47: Hoare triple {6251#true} #res := ~i~0; {6251#true} is VALID [2020-07-29 01:00:53,044 INFO L280 TraceCheckUtils]: 48: Hoare triple {6251#true} assume true; {6251#true} is VALID [2020-07-29 01:00:53,045 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {6251#true} {6273#(and (= 0 |main_~#b~0.offset|) (<= main_~i~1 2) (= 128 (select |#length| |main_~#b~0.base|)) (<= 2 main_~i~1))} #78#return; {6273#(and (= 0 |main_~#b~0.offset|) (<= main_~i~1 2) (= 128 (select |#length| |main_~#b~0.base|)) (<= 2 main_~i~1))} is VALID [2020-07-29 01:00:53,046 INFO L280 TraceCheckUtils]: 50: Hoare triple {6273#(and (= 0 |main_~#b~0.offset|) (<= main_~i~1 2) (= 128 (select |#length| |main_~#b~0.base|)) (<= 2 main_~i~1))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {6273#(and (= 0 |main_~#b~0.offset|) (<= main_~i~1 2) (= 128 (select |#length| |main_~#b~0.base|)) (<= 2 main_~i~1))} is VALID [2020-07-29 01:00:53,048 INFO L280 TraceCheckUtils]: 51: Hoare triple {6273#(and (= 0 |main_~#b~0.offset|) (<= main_~i~1 2) (= 128 (select |#length| |main_~#b~0.base|)) (<= 2 main_~i~1))} assume !(4 + (~#b~0.offset + 4 * ~i~1) <= #length[~#b~0.base] && 0 <= ~#b~0.offset + 4 * ~i~1); {6252#false} is VALID [2020-07-29 01:00:53,052 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-07-29 01:00:53,053 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289313333] [2020-07-29 01:00:53,053 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806262299] [2020-07-29 01:00:53,053 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:00:53,103 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-07-29 01:00:53,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:00:53,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-29 01:00:53,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:53,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:00:53,131 INFO L440 ElimStorePlain]: Different costs {0=[|v_#length_16|], 1=[|v_#valid_26|]} [2020-07-29 01:00:53,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-29 01:00:53,136 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2020-07-29 01:00:53,136 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:00:53,145 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:00:53,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-29 01:00:53,151 INFO L384 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 5 treesize of output 3 [2020-07-29 01:00:53,155 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-29 01:00:53,161 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:00:53,161 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:00:53,162 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2020-07-29 01:00:53,165 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:00:53,165 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_16|, |v_#valid_26|]. (and (= (store (store |v_#length_16| |main_~#b~0.base| 128) |main_~#mask~0.base| 32) |#length|) (= 0 |main_~#b~0.offset|) (<= (select (store |v_#valid_26| |main_~#b~0.base| 1) |main_~#mask~0.base|) 0)) [2020-07-29 01:00:53,165 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|))) [2020-07-29 01:00:53,876 INFO L263 TraceCheckUtils]: 0: Hoare triple {6251#true} call ULTIMATE.init(); {6251#true} is VALID [2020-07-29 01:00:53,877 INFO L280 TraceCheckUtils]: 1: Hoare triple {6251#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {6251#true} is VALID [2020-07-29 01:00:53,877 INFO L280 TraceCheckUtils]: 2: Hoare triple {6251#true} assume true; {6251#true} is VALID [2020-07-29 01:00:53,877 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6251#true} {6251#true} #74#return; {6251#true} is VALID [2020-07-29 01:00:53,877 INFO L263 TraceCheckUtils]: 4: Hoare triple {6251#true} call #t~ret6 := main(); {6251#true} is VALID [2020-07-29 01:00:53,878 INFO L280 TraceCheckUtils]: 5: Hoare triple {6251#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(128);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {6308#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} is VALID [2020-07-29 01:00:53,879 INFO L280 TraceCheckUtils]: 6: Hoare triple {6308#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {6308#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} is VALID [2020-07-29 01:00:53,880 INFO L263 TraceCheckUtils]: 7: Hoare triple {6308#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {6315#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} is VALID [2020-07-29 01:00:53,886 INFO L280 TraceCheckUtils]: 8: Hoare triple {6315#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {6315#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} is VALID [2020-07-29 01:00:53,887 INFO L280 TraceCheckUtils]: 9: Hoare triple {6315#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} assume !(~i~0 < ~size); {6315#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} is VALID [2020-07-29 01:00:53,888 INFO L280 TraceCheckUtils]: 10: Hoare triple {6315#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} #res := ~i~0; {6315#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} is VALID [2020-07-29 01:00:53,888 INFO L280 TraceCheckUtils]: 11: Hoare triple {6315#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} assume true; {6315#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} is VALID [2020-07-29 01:00:53,890 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {6315#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} {6308#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} #78#return; {6308#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} is VALID [2020-07-29 01:00:53,891 INFO L280 TraceCheckUtils]: 13: Hoare triple {6308#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {6308#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} is VALID [2020-07-29 01:00:53,892 INFO L280 TraceCheckUtils]: 14: Hoare triple {6308#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {6308#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} is VALID [2020-07-29 01:00:53,893 INFO L280 TraceCheckUtils]: 15: Hoare triple {6308#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} havoc #t~ret3; {6308#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} is VALID [2020-07-29 01:00:53,894 INFO L280 TraceCheckUtils]: 16: Hoare triple {6308#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6308#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} is VALID [2020-07-29 01:00:53,895 INFO L280 TraceCheckUtils]: 17: Hoare triple {6308#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {6308#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} is VALID [2020-07-29 01:00:53,897 INFO L263 TraceCheckUtils]: 18: Hoare triple {6308#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {6315#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} is VALID [2020-07-29 01:00:53,898 INFO L280 TraceCheckUtils]: 19: Hoare triple {6315#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {6315#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} is VALID [2020-07-29 01:00:53,899 INFO L280 TraceCheckUtils]: 20: Hoare triple {6315#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} assume !!(~i~0 < ~size); {6315#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} is VALID [2020-07-29 01:00:53,900 INFO L280 TraceCheckUtils]: 21: Hoare triple {6315#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} assume 0 <= ~i~0 && ~i~0 < 32; {6315#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} is VALID [2020-07-29 01:00:53,901 INFO L280 TraceCheckUtils]: 22: Hoare triple {6315#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {6315#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} is VALID [2020-07-29 01:00:53,902 INFO L280 TraceCheckUtils]: 23: Hoare triple {6315#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6315#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} is VALID [2020-07-29 01:00:53,902 INFO L280 TraceCheckUtils]: 24: Hoare triple {6315#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6315#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} is VALID [2020-07-29 01:00:53,903 INFO L280 TraceCheckUtils]: 25: Hoare triple {6315#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} assume !(~i~0 < ~size); {6315#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} is VALID [2020-07-29 01:00:53,904 INFO L280 TraceCheckUtils]: 26: Hoare triple {6315#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} #res := ~i~0; {6315#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} is VALID [2020-07-29 01:00:53,905 INFO L280 TraceCheckUtils]: 27: Hoare triple {6315#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} assume true; {6315#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} is VALID [2020-07-29 01:00:53,906 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {6315#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} {6308#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} #78#return; {6308#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} is VALID [2020-07-29 01:00:53,907 INFO L280 TraceCheckUtils]: 29: Hoare triple {6308#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {6308#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} is VALID [2020-07-29 01:00:53,908 INFO L280 TraceCheckUtils]: 30: Hoare triple {6308#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {6308#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} is VALID [2020-07-29 01:00:53,909 INFO L280 TraceCheckUtils]: 31: Hoare triple {6308#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} havoc #t~ret3; {6308#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} is VALID [2020-07-29 01:00:53,909 INFO L280 TraceCheckUtils]: 32: Hoare triple {6308#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6308#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} is VALID [2020-07-29 01:00:53,910 INFO L280 TraceCheckUtils]: 33: Hoare triple {6308#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)))} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {6394#(and (= 32 (select |#length| main_~c~0.base)) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)) (< main_~i~1 32))} is VALID [2020-07-29 01:00:53,912 INFO L263 TraceCheckUtils]: 34: Hoare triple {6394#(and (= 32 (select |#length| main_~c~0.base)) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)) (< main_~i~1 32))} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {6315#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} is VALID [2020-07-29 01:00:53,915 INFO L280 TraceCheckUtils]: 35: Hoare triple {6315#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {6401#(and (<= 0 foo_~i~0) (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (<= foo_~size |foo_#in~size|) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} is VALID [2020-07-29 01:00:53,916 INFO L280 TraceCheckUtils]: 36: Hoare triple {6401#(and (<= 0 foo_~i~0) (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (<= foo_~size |foo_#in~size|) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} assume !!(~i~0 < ~size); {6405#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (<= 1 |foo_#in~size|) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} is VALID [2020-07-29 01:00:53,917 INFO L280 TraceCheckUtils]: 37: Hoare triple {6405#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (<= 1 |foo_#in~size|) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} assume 0 <= ~i~0 && ~i~0 < 32; {6405#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (<= 1 |foo_#in~size|) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} is VALID [2020-07-29 01:00:53,918 INFO L280 TraceCheckUtils]: 38: Hoare triple {6405#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (<= 1 |foo_#in~size|) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {6405#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (<= 1 |foo_#in~size|) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} is VALID [2020-07-29 01:00:53,919 INFO L280 TraceCheckUtils]: 39: Hoare triple {6405#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (<= 1 |foo_#in~size|) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6405#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (<= 1 |foo_#in~size|) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} is VALID [2020-07-29 01:00:53,919 INFO L280 TraceCheckUtils]: 40: Hoare triple {6405#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (<= 1 |foo_#in~size|) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6405#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (<= 1 |foo_#in~size|) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} is VALID [2020-07-29 01:00:53,920 INFO L280 TraceCheckUtils]: 41: Hoare triple {6405#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (<= 1 |foo_#in~size|) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} assume !!(~i~0 < ~size); {6405#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (<= 1 |foo_#in~size|) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} is VALID [2020-07-29 01:00:53,921 INFO L280 TraceCheckUtils]: 42: Hoare triple {6405#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (<= 1 |foo_#in~size|) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} assume 0 <= ~i~0 && ~i~0 < 32; {6405#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (<= 1 |foo_#in~size|) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} is VALID [2020-07-29 01:00:53,922 INFO L280 TraceCheckUtils]: 43: Hoare triple {6405#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (<= 1 |foo_#in~size|) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {6405#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (<= 1 |foo_#in~size|) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} is VALID [2020-07-29 01:00:53,923 INFO L280 TraceCheckUtils]: 44: Hoare triple {6405#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (<= 1 |foo_#in~size|) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6405#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (<= 1 |foo_#in~size|) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} is VALID [2020-07-29 01:00:53,924 INFO L280 TraceCheckUtils]: 45: Hoare triple {6405#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (<= 1 |foo_#in~size|) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6405#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (<= 1 |foo_#in~size|) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} is VALID [2020-07-29 01:00:53,925 INFO L280 TraceCheckUtils]: 46: Hoare triple {6405#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (<= 1 |foo_#in~size|) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} assume !(~i~0 < ~size); {6405#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (<= 1 |foo_#in~size|) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} is VALID [2020-07-29 01:00:53,926 INFO L280 TraceCheckUtils]: 47: Hoare triple {6405#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (<= 1 |foo_#in~size|) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} #res := ~i~0; {6405#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (<= 1 |foo_#in~size|) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} is VALID [2020-07-29 01:00:53,926 INFO L280 TraceCheckUtils]: 48: Hoare triple {6405#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (<= 1 |foo_#in~size|) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} assume true; {6405#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (<= 1 |foo_#in~size|) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} is VALID [2020-07-29 01:00:53,929 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {6405#(and (exists ((|v_main_~#mask~0.base_BEFORE_CALL_8| Int)) (= (select |#length| |v_main_~#mask~0.base_BEFORE_CALL_8|) 32)) (<= 1 |foo_#in~size|) (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 128 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))))} {6394#(and (= 32 (select |#length| main_~c~0.base)) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)) (< main_~i~1 32))} #78#return; {6445#(and (<= 1 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)) (< main_~i~1 32) (exists ((main_~c~0.base Int)) (= 32 (select |#length| main_~c~0.base))))} is VALID [2020-07-29 01:00:53,930 INFO L280 TraceCheckUtils]: 50: Hoare triple {6445#(and (<= 1 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)) (< main_~i~1 32) (exists ((main_~c~0.base Int)) (= 32 (select |#length| main_~c~0.base))))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {6445#(and (<= 1 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)) (< main_~i~1 32) (exists ((main_~c~0.base Int)) (= 32 (select |#length| main_~c~0.base))))} is VALID [2020-07-29 01:00:53,931 INFO L280 TraceCheckUtils]: 51: Hoare triple {6445#(and (<= 1 main_~i~1) (= 0 |main_~#b~0.offset|) (= 128 (select |#length| |main_~#b~0.base|)) (< main_~i~1 32) (exists ((main_~c~0.base Int)) (= 32 (select |#length| main_~c~0.base))))} assume !(4 + (~#b~0.offset + 4 * ~i~1) <= #length[~#b~0.base] && 0 <= ~#b~0.offset + 4 * ~i~1); {6252#false} is VALID [2020-07-29 01:00:53,943 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2020-07-29 01:00:53,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:00:53,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 11 [2020-07-29 01:00:53,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002895018] [2020-07-29 01:00:53,944 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2020-07-29 01:00:53,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:00:53,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-29 01:00:54,033 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:54,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-29 01:00:54,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:00:54,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-29 01:00:54,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2020-07-29 01:00:54,035 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand 12 states. [2020-07-29 01:00:56,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:56,100 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2020-07-29 01:00:56,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-29 01:00:56,100 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2020-07-29 01:00:56,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:00:56,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 01:00:56,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 96 transitions. [2020-07-29 01:00:56,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 01:00:56,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 96 transitions. [2020-07-29 01:00:56,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 96 transitions. [2020-07-29 01:00:56,242 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:56,245 INFO L225 Difference]: With dead ends: 111 [2020-07-29 01:00:56,245 INFO L226 Difference]: Without dead ends: 111 [2020-07-29 01:00:56,246 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2020-07-29 01:00:56,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-07-29 01:00:56,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 102. [2020-07-29 01:00:56,252 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:00:56,253 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand 102 states. [2020-07-29 01:00:56,253 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 102 states. [2020-07-29 01:00:56,253 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 102 states. [2020-07-29 01:00:56,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:56,257 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2020-07-29 01:00:56,257 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2020-07-29 01:00:56,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:56,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:56,259 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 111 states. [2020-07-29 01:00:56,259 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 111 states. [2020-07-29 01:00:56,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:56,264 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2020-07-29 01:00:56,264 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2020-07-29 01:00:56,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:56,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:56,265 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:00:56,265 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:00:56,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-07-29 01:00:56,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2020-07-29 01:00:56,269 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 52 [2020-07-29 01:00:56,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:00:56,269 INFO L479 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2020-07-29 01:00:56,270 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-29 01:00:56,270 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2020-07-29 01:00:56,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-07-29 01:00:56,271 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:00:56,271 INFO L422 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:00:56,484 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-07-29 01:00:56,485 INFO L427 AbstractCegarLoop]: === Iteration 18 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:00:56,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:00:56,485 INFO L82 PathProgramCache]: Analyzing trace with hash -987396443, now seen corresponding path program 3 times [2020-07-29 01:00:56,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:00:56,486 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107183973] [2020-07-29 01:00:56,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:00:56,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:56,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:00:56,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:56,622 INFO L280 TraceCheckUtils]: 0: Hoare triple {6953#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {6915#true} is VALID [2020-07-29 01:00:56,623 INFO L280 TraceCheckUtils]: 1: Hoare triple {6915#true} assume true; {6915#true} is VALID [2020-07-29 01:00:56,623 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {6915#true} {6915#true} #74#return; {6915#true} is VALID [2020-07-29 01:00:56,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-07-29 01:00:56,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:56,635 INFO L280 TraceCheckUtils]: 0: Hoare triple {6915#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {6915#true} is VALID [2020-07-29 01:00:56,635 INFO L280 TraceCheckUtils]: 1: Hoare triple {6915#true} assume !(~i~0 < ~size); {6915#true} is VALID [2020-07-29 01:00:56,635 INFO L280 TraceCheckUtils]: 2: Hoare triple {6915#true} #res := ~i~0; {6915#true} is VALID [2020-07-29 01:00:56,636 INFO L280 TraceCheckUtils]: 3: Hoare triple {6915#true} assume true; {6915#true} is VALID [2020-07-29 01:00:56,636 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {6915#true} {6915#true} #78#return; {6915#true} is VALID [2020-07-29 01:00:56,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-07-29 01:00:56,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:56,641 INFO L280 TraceCheckUtils]: 0: Hoare triple {6915#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {6915#true} is VALID [2020-07-29 01:00:56,642 INFO L280 TraceCheckUtils]: 1: Hoare triple {6915#true} assume !!(~i~0 < ~size); {6915#true} is VALID [2020-07-29 01:00:56,642 INFO L280 TraceCheckUtils]: 2: Hoare triple {6915#true} assume 0 <= ~i~0 && ~i~0 < 32; {6915#true} is VALID [2020-07-29 01:00:56,642 INFO L280 TraceCheckUtils]: 3: Hoare triple {6915#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {6915#true} is VALID [2020-07-29 01:00:56,642 INFO L280 TraceCheckUtils]: 4: Hoare triple {6915#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6915#true} is VALID [2020-07-29 01:00:56,642 INFO L280 TraceCheckUtils]: 5: Hoare triple {6915#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6915#true} is VALID [2020-07-29 01:00:56,643 INFO L280 TraceCheckUtils]: 6: Hoare triple {6915#true} assume !(~i~0 < ~size); {6915#true} is VALID [2020-07-29 01:00:56,643 INFO L280 TraceCheckUtils]: 7: Hoare triple {6915#true} #res := ~i~0; {6915#true} is VALID [2020-07-29 01:00:56,643 INFO L280 TraceCheckUtils]: 8: Hoare triple {6915#true} assume true; {6915#true} is VALID [2020-07-29 01:00:56,643 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {6915#true} {6915#true} #78#return; {6915#true} is VALID [2020-07-29 01:00:56,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-07-29 01:00:56,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:56,650 INFO L280 TraceCheckUtils]: 0: Hoare triple {6915#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {6915#true} is VALID [2020-07-29 01:00:56,651 INFO L280 TraceCheckUtils]: 1: Hoare triple {6915#true} assume !!(~i~0 < ~size); {6915#true} is VALID [2020-07-29 01:00:56,651 INFO L280 TraceCheckUtils]: 2: Hoare triple {6915#true} assume 0 <= ~i~0 && ~i~0 < 32; {6915#true} is VALID [2020-07-29 01:00:56,651 INFO L280 TraceCheckUtils]: 3: Hoare triple {6915#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {6915#true} is VALID [2020-07-29 01:00:56,652 INFO L280 TraceCheckUtils]: 4: Hoare triple {6915#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6915#true} is VALID [2020-07-29 01:00:56,652 INFO L280 TraceCheckUtils]: 5: Hoare triple {6915#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6915#true} is VALID [2020-07-29 01:00:56,652 INFO L280 TraceCheckUtils]: 6: Hoare triple {6915#true} assume !!(~i~0 < ~size); {6915#true} is VALID [2020-07-29 01:00:56,652 INFO L280 TraceCheckUtils]: 7: Hoare triple {6915#true} assume 0 <= ~i~0 && ~i~0 < 32; {6915#true} is VALID [2020-07-29 01:00:56,652 INFO L280 TraceCheckUtils]: 8: Hoare triple {6915#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {6915#true} is VALID [2020-07-29 01:00:56,653 INFO L280 TraceCheckUtils]: 9: Hoare triple {6915#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6915#true} is VALID [2020-07-29 01:00:56,653 INFO L280 TraceCheckUtils]: 10: Hoare triple {6915#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6915#true} is VALID [2020-07-29 01:00:56,653 INFO L280 TraceCheckUtils]: 11: Hoare triple {6915#true} assume !(~i~0 < ~size); {6915#true} is VALID [2020-07-29 01:00:56,653 INFO L280 TraceCheckUtils]: 12: Hoare triple {6915#true} #res := ~i~0; {6915#true} is VALID [2020-07-29 01:00:56,654 INFO L280 TraceCheckUtils]: 13: Hoare triple {6915#true} assume true; {6915#true} is VALID [2020-07-29 01:00:56,654 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {6915#true} {6915#true} #78#return; {6915#true} is VALID [2020-07-29 01:00:56,656 INFO L263 TraceCheckUtils]: 0: Hoare triple {6915#true} call ULTIMATE.init(); {6953#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:00:56,656 INFO L280 TraceCheckUtils]: 1: Hoare triple {6953#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {6915#true} is VALID [2020-07-29 01:00:56,656 INFO L280 TraceCheckUtils]: 2: Hoare triple {6915#true} assume true; {6915#true} is VALID [2020-07-29 01:00:56,656 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6915#true} {6915#true} #74#return; {6915#true} is VALID [2020-07-29 01:00:56,657 INFO L263 TraceCheckUtils]: 4: Hoare triple {6915#true} call #t~ret6 := main(); {6915#true} is VALID [2020-07-29 01:00:56,657 INFO L280 TraceCheckUtils]: 5: Hoare triple {6915#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(128);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {6915#true} is VALID [2020-07-29 01:00:56,657 INFO L280 TraceCheckUtils]: 6: Hoare triple {6915#true} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {6915#true} is VALID [2020-07-29 01:00:56,657 INFO L263 TraceCheckUtils]: 7: Hoare triple {6915#true} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {6915#true} is VALID [2020-07-29 01:00:56,657 INFO L280 TraceCheckUtils]: 8: Hoare triple {6915#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {6915#true} is VALID [2020-07-29 01:00:56,657 INFO L280 TraceCheckUtils]: 9: Hoare triple {6915#true} assume !(~i~0 < ~size); {6915#true} is VALID [2020-07-29 01:00:56,658 INFO L280 TraceCheckUtils]: 10: Hoare triple {6915#true} #res := ~i~0; {6915#true} is VALID [2020-07-29 01:00:56,658 INFO L280 TraceCheckUtils]: 11: Hoare triple {6915#true} assume true; {6915#true} is VALID [2020-07-29 01:00:56,658 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {6915#true} {6915#true} #78#return; {6915#true} is VALID [2020-07-29 01:00:56,659 INFO L280 TraceCheckUtils]: 13: Hoare triple {6915#true} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {6915#true} is VALID [2020-07-29 01:00:56,659 INFO L280 TraceCheckUtils]: 14: Hoare triple {6915#true} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {6915#true} is VALID [2020-07-29 01:00:56,659 INFO L280 TraceCheckUtils]: 15: Hoare triple {6915#true} havoc #t~ret3; {6915#true} is VALID [2020-07-29 01:00:56,659 INFO L280 TraceCheckUtils]: 16: Hoare triple {6915#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6915#true} is VALID [2020-07-29 01:00:56,660 INFO L280 TraceCheckUtils]: 17: Hoare triple {6915#true} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {6915#true} is VALID [2020-07-29 01:00:56,660 INFO L263 TraceCheckUtils]: 18: Hoare triple {6915#true} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {6915#true} is VALID [2020-07-29 01:00:56,660 INFO L280 TraceCheckUtils]: 19: Hoare triple {6915#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {6915#true} is VALID [2020-07-29 01:00:56,660 INFO L280 TraceCheckUtils]: 20: Hoare triple {6915#true} assume !!(~i~0 < ~size); {6915#true} is VALID [2020-07-29 01:00:56,660 INFO L280 TraceCheckUtils]: 21: Hoare triple {6915#true} assume 0 <= ~i~0 && ~i~0 < 32; {6915#true} is VALID [2020-07-29 01:00:56,660 INFO L280 TraceCheckUtils]: 22: Hoare triple {6915#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {6915#true} is VALID [2020-07-29 01:00:56,661 INFO L280 TraceCheckUtils]: 23: Hoare triple {6915#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6915#true} is VALID [2020-07-29 01:00:56,661 INFO L280 TraceCheckUtils]: 24: Hoare triple {6915#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6915#true} is VALID [2020-07-29 01:00:56,666 INFO L280 TraceCheckUtils]: 25: Hoare triple {6915#true} assume !(~i~0 < ~size); {6915#true} is VALID [2020-07-29 01:00:56,667 INFO L280 TraceCheckUtils]: 26: Hoare triple {6915#true} #res := ~i~0; {6915#true} is VALID [2020-07-29 01:00:56,667 INFO L280 TraceCheckUtils]: 27: Hoare triple {6915#true} assume true; {6915#true} is VALID [2020-07-29 01:00:56,667 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {6915#true} {6915#true} #78#return; {6915#true} is VALID [2020-07-29 01:00:56,668 INFO L280 TraceCheckUtils]: 29: Hoare triple {6915#true} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {6915#true} is VALID [2020-07-29 01:00:56,668 INFO L280 TraceCheckUtils]: 30: Hoare triple {6915#true} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {6915#true} is VALID [2020-07-29 01:00:56,668 INFO L280 TraceCheckUtils]: 31: Hoare triple {6915#true} havoc #t~ret3; {6915#true} is VALID [2020-07-29 01:00:56,669 INFO L280 TraceCheckUtils]: 32: Hoare triple {6915#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6915#true} is VALID [2020-07-29 01:00:56,669 INFO L280 TraceCheckUtils]: 33: Hoare triple {6915#true} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {6915#true} is VALID [2020-07-29 01:00:56,669 INFO L263 TraceCheckUtils]: 34: Hoare triple {6915#true} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {6915#true} is VALID [2020-07-29 01:00:56,669 INFO L280 TraceCheckUtils]: 35: Hoare triple {6915#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {6915#true} is VALID [2020-07-29 01:00:56,670 INFO L280 TraceCheckUtils]: 36: Hoare triple {6915#true} assume !!(~i~0 < ~size); {6915#true} is VALID [2020-07-29 01:00:56,670 INFO L280 TraceCheckUtils]: 37: Hoare triple {6915#true} assume 0 <= ~i~0 && ~i~0 < 32; {6915#true} is VALID [2020-07-29 01:00:56,670 INFO L280 TraceCheckUtils]: 38: Hoare triple {6915#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {6915#true} is VALID [2020-07-29 01:00:56,671 INFO L280 TraceCheckUtils]: 39: Hoare triple {6915#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6915#true} is VALID [2020-07-29 01:00:56,671 INFO L280 TraceCheckUtils]: 40: Hoare triple {6915#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6915#true} is VALID [2020-07-29 01:00:56,671 INFO L280 TraceCheckUtils]: 41: Hoare triple {6915#true} assume !!(~i~0 < ~size); {6915#true} is VALID [2020-07-29 01:00:56,672 INFO L280 TraceCheckUtils]: 42: Hoare triple {6915#true} assume 0 <= ~i~0 && ~i~0 < 32; {6915#true} is VALID [2020-07-29 01:00:56,673 INFO L280 TraceCheckUtils]: 43: Hoare triple {6915#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {6915#true} is VALID [2020-07-29 01:00:56,673 INFO L280 TraceCheckUtils]: 44: Hoare triple {6915#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6915#true} is VALID [2020-07-29 01:00:56,674 INFO L280 TraceCheckUtils]: 45: Hoare triple {6915#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6915#true} is VALID [2020-07-29 01:00:56,674 INFO L280 TraceCheckUtils]: 46: Hoare triple {6915#true} assume !(~i~0 < ~size); {6915#true} is VALID [2020-07-29 01:00:56,676 INFO L280 TraceCheckUtils]: 47: Hoare triple {6915#true} #res := ~i~0; {6915#true} is VALID [2020-07-29 01:00:56,676 INFO L280 TraceCheckUtils]: 48: Hoare triple {6915#true} assume true; {6915#true} is VALID [2020-07-29 01:00:56,676 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {6915#true} {6915#true} #78#return; {6915#true} is VALID [2020-07-29 01:00:56,677 INFO L280 TraceCheckUtils]: 50: Hoare triple {6915#true} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {6915#true} is VALID [2020-07-29 01:00:56,677 INFO L280 TraceCheckUtils]: 51: Hoare triple {6915#true} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {6915#true} is VALID [2020-07-29 01:00:56,677 INFO L280 TraceCheckUtils]: 52: Hoare triple {6915#true} havoc #t~ret3; {6915#true} is VALID [2020-07-29 01:00:56,677 INFO L280 TraceCheckUtils]: 53: Hoare triple {6915#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6915#true} is VALID [2020-07-29 01:00:56,678 INFO L280 TraceCheckUtils]: 54: Hoare triple {6915#true} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {6915#true} is VALID [2020-07-29 01:00:56,678 INFO L263 TraceCheckUtils]: 55: Hoare triple {6915#true} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {6915#true} is VALID [2020-07-29 01:00:56,680 INFO L280 TraceCheckUtils]: 56: Hoare triple {6915#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {6950#(= 0 foo_~i~0)} is VALID [2020-07-29 01:00:56,680 INFO L280 TraceCheckUtils]: 57: Hoare triple {6950#(= 0 foo_~i~0)} assume !!(~i~0 < ~size); {6950#(= 0 foo_~i~0)} is VALID [2020-07-29 01:00:56,681 INFO L280 TraceCheckUtils]: 58: Hoare triple {6950#(= 0 foo_~i~0)} assume 0 <= ~i~0 && ~i~0 < 32; {6950#(= 0 foo_~i~0)} is VALID [2020-07-29 01:00:56,684 INFO L280 TraceCheckUtils]: 59: Hoare triple {6950#(= 0 foo_~i~0)} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {6950#(= 0 foo_~i~0)} is VALID [2020-07-29 01:00:56,684 INFO L280 TraceCheckUtils]: 60: Hoare triple {6950#(= 0 foo_~i~0)} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6950#(= 0 foo_~i~0)} is VALID [2020-07-29 01:00:56,685 INFO L280 TraceCheckUtils]: 61: Hoare triple {6950#(= 0 foo_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6951#(and (<= 1 foo_~i~0) (<= foo_~i~0 1))} is VALID [2020-07-29 01:00:56,686 INFO L280 TraceCheckUtils]: 62: Hoare triple {6951#(and (<= 1 foo_~i~0) (<= foo_~i~0 1))} assume !!(~i~0 < ~size); {6951#(and (<= 1 foo_~i~0) (<= foo_~i~0 1))} is VALID [2020-07-29 01:00:56,687 INFO L280 TraceCheckUtils]: 63: Hoare triple {6951#(and (<= 1 foo_~i~0) (<= foo_~i~0 1))} assume 0 <= ~i~0 && ~i~0 < 32; {6951#(and (<= 1 foo_~i~0) (<= foo_~i~0 1))} is VALID [2020-07-29 01:00:56,688 INFO L280 TraceCheckUtils]: 64: Hoare triple {6951#(and (<= 1 foo_~i~0) (<= foo_~i~0 1))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {6951#(and (<= 1 foo_~i~0) (<= foo_~i~0 1))} is VALID [2020-07-29 01:00:56,689 INFO L280 TraceCheckUtils]: 65: Hoare triple {6951#(and (<= 1 foo_~i~0) (<= foo_~i~0 1))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6951#(and (<= 1 foo_~i~0) (<= foo_~i~0 1))} is VALID [2020-07-29 01:00:56,690 INFO L280 TraceCheckUtils]: 66: Hoare triple {6951#(and (<= 1 foo_~i~0) (<= foo_~i~0 1))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6952#(and (<= 2 foo_~i~0) (<= foo_~i~0 2))} is VALID [2020-07-29 01:00:56,691 INFO L280 TraceCheckUtils]: 67: Hoare triple {6952#(and (<= 2 foo_~i~0) (<= foo_~i~0 2))} assume !!(~i~0 < ~size); {6952#(and (<= 2 foo_~i~0) (<= foo_~i~0 2))} is VALID [2020-07-29 01:00:56,691 INFO L280 TraceCheckUtils]: 68: Hoare triple {6952#(and (<= 2 foo_~i~0) (<= foo_~i~0 2))} assume !(0 <= ~i~0 && ~i~0 < 32); {6916#false} is VALID [2020-07-29 01:00:56,695 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 45 proven. 9 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2020-07-29 01:00:56,695 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107183973] [2020-07-29 01:00:56,696 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818145370] [2020-07-29 01:00:56,696 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:00:56,758 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-07-29 01:00:56,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:00:56,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:00:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:56,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:00:56,999 INFO L263 TraceCheckUtils]: 0: Hoare triple {6915#true} call ULTIMATE.init(); {6915#true} is VALID [2020-07-29 01:00:57,000 INFO L280 TraceCheckUtils]: 1: Hoare triple {6915#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {6915#true} is VALID [2020-07-29 01:00:57,000 INFO L280 TraceCheckUtils]: 2: Hoare triple {6915#true} assume true; {6915#true} is VALID [2020-07-29 01:00:57,000 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6915#true} {6915#true} #74#return; {6915#true} is VALID [2020-07-29 01:00:57,000 INFO L263 TraceCheckUtils]: 4: Hoare triple {6915#true} call #t~ret6 := main(); {6915#true} is VALID [2020-07-29 01:00:57,000 INFO L280 TraceCheckUtils]: 5: Hoare triple {6915#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(128);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {6915#true} is VALID [2020-07-29 01:00:57,001 INFO L280 TraceCheckUtils]: 6: Hoare triple {6915#true} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {6915#true} is VALID [2020-07-29 01:00:57,001 INFO L263 TraceCheckUtils]: 7: Hoare triple {6915#true} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {6915#true} is VALID [2020-07-29 01:00:57,001 INFO L280 TraceCheckUtils]: 8: Hoare triple {6915#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {6915#true} is VALID [2020-07-29 01:00:57,001 INFO L280 TraceCheckUtils]: 9: Hoare triple {6915#true} assume !(~i~0 < ~size); {6915#true} is VALID [2020-07-29 01:00:57,002 INFO L280 TraceCheckUtils]: 10: Hoare triple {6915#true} #res := ~i~0; {6915#true} is VALID [2020-07-29 01:00:57,002 INFO L280 TraceCheckUtils]: 11: Hoare triple {6915#true} assume true; {6915#true} is VALID [2020-07-29 01:00:57,002 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {6915#true} {6915#true} #78#return; {6915#true} is VALID [2020-07-29 01:00:57,002 INFO L280 TraceCheckUtils]: 13: Hoare triple {6915#true} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {6915#true} is VALID [2020-07-29 01:00:57,002 INFO L280 TraceCheckUtils]: 14: Hoare triple {6915#true} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {6915#true} is VALID [2020-07-29 01:00:57,003 INFO L280 TraceCheckUtils]: 15: Hoare triple {6915#true} havoc #t~ret3; {6915#true} is VALID [2020-07-29 01:00:57,003 INFO L280 TraceCheckUtils]: 16: Hoare triple {6915#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6915#true} is VALID [2020-07-29 01:00:57,003 INFO L280 TraceCheckUtils]: 17: Hoare triple {6915#true} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {6915#true} is VALID [2020-07-29 01:00:57,004 INFO L263 TraceCheckUtils]: 18: Hoare triple {6915#true} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {6915#true} is VALID [2020-07-29 01:00:57,004 INFO L280 TraceCheckUtils]: 19: Hoare triple {6915#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {6915#true} is VALID [2020-07-29 01:00:57,004 INFO L280 TraceCheckUtils]: 20: Hoare triple {6915#true} assume !!(~i~0 < ~size); {6915#true} is VALID [2020-07-29 01:00:57,004 INFO L280 TraceCheckUtils]: 21: Hoare triple {6915#true} assume 0 <= ~i~0 && ~i~0 < 32; {6915#true} is VALID [2020-07-29 01:00:57,004 INFO L280 TraceCheckUtils]: 22: Hoare triple {6915#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {6915#true} is VALID [2020-07-29 01:00:57,005 INFO L280 TraceCheckUtils]: 23: Hoare triple {6915#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6915#true} is VALID [2020-07-29 01:00:57,005 INFO L280 TraceCheckUtils]: 24: Hoare triple {6915#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6915#true} is VALID [2020-07-29 01:00:57,005 INFO L280 TraceCheckUtils]: 25: Hoare triple {6915#true} assume !(~i~0 < ~size); {6915#true} is VALID [2020-07-29 01:00:57,005 INFO L280 TraceCheckUtils]: 26: Hoare triple {6915#true} #res := ~i~0; {6915#true} is VALID [2020-07-29 01:00:57,005 INFO L280 TraceCheckUtils]: 27: Hoare triple {6915#true} assume true; {6915#true} is VALID [2020-07-29 01:00:57,006 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {6915#true} {6915#true} #78#return; {6915#true} is VALID [2020-07-29 01:00:57,006 INFO L280 TraceCheckUtils]: 29: Hoare triple {6915#true} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {6915#true} is VALID [2020-07-29 01:00:57,006 INFO L280 TraceCheckUtils]: 30: Hoare triple {6915#true} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {6915#true} is VALID [2020-07-29 01:00:57,006 INFO L280 TraceCheckUtils]: 31: Hoare triple {6915#true} havoc #t~ret3; {6915#true} is VALID [2020-07-29 01:00:57,007 INFO L280 TraceCheckUtils]: 32: Hoare triple {6915#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6915#true} is VALID [2020-07-29 01:00:57,007 INFO L280 TraceCheckUtils]: 33: Hoare triple {6915#true} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {6915#true} is VALID [2020-07-29 01:00:57,007 INFO L263 TraceCheckUtils]: 34: Hoare triple {6915#true} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {6915#true} is VALID [2020-07-29 01:00:57,007 INFO L280 TraceCheckUtils]: 35: Hoare triple {6915#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {6915#true} is VALID [2020-07-29 01:00:57,008 INFO L280 TraceCheckUtils]: 36: Hoare triple {6915#true} assume !!(~i~0 < ~size); {6915#true} is VALID [2020-07-29 01:00:57,008 INFO L280 TraceCheckUtils]: 37: Hoare triple {6915#true} assume 0 <= ~i~0 && ~i~0 < 32; {6915#true} is VALID [2020-07-29 01:00:57,008 INFO L280 TraceCheckUtils]: 38: Hoare triple {6915#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {6915#true} is VALID [2020-07-29 01:00:57,008 INFO L280 TraceCheckUtils]: 39: Hoare triple {6915#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6915#true} is VALID [2020-07-29 01:00:57,009 INFO L280 TraceCheckUtils]: 40: Hoare triple {6915#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6915#true} is VALID [2020-07-29 01:00:57,009 INFO L280 TraceCheckUtils]: 41: Hoare triple {6915#true} assume !!(~i~0 < ~size); {6915#true} is VALID [2020-07-29 01:00:57,009 INFO L280 TraceCheckUtils]: 42: Hoare triple {6915#true} assume 0 <= ~i~0 && ~i~0 < 32; {6915#true} is VALID [2020-07-29 01:00:57,009 INFO L280 TraceCheckUtils]: 43: Hoare triple {6915#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {6915#true} is VALID [2020-07-29 01:00:57,010 INFO L280 TraceCheckUtils]: 44: Hoare triple {6915#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6915#true} is VALID [2020-07-29 01:00:57,010 INFO L280 TraceCheckUtils]: 45: Hoare triple {6915#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6915#true} is VALID [2020-07-29 01:00:57,010 INFO L280 TraceCheckUtils]: 46: Hoare triple {6915#true} assume !(~i~0 < ~size); {6915#true} is VALID [2020-07-29 01:00:57,010 INFO L280 TraceCheckUtils]: 47: Hoare triple {6915#true} #res := ~i~0; {6915#true} is VALID [2020-07-29 01:00:57,011 INFO L280 TraceCheckUtils]: 48: Hoare triple {6915#true} assume true; {6915#true} is VALID [2020-07-29 01:00:57,011 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {6915#true} {6915#true} #78#return; {6915#true} is VALID [2020-07-29 01:00:57,011 INFO L280 TraceCheckUtils]: 50: Hoare triple {6915#true} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {6915#true} is VALID [2020-07-29 01:00:57,011 INFO L280 TraceCheckUtils]: 51: Hoare triple {6915#true} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {6915#true} is VALID [2020-07-29 01:00:57,012 INFO L280 TraceCheckUtils]: 52: Hoare triple {6915#true} havoc #t~ret3; {6915#true} is VALID [2020-07-29 01:00:57,012 INFO L280 TraceCheckUtils]: 53: Hoare triple {6915#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6915#true} is VALID [2020-07-29 01:00:57,012 INFO L280 TraceCheckUtils]: 54: Hoare triple {6915#true} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {7119#(< main_~i~1 32)} is VALID [2020-07-29 01:00:57,014 INFO L263 TraceCheckUtils]: 55: Hoare triple {7119#(< main_~i~1 32)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {7123#(<= |foo_#in~size| 31)} is VALID [2020-07-29 01:00:57,015 INFO L280 TraceCheckUtils]: 56: Hoare triple {7123#(<= |foo_#in~size| 31)} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {7127#(<= foo_~size 31)} is VALID [2020-07-29 01:00:57,015 INFO L280 TraceCheckUtils]: 57: Hoare triple {7127#(<= foo_~size 31)} assume !!(~i~0 < ~size); {7127#(<= foo_~size 31)} is VALID [2020-07-29 01:00:57,016 INFO L280 TraceCheckUtils]: 58: Hoare triple {7127#(<= foo_~size 31)} assume 0 <= ~i~0 && ~i~0 < 32; {7127#(<= foo_~size 31)} is VALID [2020-07-29 01:00:57,016 INFO L280 TraceCheckUtils]: 59: Hoare triple {7127#(<= foo_~size 31)} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {7127#(<= foo_~size 31)} is VALID [2020-07-29 01:00:57,017 INFO L280 TraceCheckUtils]: 60: Hoare triple {7127#(<= foo_~size 31)} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {7127#(<= foo_~size 31)} is VALID [2020-07-29 01:00:57,017 INFO L280 TraceCheckUtils]: 61: Hoare triple {7127#(<= foo_~size 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7127#(<= foo_~size 31)} is VALID [2020-07-29 01:00:57,018 INFO L280 TraceCheckUtils]: 62: Hoare triple {7127#(<= foo_~size 31)} assume !!(~i~0 < ~size); {7127#(<= foo_~size 31)} is VALID [2020-07-29 01:00:57,019 INFO L280 TraceCheckUtils]: 63: Hoare triple {7127#(<= foo_~size 31)} assume 0 <= ~i~0 && ~i~0 < 32; {7149#(and (<= 0 foo_~i~0) (<= foo_~size 31))} is VALID [2020-07-29 01:00:57,020 INFO L280 TraceCheckUtils]: 64: Hoare triple {7149#(and (<= 0 foo_~i~0) (<= foo_~size 31))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {7149#(and (<= 0 foo_~i~0) (<= foo_~size 31))} is VALID [2020-07-29 01:00:57,021 INFO L280 TraceCheckUtils]: 65: Hoare triple {7149#(and (<= 0 foo_~i~0) (<= foo_~size 31))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {7149#(and (<= 0 foo_~i~0) (<= foo_~size 31))} is VALID [2020-07-29 01:00:57,022 INFO L280 TraceCheckUtils]: 66: Hoare triple {7149#(and (<= 0 foo_~i~0) (<= foo_~size 31))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7159#(and (<= foo_~size 31) (<= 1 foo_~i~0))} is VALID [2020-07-29 01:00:57,023 INFO L280 TraceCheckUtils]: 67: Hoare triple {7159#(and (<= foo_~size 31) (<= 1 foo_~i~0))} assume !!(~i~0 < ~size); {7163#(and (<= foo_~i~0 30) (<= 1 foo_~i~0))} is VALID [2020-07-29 01:00:57,023 INFO L280 TraceCheckUtils]: 68: Hoare triple {7163#(and (<= foo_~i~0 30) (<= 1 foo_~i~0))} assume !(0 <= ~i~0 && ~i~0 < 32); {6916#false} is VALID [2020-07-29 01:00:57,027 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2020-07-29 01:00:57,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:00:57,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 11 [2020-07-29 01:00:57,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485735156] [2020-07-29 01:00:57,029 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 69 [2020-07-29 01:00:57,029 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:00:57,030 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-29 01:00:57,083 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:57,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-29 01:00:57,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:00:57,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-29 01:00:57,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2020-07-29 01:00:57,084 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand 12 states. [2020-07-29 01:00:58,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:58,048 INFO L93 Difference]: Finished difference Result 118 states and 125 transitions. [2020-07-29 01:00:58,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-29 01:00:58,048 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 69 [2020-07-29 01:00:58,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:00:58,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 01:00:58,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 71 transitions. [2020-07-29 01:00:58,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 01:00:58,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 71 transitions. [2020-07-29 01:00:58,054 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 71 transitions. [2020-07-29 01:00:58,152 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:58,154 INFO L225 Difference]: With dead ends: 118 [2020-07-29 01:00:58,154 INFO L226 Difference]: Without dead ends: 118 [2020-07-29 01:00:58,155 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2020-07-29 01:00:58,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-07-29 01:00:58,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 100. [2020-07-29 01:00:58,158 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:00:58,159 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand 100 states. [2020-07-29 01:00:58,159 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 100 states. [2020-07-29 01:00:58,159 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 100 states. [2020-07-29 01:00:58,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:58,163 INFO L93 Difference]: Finished difference Result 118 states and 125 transitions. [2020-07-29 01:00:58,164 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2020-07-29 01:00:58,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:58,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:58,165 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 118 states. [2020-07-29 01:00:58,165 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 118 states. [2020-07-29 01:00:58,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:58,169 INFO L93 Difference]: Finished difference Result 118 states and 125 transitions. [2020-07-29 01:00:58,169 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2020-07-29 01:00:58,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:58,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:58,170 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:00:58,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:00:58,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-07-29 01:00:58,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2020-07-29 01:00:58,173 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 69 [2020-07-29 01:00:58,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:00:58,174 INFO L479 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2020-07-29 01:00:58,174 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-29 01:00:58,174 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2020-07-29 01:00:58,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-07-29 01:00:58,175 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:00:58,175 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:00:58,388 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-07-29 01:00:58,389 INFO L427 AbstractCegarLoop]: === Iteration 19 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:00:58,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:00:58,389 INFO L82 PathProgramCache]: Analyzing trace with hash 267240299, now seen corresponding path program 1 times [2020-07-29 01:00:58,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:00:58,390 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082586384] [2020-07-29 01:00:58,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:00:58,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:58,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:00:58,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:58,489 INFO L280 TraceCheckUtils]: 0: Hoare triple {7687#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {7632#true} is VALID [2020-07-29 01:00:58,489 INFO L280 TraceCheckUtils]: 1: Hoare triple {7632#true} assume true; {7632#true} is VALID [2020-07-29 01:00:58,489 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {7632#true} {7632#true} #74#return; {7632#true} is VALID [2020-07-29 01:00:58,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-07-29 01:00:58,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:58,493 INFO L280 TraceCheckUtils]: 0: Hoare triple {7632#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {7632#true} is VALID [2020-07-29 01:00:58,493 INFO L280 TraceCheckUtils]: 1: Hoare triple {7632#true} assume !(~i~0 < ~size); {7632#true} is VALID [2020-07-29 01:00:58,493 INFO L280 TraceCheckUtils]: 2: Hoare triple {7632#true} #res := ~i~0; {7632#true} is VALID [2020-07-29 01:00:58,493 INFO L280 TraceCheckUtils]: 3: Hoare triple {7632#true} assume true; {7632#true} is VALID [2020-07-29 01:00:58,494 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {7632#true} {7637#(= 0 main_~i~1)} #78#return; {7637#(= 0 main_~i~1)} is VALID [2020-07-29 01:00:58,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-07-29 01:00:58,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:58,501 INFO L280 TraceCheckUtils]: 0: Hoare triple {7632#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {7632#true} is VALID [2020-07-29 01:00:58,501 INFO L280 TraceCheckUtils]: 1: Hoare triple {7632#true} assume !!(~i~0 < ~size); {7632#true} is VALID [2020-07-29 01:00:58,501 INFO L280 TraceCheckUtils]: 2: Hoare triple {7632#true} assume 0 <= ~i~0 && ~i~0 < 32; {7632#true} is VALID [2020-07-29 01:00:58,501 INFO L280 TraceCheckUtils]: 3: Hoare triple {7632#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {7632#true} is VALID [2020-07-29 01:00:58,502 INFO L280 TraceCheckUtils]: 4: Hoare triple {7632#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {7632#true} is VALID [2020-07-29 01:00:58,502 INFO L280 TraceCheckUtils]: 5: Hoare triple {7632#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7632#true} is VALID [2020-07-29 01:00:58,502 INFO L280 TraceCheckUtils]: 6: Hoare triple {7632#true} assume !(~i~0 < ~size); {7632#true} is VALID [2020-07-29 01:00:58,502 INFO L280 TraceCheckUtils]: 7: Hoare triple {7632#true} #res := ~i~0; {7632#true} is VALID [2020-07-29 01:00:58,503 INFO L280 TraceCheckUtils]: 8: Hoare triple {7632#true} assume true; {7632#true} is VALID [2020-07-29 01:00:58,504 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {7632#true} {7643#(<= main_~i~1 1)} #78#return; {7643#(<= main_~i~1 1)} is VALID [2020-07-29 01:00:58,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-07-29 01:00:58,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:58,515 INFO L280 TraceCheckUtils]: 0: Hoare triple {7632#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {7632#true} is VALID [2020-07-29 01:00:58,515 INFO L280 TraceCheckUtils]: 1: Hoare triple {7632#true} assume !!(~i~0 < ~size); {7632#true} is VALID [2020-07-29 01:00:58,515 INFO L280 TraceCheckUtils]: 2: Hoare triple {7632#true} assume 0 <= ~i~0 && ~i~0 < 32; {7632#true} is VALID [2020-07-29 01:00:58,515 INFO L280 TraceCheckUtils]: 3: Hoare triple {7632#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {7632#true} is VALID [2020-07-29 01:00:58,516 INFO L280 TraceCheckUtils]: 4: Hoare triple {7632#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {7632#true} is VALID [2020-07-29 01:00:58,516 INFO L280 TraceCheckUtils]: 5: Hoare triple {7632#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7632#true} is VALID [2020-07-29 01:00:58,516 INFO L280 TraceCheckUtils]: 6: Hoare triple {7632#true} assume !!(~i~0 < ~size); {7632#true} is VALID [2020-07-29 01:00:58,516 INFO L280 TraceCheckUtils]: 7: Hoare triple {7632#true} assume 0 <= ~i~0 && ~i~0 < 32; {7632#true} is VALID [2020-07-29 01:00:58,516 INFO L280 TraceCheckUtils]: 8: Hoare triple {7632#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {7632#true} is VALID [2020-07-29 01:00:58,516 INFO L280 TraceCheckUtils]: 9: Hoare triple {7632#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {7632#true} is VALID [2020-07-29 01:00:58,517 INFO L280 TraceCheckUtils]: 10: Hoare triple {7632#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7632#true} is VALID [2020-07-29 01:00:58,517 INFO L280 TraceCheckUtils]: 11: Hoare triple {7632#true} assume !(~i~0 < ~size); {7632#true} is VALID [2020-07-29 01:00:58,517 INFO L280 TraceCheckUtils]: 12: Hoare triple {7632#true} #res := ~i~0; {7632#true} is VALID [2020-07-29 01:00:58,517 INFO L280 TraceCheckUtils]: 13: Hoare triple {7632#true} assume true; {7632#true} is VALID [2020-07-29 01:00:58,519 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {7632#true} {7654#(<= main_~i~1 2)} #78#return; {7654#(<= main_~i~1 2)} is VALID [2020-07-29 01:00:58,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-07-29 01:00:58,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:58,528 INFO L280 TraceCheckUtils]: 0: Hoare triple {7632#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {7632#true} is VALID [2020-07-29 01:00:58,528 INFO L280 TraceCheckUtils]: 1: Hoare triple {7632#true} assume !!(~i~0 < ~size); {7632#true} is VALID [2020-07-29 01:00:58,529 INFO L280 TraceCheckUtils]: 2: Hoare triple {7632#true} assume 0 <= ~i~0 && ~i~0 < 32; {7632#true} is VALID [2020-07-29 01:00:58,529 INFO L280 TraceCheckUtils]: 3: Hoare triple {7632#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {7632#true} is VALID [2020-07-29 01:00:58,529 INFO L280 TraceCheckUtils]: 4: Hoare triple {7632#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {7632#true} is VALID [2020-07-29 01:00:58,529 INFO L280 TraceCheckUtils]: 5: Hoare triple {7632#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7632#true} is VALID [2020-07-29 01:00:58,529 INFO L280 TraceCheckUtils]: 6: Hoare triple {7632#true} assume !!(~i~0 < ~size); {7632#true} is VALID [2020-07-29 01:00:58,529 INFO L280 TraceCheckUtils]: 7: Hoare triple {7632#true} assume 0 <= ~i~0 && ~i~0 < 32; {7632#true} is VALID [2020-07-29 01:00:58,530 INFO L280 TraceCheckUtils]: 8: Hoare triple {7632#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {7632#true} is VALID [2020-07-29 01:00:58,530 INFO L280 TraceCheckUtils]: 9: Hoare triple {7632#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {7632#true} is VALID [2020-07-29 01:00:58,530 INFO L280 TraceCheckUtils]: 10: Hoare triple {7632#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7632#true} is VALID [2020-07-29 01:00:58,530 INFO L280 TraceCheckUtils]: 11: Hoare triple {7632#true} assume !(~i~0 < ~size); {7632#true} is VALID [2020-07-29 01:00:58,531 INFO L280 TraceCheckUtils]: 12: Hoare triple {7632#true} #res := ~i~0; {7632#true} is VALID [2020-07-29 01:00:58,531 INFO L280 TraceCheckUtils]: 13: Hoare triple {7632#true} assume true; {7632#true} is VALID [2020-07-29 01:00:58,532 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {7632#true} {7670#(<= main_~i~1 3)} #78#return; {7670#(<= main_~i~1 3)} is VALID [2020-07-29 01:00:58,533 INFO L263 TraceCheckUtils]: 0: Hoare triple {7632#true} call ULTIMATE.init(); {7687#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:00:58,533 INFO L280 TraceCheckUtils]: 1: Hoare triple {7687#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {7632#true} is VALID [2020-07-29 01:00:58,534 INFO L280 TraceCheckUtils]: 2: Hoare triple {7632#true} assume true; {7632#true} is VALID [2020-07-29 01:00:58,534 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7632#true} {7632#true} #74#return; {7632#true} is VALID [2020-07-29 01:00:58,534 INFO L263 TraceCheckUtils]: 4: Hoare triple {7632#true} call #t~ret6 := main(); {7632#true} is VALID [2020-07-29 01:00:58,535 INFO L280 TraceCheckUtils]: 5: Hoare triple {7632#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(128);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {7637#(= 0 main_~i~1)} is VALID [2020-07-29 01:00:58,536 INFO L280 TraceCheckUtils]: 6: Hoare triple {7637#(= 0 main_~i~1)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {7637#(= 0 main_~i~1)} is VALID [2020-07-29 01:00:58,536 INFO L263 TraceCheckUtils]: 7: Hoare triple {7637#(= 0 main_~i~1)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {7632#true} is VALID [2020-07-29 01:00:58,536 INFO L280 TraceCheckUtils]: 8: Hoare triple {7632#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {7632#true} is VALID [2020-07-29 01:00:58,536 INFO L280 TraceCheckUtils]: 9: Hoare triple {7632#true} assume !(~i~0 < ~size); {7632#true} is VALID [2020-07-29 01:00:58,536 INFO L280 TraceCheckUtils]: 10: Hoare triple {7632#true} #res := ~i~0; {7632#true} is VALID [2020-07-29 01:00:58,536 INFO L280 TraceCheckUtils]: 11: Hoare triple {7632#true} assume true; {7632#true} is VALID [2020-07-29 01:00:58,538 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {7632#true} {7637#(= 0 main_~i~1)} #78#return; {7637#(= 0 main_~i~1)} is VALID [2020-07-29 01:00:58,538 INFO L280 TraceCheckUtils]: 13: Hoare triple {7637#(= 0 main_~i~1)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {7637#(= 0 main_~i~1)} is VALID [2020-07-29 01:00:58,539 INFO L280 TraceCheckUtils]: 14: Hoare triple {7637#(= 0 main_~i~1)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {7637#(= 0 main_~i~1)} is VALID [2020-07-29 01:00:58,540 INFO L280 TraceCheckUtils]: 15: Hoare triple {7637#(= 0 main_~i~1)} havoc #t~ret3; {7637#(= 0 main_~i~1)} is VALID [2020-07-29 01:00:58,540 INFO L280 TraceCheckUtils]: 16: Hoare triple {7637#(= 0 main_~i~1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7643#(<= main_~i~1 1)} is VALID [2020-07-29 01:00:58,541 INFO L280 TraceCheckUtils]: 17: Hoare triple {7643#(<= main_~i~1 1)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {7643#(<= main_~i~1 1)} is VALID [2020-07-29 01:00:58,541 INFO L263 TraceCheckUtils]: 18: Hoare triple {7643#(<= main_~i~1 1)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {7632#true} is VALID [2020-07-29 01:00:58,541 INFO L280 TraceCheckUtils]: 19: Hoare triple {7632#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {7632#true} is VALID [2020-07-29 01:00:58,541 INFO L280 TraceCheckUtils]: 20: Hoare triple {7632#true} assume !!(~i~0 < ~size); {7632#true} is VALID [2020-07-29 01:00:58,541 INFO L280 TraceCheckUtils]: 21: Hoare triple {7632#true} assume 0 <= ~i~0 && ~i~0 < 32; {7632#true} is VALID [2020-07-29 01:00:58,542 INFO L280 TraceCheckUtils]: 22: Hoare triple {7632#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {7632#true} is VALID [2020-07-29 01:00:58,542 INFO L280 TraceCheckUtils]: 23: Hoare triple {7632#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {7632#true} is VALID [2020-07-29 01:00:58,542 INFO L280 TraceCheckUtils]: 24: Hoare triple {7632#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7632#true} is VALID [2020-07-29 01:00:58,542 INFO L280 TraceCheckUtils]: 25: Hoare triple {7632#true} assume !(~i~0 < ~size); {7632#true} is VALID [2020-07-29 01:00:58,542 INFO L280 TraceCheckUtils]: 26: Hoare triple {7632#true} #res := ~i~0; {7632#true} is VALID [2020-07-29 01:00:58,542 INFO L280 TraceCheckUtils]: 27: Hoare triple {7632#true} assume true; {7632#true} is VALID [2020-07-29 01:00:58,544 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {7632#true} {7643#(<= main_~i~1 1)} #78#return; {7643#(<= main_~i~1 1)} is VALID [2020-07-29 01:00:58,545 INFO L280 TraceCheckUtils]: 29: Hoare triple {7643#(<= main_~i~1 1)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {7643#(<= main_~i~1 1)} is VALID [2020-07-29 01:00:58,545 INFO L280 TraceCheckUtils]: 30: Hoare triple {7643#(<= main_~i~1 1)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {7643#(<= main_~i~1 1)} is VALID [2020-07-29 01:00:58,546 INFO L280 TraceCheckUtils]: 31: Hoare triple {7643#(<= main_~i~1 1)} havoc #t~ret3; {7643#(<= main_~i~1 1)} is VALID [2020-07-29 01:00:58,547 INFO L280 TraceCheckUtils]: 32: Hoare triple {7643#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7654#(<= main_~i~1 2)} is VALID [2020-07-29 01:00:58,547 INFO L280 TraceCheckUtils]: 33: Hoare triple {7654#(<= main_~i~1 2)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {7654#(<= main_~i~1 2)} is VALID [2020-07-29 01:00:58,547 INFO L263 TraceCheckUtils]: 34: Hoare triple {7654#(<= main_~i~1 2)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {7632#true} is VALID [2020-07-29 01:00:58,548 INFO L280 TraceCheckUtils]: 35: Hoare triple {7632#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {7632#true} is VALID [2020-07-29 01:00:58,548 INFO L280 TraceCheckUtils]: 36: Hoare triple {7632#true} assume !!(~i~0 < ~size); {7632#true} is VALID [2020-07-29 01:00:58,548 INFO L280 TraceCheckUtils]: 37: Hoare triple {7632#true} assume 0 <= ~i~0 && ~i~0 < 32; {7632#true} is VALID [2020-07-29 01:00:58,548 INFO L280 TraceCheckUtils]: 38: Hoare triple {7632#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {7632#true} is VALID [2020-07-29 01:00:58,548 INFO L280 TraceCheckUtils]: 39: Hoare triple {7632#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {7632#true} is VALID [2020-07-29 01:00:58,548 INFO L280 TraceCheckUtils]: 40: Hoare triple {7632#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7632#true} is VALID [2020-07-29 01:00:58,549 INFO L280 TraceCheckUtils]: 41: Hoare triple {7632#true} assume !!(~i~0 < ~size); {7632#true} is VALID [2020-07-29 01:00:58,549 INFO L280 TraceCheckUtils]: 42: Hoare triple {7632#true} assume 0 <= ~i~0 && ~i~0 < 32; {7632#true} is VALID [2020-07-29 01:00:58,549 INFO L280 TraceCheckUtils]: 43: Hoare triple {7632#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {7632#true} is VALID [2020-07-29 01:00:58,549 INFO L280 TraceCheckUtils]: 44: Hoare triple {7632#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {7632#true} is VALID [2020-07-29 01:00:58,549 INFO L280 TraceCheckUtils]: 45: Hoare triple {7632#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7632#true} is VALID [2020-07-29 01:00:58,549 INFO L280 TraceCheckUtils]: 46: Hoare triple {7632#true} assume !(~i~0 < ~size); {7632#true} is VALID [2020-07-29 01:00:58,550 INFO L280 TraceCheckUtils]: 47: Hoare triple {7632#true} #res := ~i~0; {7632#true} is VALID [2020-07-29 01:00:58,550 INFO L280 TraceCheckUtils]: 48: Hoare triple {7632#true} assume true; {7632#true} is VALID [2020-07-29 01:00:58,552 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {7632#true} {7654#(<= main_~i~1 2)} #78#return; {7654#(<= main_~i~1 2)} is VALID [2020-07-29 01:00:58,552 INFO L280 TraceCheckUtils]: 50: Hoare triple {7654#(<= main_~i~1 2)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {7654#(<= main_~i~1 2)} is VALID [2020-07-29 01:00:58,553 INFO L280 TraceCheckUtils]: 51: Hoare triple {7654#(<= main_~i~1 2)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {7654#(<= main_~i~1 2)} is VALID [2020-07-29 01:00:58,553 INFO L280 TraceCheckUtils]: 52: Hoare triple {7654#(<= main_~i~1 2)} havoc #t~ret3; {7654#(<= main_~i~1 2)} is VALID [2020-07-29 01:00:58,554 INFO L280 TraceCheckUtils]: 53: Hoare triple {7654#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7670#(<= main_~i~1 3)} is VALID [2020-07-29 01:00:58,555 INFO L280 TraceCheckUtils]: 54: Hoare triple {7670#(<= main_~i~1 3)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {7670#(<= main_~i~1 3)} is VALID [2020-07-29 01:00:58,555 INFO L263 TraceCheckUtils]: 55: Hoare triple {7670#(<= main_~i~1 3)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {7632#true} is VALID [2020-07-29 01:00:58,555 INFO L280 TraceCheckUtils]: 56: Hoare triple {7632#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {7632#true} is VALID [2020-07-29 01:00:58,555 INFO L280 TraceCheckUtils]: 57: Hoare triple {7632#true} assume !!(~i~0 < ~size); {7632#true} is VALID [2020-07-29 01:00:58,556 INFO L280 TraceCheckUtils]: 58: Hoare triple {7632#true} assume 0 <= ~i~0 && ~i~0 < 32; {7632#true} is VALID [2020-07-29 01:00:58,556 INFO L280 TraceCheckUtils]: 59: Hoare triple {7632#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {7632#true} is VALID [2020-07-29 01:00:58,556 INFO L280 TraceCheckUtils]: 60: Hoare triple {7632#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {7632#true} is VALID [2020-07-29 01:00:58,556 INFO L280 TraceCheckUtils]: 61: Hoare triple {7632#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7632#true} is VALID [2020-07-29 01:00:58,557 INFO L280 TraceCheckUtils]: 62: Hoare triple {7632#true} assume !!(~i~0 < ~size); {7632#true} is VALID [2020-07-29 01:00:58,557 INFO L280 TraceCheckUtils]: 63: Hoare triple {7632#true} assume 0 <= ~i~0 && ~i~0 < 32; {7632#true} is VALID [2020-07-29 01:00:58,557 INFO L280 TraceCheckUtils]: 64: Hoare triple {7632#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {7632#true} is VALID [2020-07-29 01:00:58,557 INFO L280 TraceCheckUtils]: 65: Hoare triple {7632#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {7632#true} is VALID [2020-07-29 01:00:58,557 INFO L280 TraceCheckUtils]: 66: Hoare triple {7632#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7632#true} is VALID [2020-07-29 01:00:58,557 INFO L280 TraceCheckUtils]: 67: Hoare triple {7632#true} assume !(~i~0 < ~size); {7632#true} is VALID [2020-07-29 01:00:58,557 INFO L280 TraceCheckUtils]: 68: Hoare triple {7632#true} #res := ~i~0; {7632#true} is VALID [2020-07-29 01:00:58,558 INFO L280 TraceCheckUtils]: 69: Hoare triple {7632#true} assume true; {7632#true} is VALID [2020-07-29 01:00:58,559 INFO L275 TraceCheckUtils]: 70: Hoare quadruple {7632#true} {7670#(<= main_~i~1 3)} #78#return; {7670#(<= main_~i~1 3)} is VALID [2020-07-29 01:00:58,560 INFO L280 TraceCheckUtils]: 71: Hoare triple {7670#(<= main_~i~1 3)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {7670#(<= main_~i~1 3)} is VALID [2020-07-29 01:00:58,565 INFO L280 TraceCheckUtils]: 72: Hoare triple {7670#(<= main_~i~1 3)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {7670#(<= main_~i~1 3)} is VALID [2020-07-29 01:00:58,566 INFO L280 TraceCheckUtils]: 73: Hoare triple {7670#(<= main_~i~1 3)} havoc #t~ret3; {7670#(<= main_~i~1 3)} is VALID [2020-07-29 01:00:58,567 INFO L280 TraceCheckUtils]: 74: Hoare triple {7670#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7686#(<= main_~i~1 4)} is VALID [2020-07-29 01:00:58,568 INFO L280 TraceCheckUtils]: 75: Hoare triple {7686#(<= main_~i~1 4)} assume !(~i~1 < 32); {7633#false} is VALID [2020-07-29 01:00:58,568 INFO L280 TraceCheckUtils]: 76: Hoare triple {7633#false} ~i~1 := 0; {7633#false} is VALID [2020-07-29 01:00:58,568 INFO L280 TraceCheckUtils]: 77: Hoare triple {7633#false} assume !!(~i~1 < 32); {7633#false} is VALID [2020-07-29 01:00:58,568 INFO L280 TraceCheckUtils]: 78: Hoare triple {7633#false} SUMMARY for call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L30 {7633#false} is VALID [2020-07-29 01:00:58,569 INFO L280 TraceCheckUtils]: 79: Hoare triple {7633#false} assume #t~mem5 != ~i~1;havoc #t~mem5; {7633#false} is VALID [2020-07-29 01:00:58,569 INFO L280 TraceCheckUtils]: 80: Hoare triple {7633#false} #res := 1;call ULTIMATE.dealloc(~#b~0.base, ~#b~0.offset);havoc ~#b~0.base, ~#b~0.offset;call ULTIMATE.dealloc(~#mask~0.base, ~#mask~0.offset);havoc ~#mask~0.base, ~#mask~0.offset; {7633#false} is VALID [2020-07-29 01:00:58,569 INFO L280 TraceCheckUtils]: 81: Hoare triple {7633#false} assume !(#valid == old(#valid)); {7633#false} is VALID [2020-07-29 01:00:58,574 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-07-29 01:00:58,574 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082586384] [2020-07-29 01:00:58,574 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908945772] [2020-07-29 01:00:58,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:00:58,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:58,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:00:58,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:58,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:00:59,041 INFO L263 TraceCheckUtils]: 0: Hoare triple {7632#true} call ULTIMATE.init(); {7632#true} is VALID [2020-07-29 01:00:59,041 INFO L280 TraceCheckUtils]: 1: Hoare triple {7632#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {7632#true} is VALID [2020-07-29 01:00:59,042 INFO L280 TraceCheckUtils]: 2: Hoare triple {7632#true} assume true; {7632#true} is VALID [2020-07-29 01:00:59,042 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7632#true} {7632#true} #74#return; {7632#true} is VALID [2020-07-29 01:00:59,042 INFO L263 TraceCheckUtils]: 4: Hoare triple {7632#true} call #t~ret6 := main(); {7632#true} is VALID [2020-07-29 01:00:59,045 INFO L280 TraceCheckUtils]: 5: Hoare triple {7632#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(128);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {7706#(<= 0 main_~i~1)} is VALID [2020-07-29 01:00:59,045 INFO L280 TraceCheckUtils]: 6: Hoare triple {7706#(<= 0 main_~i~1)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {7706#(<= 0 main_~i~1)} is VALID [2020-07-29 01:00:59,045 INFO L263 TraceCheckUtils]: 7: Hoare triple {7706#(<= 0 main_~i~1)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {7632#true} is VALID [2020-07-29 01:00:59,045 INFO L280 TraceCheckUtils]: 8: Hoare triple {7632#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {7632#true} is VALID [2020-07-29 01:00:59,046 INFO L280 TraceCheckUtils]: 9: Hoare triple {7632#true} assume !(~i~0 < ~size); {7632#true} is VALID [2020-07-29 01:00:59,046 INFO L280 TraceCheckUtils]: 10: Hoare triple {7632#true} #res := ~i~0; {7632#true} is VALID [2020-07-29 01:00:59,046 INFO L280 TraceCheckUtils]: 11: Hoare triple {7632#true} assume true; {7632#true} is VALID [2020-07-29 01:00:59,047 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {7632#true} {7706#(<= 0 main_~i~1)} #78#return; {7706#(<= 0 main_~i~1)} is VALID [2020-07-29 01:00:59,051 INFO L280 TraceCheckUtils]: 13: Hoare triple {7706#(<= 0 main_~i~1)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {7706#(<= 0 main_~i~1)} is VALID [2020-07-29 01:00:59,052 INFO L280 TraceCheckUtils]: 14: Hoare triple {7706#(<= 0 main_~i~1)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {7706#(<= 0 main_~i~1)} is VALID [2020-07-29 01:00:59,052 INFO L280 TraceCheckUtils]: 15: Hoare triple {7706#(<= 0 main_~i~1)} havoc #t~ret3; {7706#(<= 0 main_~i~1)} is VALID [2020-07-29 01:00:59,053 INFO L280 TraceCheckUtils]: 16: Hoare triple {7706#(<= 0 main_~i~1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7740#(<= 1 main_~i~1)} is VALID [2020-07-29 01:00:59,053 INFO L280 TraceCheckUtils]: 17: Hoare triple {7740#(<= 1 main_~i~1)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {7740#(<= 1 main_~i~1)} is VALID [2020-07-29 01:00:59,053 INFO L263 TraceCheckUtils]: 18: Hoare triple {7740#(<= 1 main_~i~1)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {7632#true} is VALID [2020-07-29 01:00:59,053 INFO L280 TraceCheckUtils]: 19: Hoare triple {7632#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {7632#true} is VALID [2020-07-29 01:00:59,054 INFO L280 TraceCheckUtils]: 20: Hoare triple {7632#true} assume !!(~i~0 < ~size); {7632#true} is VALID [2020-07-29 01:00:59,054 INFO L280 TraceCheckUtils]: 21: Hoare triple {7632#true} assume 0 <= ~i~0 && ~i~0 < 32; {7632#true} is VALID [2020-07-29 01:00:59,054 INFO L280 TraceCheckUtils]: 22: Hoare triple {7632#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {7632#true} is VALID [2020-07-29 01:00:59,054 INFO L280 TraceCheckUtils]: 23: Hoare triple {7632#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {7632#true} is VALID [2020-07-29 01:00:59,054 INFO L280 TraceCheckUtils]: 24: Hoare triple {7632#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7632#true} is VALID [2020-07-29 01:00:59,054 INFO L280 TraceCheckUtils]: 25: Hoare triple {7632#true} assume !(~i~0 < ~size); {7632#true} is VALID [2020-07-29 01:00:59,054 INFO L280 TraceCheckUtils]: 26: Hoare triple {7632#true} #res := ~i~0; {7632#true} is VALID [2020-07-29 01:00:59,054 INFO L280 TraceCheckUtils]: 27: Hoare triple {7632#true} assume true; {7632#true} is VALID [2020-07-29 01:00:59,056 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {7632#true} {7740#(<= 1 main_~i~1)} #78#return; {7740#(<= 1 main_~i~1)} is VALID [2020-07-29 01:00:59,056 INFO L280 TraceCheckUtils]: 29: Hoare triple {7740#(<= 1 main_~i~1)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {7740#(<= 1 main_~i~1)} is VALID [2020-07-29 01:00:59,057 INFO L280 TraceCheckUtils]: 30: Hoare triple {7740#(<= 1 main_~i~1)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {7740#(<= 1 main_~i~1)} is VALID [2020-07-29 01:00:59,057 INFO L280 TraceCheckUtils]: 31: Hoare triple {7740#(<= 1 main_~i~1)} havoc #t~ret3; {7740#(<= 1 main_~i~1)} is VALID [2020-07-29 01:00:59,058 INFO L280 TraceCheckUtils]: 32: Hoare triple {7740#(<= 1 main_~i~1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7789#(<= 2 main_~i~1)} is VALID [2020-07-29 01:00:59,058 INFO L280 TraceCheckUtils]: 33: Hoare triple {7789#(<= 2 main_~i~1)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {7789#(<= 2 main_~i~1)} is VALID [2020-07-29 01:00:59,058 INFO L263 TraceCheckUtils]: 34: Hoare triple {7789#(<= 2 main_~i~1)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {7632#true} is VALID [2020-07-29 01:00:59,058 INFO L280 TraceCheckUtils]: 35: Hoare triple {7632#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {7632#true} is VALID [2020-07-29 01:00:59,059 INFO L280 TraceCheckUtils]: 36: Hoare triple {7632#true} assume !!(~i~0 < ~size); {7632#true} is VALID [2020-07-29 01:00:59,059 INFO L280 TraceCheckUtils]: 37: Hoare triple {7632#true} assume 0 <= ~i~0 && ~i~0 < 32; {7632#true} is VALID [2020-07-29 01:00:59,059 INFO L280 TraceCheckUtils]: 38: Hoare triple {7632#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {7632#true} is VALID [2020-07-29 01:00:59,059 INFO L280 TraceCheckUtils]: 39: Hoare triple {7632#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {7632#true} is VALID [2020-07-29 01:00:59,059 INFO L280 TraceCheckUtils]: 40: Hoare triple {7632#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7632#true} is VALID [2020-07-29 01:00:59,059 INFO L280 TraceCheckUtils]: 41: Hoare triple {7632#true} assume !!(~i~0 < ~size); {7632#true} is VALID [2020-07-29 01:00:59,059 INFO L280 TraceCheckUtils]: 42: Hoare triple {7632#true} assume 0 <= ~i~0 && ~i~0 < 32; {7632#true} is VALID [2020-07-29 01:00:59,059 INFO L280 TraceCheckUtils]: 43: Hoare triple {7632#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {7632#true} is VALID [2020-07-29 01:00:59,060 INFO L280 TraceCheckUtils]: 44: Hoare triple {7632#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {7632#true} is VALID [2020-07-29 01:00:59,060 INFO L280 TraceCheckUtils]: 45: Hoare triple {7632#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7632#true} is VALID [2020-07-29 01:00:59,060 INFO L280 TraceCheckUtils]: 46: Hoare triple {7632#true} assume !(~i~0 < ~size); {7632#true} is VALID [2020-07-29 01:00:59,060 INFO L280 TraceCheckUtils]: 47: Hoare triple {7632#true} #res := ~i~0; {7632#true} is VALID [2020-07-29 01:00:59,060 INFO L280 TraceCheckUtils]: 48: Hoare triple {7632#true} assume true; {7632#true} is VALID [2020-07-29 01:00:59,061 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {7632#true} {7789#(<= 2 main_~i~1)} #78#return; {7789#(<= 2 main_~i~1)} is VALID [2020-07-29 01:00:59,062 INFO L280 TraceCheckUtils]: 50: Hoare triple {7789#(<= 2 main_~i~1)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {7789#(<= 2 main_~i~1)} is VALID [2020-07-29 01:00:59,062 INFO L280 TraceCheckUtils]: 51: Hoare triple {7789#(<= 2 main_~i~1)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {7789#(<= 2 main_~i~1)} is VALID [2020-07-29 01:00:59,063 INFO L280 TraceCheckUtils]: 52: Hoare triple {7789#(<= 2 main_~i~1)} havoc #t~ret3; {7789#(<= 2 main_~i~1)} is VALID [2020-07-29 01:00:59,064 INFO L280 TraceCheckUtils]: 53: Hoare triple {7789#(<= 2 main_~i~1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7853#(<= 3 main_~i~1)} is VALID [2020-07-29 01:00:59,064 INFO L280 TraceCheckUtils]: 54: Hoare triple {7853#(<= 3 main_~i~1)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {7853#(<= 3 main_~i~1)} is VALID [2020-07-29 01:00:59,064 INFO L263 TraceCheckUtils]: 55: Hoare triple {7853#(<= 3 main_~i~1)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {7632#true} is VALID [2020-07-29 01:00:59,065 INFO L280 TraceCheckUtils]: 56: Hoare triple {7632#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {7863#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:00:59,066 INFO L280 TraceCheckUtils]: 57: Hoare triple {7863#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} assume !!(~i~0 < ~size); {7863#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:00:59,067 INFO L280 TraceCheckUtils]: 58: Hoare triple {7863#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} assume 0 <= ~i~0 && ~i~0 < 32; {7863#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:00:59,067 INFO L280 TraceCheckUtils]: 59: Hoare triple {7863#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {7863#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:00:59,068 INFO L280 TraceCheckUtils]: 60: Hoare triple {7863#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {7863#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:00:59,069 INFO L280 TraceCheckUtils]: 61: Hoare triple {7863#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7879#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} is VALID [2020-07-29 01:00:59,070 INFO L280 TraceCheckUtils]: 62: Hoare triple {7879#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} assume !!(~i~0 < ~size); {7879#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} is VALID [2020-07-29 01:00:59,070 INFO L280 TraceCheckUtils]: 63: Hoare triple {7879#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} assume 0 <= ~i~0 && ~i~0 < 32; {7879#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} is VALID [2020-07-29 01:00:59,071 INFO L280 TraceCheckUtils]: 64: Hoare triple {7879#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {7879#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} is VALID [2020-07-29 01:00:59,072 INFO L280 TraceCheckUtils]: 65: Hoare triple {7879#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {7879#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} is VALID [2020-07-29 01:00:59,073 INFO L280 TraceCheckUtils]: 66: Hoare triple {7879#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7895#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} is VALID [2020-07-29 01:00:59,074 INFO L280 TraceCheckUtils]: 67: Hoare triple {7895#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} assume !(~i~0 < ~size); {7899#(<= |foo_#in~size| 2)} is VALID [2020-07-29 01:00:59,074 INFO L280 TraceCheckUtils]: 68: Hoare triple {7899#(<= |foo_#in~size| 2)} #res := ~i~0; {7899#(<= |foo_#in~size| 2)} is VALID [2020-07-29 01:00:59,075 INFO L280 TraceCheckUtils]: 69: Hoare triple {7899#(<= |foo_#in~size| 2)} assume true; {7899#(<= |foo_#in~size| 2)} is VALID [2020-07-29 01:00:59,076 INFO L275 TraceCheckUtils]: 70: Hoare quadruple {7899#(<= |foo_#in~size| 2)} {7853#(<= 3 main_~i~1)} #78#return; {7633#false} is VALID [2020-07-29 01:00:59,076 INFO L280 TraceCheckUtils]: 71: Hoare triple {7633#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {7633#false} is VALID [2020-07-29 01:00:59,076 INFO L280 TraceCheckUtils]: 72: Hoare triple {7633#false} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {7633#false} is VALID [2020-07-29 01:00:59,077 INFO L280 TraceCheckUtils]: 73: Hoare triple {7633#false} havoc #t~ret3; {7633#false} is VALID [2020-07-29 01:00:59,077 INFO L280 TraceCheckUtils]: 74: Hoare triple {7633#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7633#false} is VALID [2020-07-29 01:00:59,077 INFO L280 TraceCheckUtils]: 75: Hoare triple {7633#false} assume !(~i~1 < 32); {7633#false} is VALID [2020-07-29 01:00:59,077 INFO L280 TraceCheckUtils]: 76: Hoare triple {7633#false} ~i~1 := 0; {7633#false} is VALID [2020-07-29 01:00:59,078 INFO L280 TraceCheckUtils]: 77: Hoare triple {7633#false} assume !!(~i~1 < 32); {7633#false} is VALID [2020-07-29 01:00:59,078 INFO L280 TraceCheckUtils]: 78: Hoare triple {7633#false} SUMMARY for call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L30 {7633#false} is VALID [2020-07-29 01:00:59,078 INFO L280 TraceCheckUtils]: 79: Hoare triple {7633#false} assume #t~mem5 != ~i~1;havoc #t~mem5; {7633#false} is VALID [2020-07-29 01:00:59,078 INFO L280 TraceCheckUtils]: 80: Hoare triple {7633#false} #res := 1;call ULTIMATE.dealloc(~#b~0.base, ~#b~0.offset);havoc ~#b~0.base, ~#b~0.offset;call ULTIMATE.dealloc(~#mask~0.base, ~#mask~0.offset);havoc ~#mask~0.base, ~#mask~0.offset; {7633#false} is VALID [2020-07-29 01:00:59,079 INFO L280 TraceCheckUtils]: 81: Hoare triple {7633#false} assume !(#valid == old(#valid)); {7633#false} is VALID [2020-07-29 01:00:59,103 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 91 proven. 7 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2020-07-29 01:00:59,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:00:59,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2020-07-29 01:00:59,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397392048] [2020-07-29 01:00:59,104 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 82 [2020-07-29 01:00:59,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:00:59,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2020-07-29 01:00:59,211 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:59,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-29 01:00:59,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:00:59,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-29 01:00:59,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2020-07-29 01:00:59,212 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 16 states. [2020-07-29 01:01:00,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:01:00,752 INFO L93 Difference]: Finished difference Result 145 states and 150 transitions. [2020-07-29 01:01:00,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-29 01:01:00,753 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 82 [2020-07-29 01:01:00,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:01:00,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-29 01:01:00,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 146 transitions. [2020-07-29 01:01:00,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-29 01:01:00,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 146 transitions. [2020-07-29 01:01:00,760 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 146 transitions. [2020-07-29 01:01:00,966 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:01:00,970 INFO L225 Difference]: With dead ends: 145 [2020-07-29 01:01:00,970 INFO L226 Difference]: Without dead ends: 142 [2020-07-29 01:01:00,970 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2020-07-29 01:01:00,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-07-29 01:01:00,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 114. [2020-07-29 01:01:00,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:01:00,978 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand 114 states. [2020-07-29 01:01:00,978 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 114 states. [2020-07-29 01:01:00,978 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 114 states. [2020-07-29 01:01:00,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:01:00,986 INFO L93 Difference]: Finished difference Result 142 states and 147 transitions. [2020-07-29 01:01:00,987 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 147 transitions. [2020-07-29 01:01:00,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:01:00,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:01:00,988 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 142 states. [2020-07-29 01:01:00,988 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 142 states. [2020-07-29 01:01:00,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:01:00,996 INFO L93 Difference]: Finished difference Result 142 states and 147 transitions. [2020-07-29 01:01:00,996 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 147 transitions. [2020-07-29 01:01:00,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:01:00,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:01:00,997 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:01:00,998 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:01:00,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-07-29 01:01:01,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2020-07-29 01:01:01,003 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 82 [2020-07-29 01:01:01,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:01:01,004 INFO L479 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2020-07-29 01:01:01,004 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-29 01:01:01,004 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2020-07-29 01:01:01,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-07-29 01:01:01,006 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:01:01,006 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:01:01,221 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:01:01,222 INFO L427 AbstractCegarLoop]: === Iteration 20 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:01:01,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:01:01,222 INFO L82 PathProgramCache]: Analyzing trace with hash -311092151, now seen corresponding path program 2 times [2020-07-29 01:01:01,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:01:01,223 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094966777] [2020-07-29 01:01:01,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:01:01,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:01,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:01:01,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:01,343 INFO L280 TraceCheckUtils]: 0: Hoare triple {8587#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {8506#true} is VALID [2020-07-29 01:01:01,344 INFO L280 TraceCheckUtils]: 1: Hoare triple {8506#true} assume true; {8506#true} is VALID [2020-07-29 01:01:01,344 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {8506#true} {8506#true} #74#return; {8506#true} is VALID [2020-07-29 01:01:01,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-07-29 01:01:01,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:01,348 INFO L280 TraceCheckUtils]: 0: Hoare triple {8506#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {8506#true} is VALID [2020-07-29 01:01:01,348 INFO L280 TraceCheckUtils]: 1: Hoare triple {8506#true} assume !(~i~0 < ~size); {8506#true} is VALID [2020-07-29 01:01:01,348 INFO L280 TraceCheckUtils]: 2: Hoare triple {8506#true} #res := ~i~0; {8506#true} is VALID [2020-07-29 01:01:01,349 INFO L280 TraceCheckUtils]: 3: Hoare triple {8506#true} assume true; {8506#true} is VALID [2020-07-29 01:01:01,350 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {8506#true} {8511#(= 0 main_~i~1)} #78#return; {8511#(= 0 main_~i~1)} is VALID [2020-07-29 01:01:01,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-07-29 01:01:01,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:01,357 INFO L280 TraceCheckUtils]: 0: Hoare triple {8506#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {8506#true} is VALID [2020-07-29 01:01:01,357 INFO L280 TraceCheckUtils]: 1: Hoare triple {8506#true} assume !!(~i~0 < ~size); {8506#true} is VALID [2020-07-29 01:01:01,357 INFO L280 TraceCheckUtils]: 2: Hoare triple {8506#true} assume 0 <= ~i~0 && ~i~0 < 32; {8506#true} is VALID [2020-07-29 01:01:01,357 INFO L280 TraceCheckUtils]: 3: Hoare triple {8506#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {8506#true} is VALID [2020-07-29 01:01:01,357 INFO L280 TraceCheckUtils]: 4: Hoare triple {8506#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {8506#true} is VALID [2020-07-29 01:01:01,358 INFO L280 TraceCheckUtils]: 5: Hoare triple {8506#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8506#true} is VALID [2020-07-29 01:01:01,358 INFO L280 TraceCheckUtils]: 6: Hoare triple {8506#true} assume !(~i~0 < ~size); {8506#true} is VALID [2020-07-29 01:01:01,358 INFO L280 TraceCheckUtils]: 7: Hoare triple {8506#true} #res := ~i~0; {8506#true} is VALID [2020-07-29 01:01:01,358 INFO L280 TraceCheckUtils]: 8: Hoare triple {8506#true} assume true; {8506#true} is VALID [2020-07-29 01:01:01,359 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {8506#true} {8517#(<= main_~i~1 1)} #78#return; {8517#(<= main_~i~1 1)} is VALID [2020-07-29 01:01:01,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-07-29 01:01:01,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:01,367 INFO L280 TraceCheckUtils]: 0: Hoare triple {8506#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {8506#true} is VALID [2020-07-29 01:01:01,367 INFO L280 TraceCheckUtils]: 1: Hoare triple {8506#true} assume !!(~i~0 < ~size); {8506#true} is VALID [2020-07-29 01:01:01,367 INFO L280 TraceCheckUtils]: 2: Hoare triple {8506#true} assume 0 <= ~i~0 && ~i~0 < 32; {8506#true} is VALID [2020-07-29 01:01:01,367 INFO L280 TraceCheckUtils]: 3: Hoare triple {8506#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {8506#true} is VALID [2020-07-29 01:01:01,368 INFO L280 TraceCheckUtils]: 4: Hoare triple {8506#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {8506#true} is VALID [2020-07-29 01:01:01,368 INFO L280 TraceCheckUtils]: 5: Hoare triple {8506#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8506#true} is VALID [2020-07-29 01:01:01,368 INFO L280 TraceCheckUtils]: 6: Hoare triple {8506#true} assume !!(~i~0 < ~size); {8506#true} is VALID [2020-07-29 01:01:01,368 INFO L280 TraceCheckUtils]: 7: Hoare triple {8506#true} assume 0 <= ~i~0 && ~i~0 < 32; {8506#true} is VALID [2020-07-29 01:01:01,368 INFO L280 TraceCheckUtils]: 8: Hoare triple {8506#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {8506#true} is VALID [2020-07-29 01:01:01,368 INFO L280 TraceCheckUtils]: 9: Hoare triple {8506#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {8506#true} is VALID [2020-07-29 01:01:01,369 INFO L280 TraceCheckUtils]: 10: Hoare triple {8506#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8506#true} is VALID [2020-07-29 01:01:01,369 INFO L280 TraceCheckUtils]: 11: Hoare triple {8506#true} assume !(~i~0 < ~size); {8506#true} is VALID [2020-07-29 01:01:01,369 INFO L280 TraceCheckUtils]: 12: Hoare triple {8506#true} #res := ~i~0; {8506#true} is VALID [2020-07-29 01:01:01,369 INFO L280 TraceCheckUtils]: 13: Hoare triple {8506#true} assume true; {8506#true} is VALID [2020-07-29 01:01:01,370 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {8506#true} {8528#(<= main_~i~1 2)} #78#return; {8528#(<= main_~i~1 2)} is VALID [2020-07-29 01:01:01,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-07-29 01:01:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:01,380 INFO L280 TraceCheckUtils]: 0: Hoare triple {8506#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {8506#true} is VALID [2020-07-29 01:01:01,380 INFO L280 TraceCheckUtils]: 1: Hoare triple {8506#true} assume !!(~i~0 < ~size); {8506#true} is VALID [2020-07-29 01:01:01,381 INFO L280 TraceCheckUtils]: 2: Hoare triple {8506#true} assume 0 <= ~i~0 && ~i~0 < 32; {8506#true} is VALID [2020-07-29 01:01:01,381 INFO L280 TraceCheckUtils]: 3: Hoare triple {8506#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {8506#true} is VALID [2020-07-29 01:01:01,381 INFO L280 TraceCheckUtils]: 4: Hoare triple {8506#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {8506#true} is VALID [2020-07-29 01:01:01,381 INFO L280 TraceCheckUtils]: 5: Hoare triple {8506#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8506#true} is VALID [2020-07-29 01:01:01,381 INFO L280 TraceCheckUtils]: 6: Hoare triple {8506#true} assume !!(~i~0 < ~size); {8506#true} is VALID [2020-07-29 01:01:01,381 INFO L280 TraceCheckUtils]: 7: Hoare triple {8506#true} assume 0 <= ~i~0 && ~i~0 < 32; {8506#true} is VALID [2020-07-29 01:01:01,382 INFO L280 TraceCheckUtils]: 8: Hoare triple {8506#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {8506#true} is VALID [2020-07-29 01:01:01,382 INFO L280 TraceCheckUtils]: 9: Hoare triple {8506#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {8506#true} is VALID [2020-07-29 01:01:01,382 INFO L280 TraceCheckUtils]: 10: Hoare triple {8506#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8506#true} is VALID [2020-07-29 01:01:01,382 INFO L280 TraceCheckUtils]: 11: Hoare triple {8506#true} assume !!(~i~0 < ~size); {8506#true} is VALID [2020-07-29 01:01:01,382 INFO L280 TraceCheckUtils]: 12: Hoare triple {8506#true} assume 0 <= ~i~0 && ~i~0 < 32; {8506#true} is VALID [2020-07-29 01:01:01,383 INFO L280 TraceCheckUtils]: 13: Hoare triple {8506#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {8506#true} is VALID [2020-07-29 01:01:01,383 INFO L280 TraceCheckUtils]: 14: Hoare triple {8506#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {8506#true} is VALID [2020-07-29 01:01:01,383 INFO L280 TraceCheckUtils]: 15: Hoare triple {8506#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8506#true} is VALID [2020-07-29 01:01:01,383 INFO L280 TraceCheckUtils]: 16: Hoare triple {8506#true} assume !(~i~0 < ~size); {8506#true} is VALID [2020-07-29 01:01:01,383 INFO L280 TraceCheckUtils]: 17: Hoare triple {8506#true} #res := ~i~0; {8506#true} is VALID [2020-07-29 01:01:01,383 INFO L280 TraceCheckUtils]: 18: Hoare triple {8506#true} assume true; {8506#true} is VALID [2020-07-29 01:01:01,385 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {8506#true} {8544#(<= main_~i~1 3)} #78#return; {8544#(<= main_~i~1 3)} is VALID [2020-07-29 01:01:01,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-07-29 01:01:01,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:01,393 INFO L280 TraceCheckUtils]: 0: Hoare triple {8506#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {8506#true} is VALID [2020-07-29 01:01:01,393 INFO L280 TraceCheckUtils]: 1: Hoare triple {8506#true} assume !!(~i~0 < ~size); {8506#true} is VALID [2020-07-29 01:01:01,394 INFO L280 TraceCheckUtils]: 2: Hoare triple {8506#true} assume 0 <= ~i~0 && ~i~0 < 32; {8506#true} is VALID [2020-07-29 01:01:01,394 INFO L280 TraceCheckUtils]: 3: Hoare triple {8506#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {8506#true} is VALID [2020-07-29 01:01:01,394 INFO L280 TraceCheckUtils]: 4: Hoare triple {8506#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {8506#true} is VALID [2020-07-29 01:01:01,394 INFO L280 TraceCheckUtils]: 5: Hoare triple {8506#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8506#true} is VALID [2020-07-29 01:01:01,394 INFO L280 TraceCheckUtils]: 6: Hoare triple {8506#true} assume !!(~i~0 < ~size); {8506#true} is VALID [2020-07-29 01:01:01,395 INFO L280 TraceCheckUtils]: 7: Hoare triple {8506#true} assume 0 <= ~i~0 && ~i~0 < 32; {8506#true} is VALID [2020-07-29 01:01:01,395 INFO L280 TraceCheckUtils]: 8: Hoare triple {8506#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {8506#true} is VALID [2020-07-29 01:01:01,395 INFO L280 TraceCheckUtils]: 9: Hoare triple {8506#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {8506#true} is VALID [2020-07-29 01:01:01,395 INFO L280 TraceCheckUtils]: 10: Hoare triple {8506#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8506#true} is VALID [2020-07-29 01:01:01,395 INFO L280 TraceCheckUtils]: 11: Hoare triple {8506#true} assume !!(~i~0 < ~size); {8506#true} is VALID [2020-07-29 01:01:01,395 INFO L280 TraceCheckUtils]: 12: Hoare triple {8506#true} assume 0 <= ~i~0 && ~i~0 < 32; {8506#true} is VALID [2020-07-29 01:01:01,396 INFO L280 TraceCheckUtils]: 13: Hoare triple {8506#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {8506#true} is VALID [2020-07-29 01:01:01,396 INFO L280 TraceCheckUtils]: 14: Hoare triple {8506#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {8506#true} is VALID [2020-07-29 01:01:01,396 INFO L280 TraceCheckUtils]: 15: Hoare triple {8506#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8506#true} is VALID [2020-07-29 01:01:01,396 INFO L280 TraceCheckUtils]: 16: Hoare triple {8506#true} assume !(~i~0 < ~size); {8506#true} is VALID [2020-07-29 01:01:01,396 INFO L280 TraceCheckUtils]: 17: Hoare triple {8506#true} #res := ~i~0; {8506#true} is VALID [2020-07-29 01:01:01,396 INFO L280 TraceCheckUtils]: 18: Hoare triple {8506#true} assume true; {8506#true} is VALID [2020-07-29 01:01:01,398 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {8506#true} {8565#(<= main_~i~1 4)} #78#return; {8565#(<= main_~i~1 4)} is VALID [2020-07-29 01:01:01,399 INFO L263 TraceCheckUtils]: 0: Hoare triple {8506#true} call ULTIMATE.init(); {8587#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:01:01,399 INFO L280 TraceCheckUtils]: 1: Hoare triple {8587#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {8506#true} is VALID [2020-07-29 01:01:01,399 INFO L280 TraceCheckUtils]: 2: Hoare triple {8506#true} assume true; {8506#true} is VALID [2020-07-29 01:01:01,399 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8506#true} {8506#true} #74#return; {8506#true} is VALID [2020-07-29 01:01:01,399 INFO L263 TraceCheckUtils]: 4: Hoare triple {8506#true} call #t~ret6 := main(); {8506#true} is VALID [2020-07-29 01:01:01,400 INFO L280 TraceCheckUtils]: 5: Hoare triple {8506#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(128);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {8511#(= 0 main_~i~1)} is VALID [2020-07-29 01:01:01,401 INFO L280 TraceCheckUtils]: 6: Hoare triple {8511#(= 0 main_~i~1)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {8511#(= 0 main_~i~1)} is VALID [2020-07-29 01:01:01,401 INFO L263 TraceCheckUtils]: 7: Hoare triple {8511#(= 0 main_~i~1)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {8506#true} is VALID [2020-07-29 01:01:01,401 INFO L280 TraceCheckUtils]: 8: Hoare triple {8506#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {8506#true} is VALID [2020-07-29 01:01:01,401 INFO L280 TraceCheckUtils]: 9: Hoare triple {8506#true} assume !(~i~0 < ~size); {8506#true} is VALID [2020-07-29 01:01:01,401 INFO L280 TraceCheckUtils]: 10: Hoare triple {8506#true} #res := ~i~0; {8506#true} is VALID [2020-07-29 01:01:01,402 INFO L280 TraceCheckUtils]: 11: Hoare triple {8506#true} assume true; {8506#true} is VALID [2020-07-29 01:01:01,403 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {8506#true} {8511#(= 0 main_~i~1)} #78#return; {8511#(= 0 main_~i~1)} is VALID [2020-07-29 01:01:01,403 INFO L280 TraceCheckUtils]: 13: Hoare triple {8511#(= 0 main_~i~1)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {8511#(= 0 main_~i~1)} is VALID [2020-07-29 01:01:01,404 INFO L280 TraceCheckUtils]: 14: Hoare triple {8511#(= 0 main_~i~1)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {8511#(= 0 main_~i~1)} is VALID [2020-07-29 01:01:01,404 INFO L280 TraceCheckUtils]: 15: Hoare triple {8511#(= 0 main_~i~1)} havoc #t~ret3; {8511#(= 0 main_~i~1)} is VALID [2020-07-29 01:01:01,405 INFO L280 TraceCheckUtils]: 16: Hoare triple {8511#(= 0 main_~i~1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8517#(<= main_~i~1 1)} is VALID [2020-07-29 01:01:01,405 INFO L280 TraceCheckUtils]: 17: Hoare triple {8517#(<= main_~i~1 1)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {8517#(<= main_~i~1 1)} is VALID [2020-07-29 01:01:01,405 INFO L263 TraceCheckUtils]: 18: Hoare triple {8517#(<= main_~i~1 1)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {8506#true} is VALID [2020-07-29 01:01:01,405 INFO L280 TraceCheckUtils]: 19: Hoare triple {8506#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {8506#true} is VALID [2020-07-29 01:01:01,406 INFO L280 TraceCheckUtils]: 20: Hoare triple {8506#true} assume !!(~i~0 < ~size); {8506#true} is VALID [2020-07-29 01:01:01,406 INFO L280 TraceCheckUtils]: 21: Hoare triple {8506#true} assume 0 <= ~i~0 && ~i~0 < 32; {8506#true} is VALID [2020-07-29 01:01:01,406 INFO L280 TraceCheckUtils]: 22: Hoare triple {8506#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {8506#true} is VALID [2020-07-29 01:01:01,406 INFO L280 TraceCheckUtils]: 23: Hoare triple {8506#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {8506#true} is VALID [2020-07-29 01:01:01,406 INFO L280 TraceCheckUtils]: 24: Hoare triple {8506#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8506#true} is VALID [2020-07-29 01:01:01,406 INFO L280 TraceCheckUtils]: 25: Hoare triple {8506#true} assume !(~i~0 < ~size); {8506#true} is VALID [2020-07-29 01:01:01,407 INFO L280 TraceCheckUtils]: 26: Hoare triple {8506#true} #res := ~i~0; {8506#true} is VALID [2020-07-29 01:01:01,407 INFO L280 TraceCheckUtils]: 27: Hoare triple {8506#true} assume true; {8506#true} is VALID [2020-07-29 01:01:01,408 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {8506#true} {8517#(<= main_~i~1 1)} #78#return; {8517#(<= main_~i~1 1)} is VALID [2020-07-29 01:01:01,409 INFO L280 TraceCheckUtils]: 29: Hoare triple {8517#(<= main_~i~1 1)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {8517#(<= main_~i~1 1)} is VALID [2020-07-29 01:01:01,409 INFO L280 TraceCheckUtils]: 30: Hoare triple {8517#(<= main_~i~1 1)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {8517#(<= main_~i~1 1)} is VALID [2020-07-29 01:01:01,409 INFO L280 TraceCheckUtils]: 31: Hoare triple {8517#(<= main_~i~1 1)} havoc #t~ret3; {8517#(<= main_~i~1 1)} is VALID [2020-07-29 01:01:01,410 INFO L280 TraceCheckUtils]: 32: Hoare triple {8517#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8528#(<= main_~i~1 2)} is VALID [2020-07-29 01:01:01,411 INFO L280 TraceCheckUtils]: 33: Hoare triple {8528#(<= main_~i~1 2)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {8528#(<= main_~i~1 2)} is VALID [2020-07-29 01:01:01,411 INFO L263 TraceCheckUtils]: 34: Hoare triple {8528#(<= main_~i~1 2)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {8506#true} is VALID [2020-07-29 01:01:01,411 INFO L280 TraceCheckUtils]: 35: Hoare triple {8506#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {8506#true} is VALID [2020-07-29 01:01:01,411 INFO L280 TraceCheckUtils]: 36: Hoare triple {8506#true} assume !!(~i~0 < ~size); {8506#true} is VALID [2020-07-29 01:01:01,411 INFO L280 TraceCheckUtils]: 37: Hoare triple {8506#true} assume 0 <= ~i~0 && ~i~0 < 32; {8506#true} is VALID [2020-07-29 01:01:01,412 INFO L280 TraceCheckUtils]: 38: Hoare triple {8506#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {8506#true} is VALID [2020-07-29 01:01:01,412 INFO L280 TraceCheckUtils]: 39: Hoare triple {8506#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {8506#true} is VALID [2020-07-29 01:01:01,412 INFO L280 TraceCheckUtils]: 40: Hoare triple {8506#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8506#true} is VALID [2020-07-29 01:01:01,412 INFO L280 TraceCheckUtils]: 41: Hoare triple {8506#true} assume !!(~i~0 < ~size); {8506#true} is VALID [2020-07-29 01:01:01,412 INFO L280 TraceCheckUtils]: 42: Hoare triple {8506#true} assume 0 <= ~i~0 && ~i~0 < 32; {8506#true} is VALID [2020-07-29 01:01:01,412 INFO L280 TraceCheckUtils]: 43: Hoare triple {8506#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {8506#true} is VALID [2020-07-29 01:01:01,413 INFO L280 TraceCheckUtils]: 44: Hoare triple {8506#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {8506#true} is VALID [2020-07-29 01:01:01,413 INFO L280 TraceCheckUtils]: 45: Hoare triple {8506#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8506#true} is VALID [2020-07-29 01:01:01,413 INFO L280 TraceCheckUtils]: 46: Hoare triple {8506#true} assume !(~i~0 < ~size); {8506#true} is VALID [2020-07-29 01:01:01,413 INFO L280 TraceCheckUtils]: 47: Hoare triple {8506#true} #res := ~i~0; {8506#true} is VALID [2020-07-29 01:01:01,413 INFO L280 TraceCheckUtils]: 48: Hoare triple {8506#true} assume true; {8506#true} is VALID [2020-07-29 01:01:01,414 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {8506#true} {8528#(<= main_~i~1 2)} #78#return; {8528#(<= main_~i~1 2)} is VALID [2020-07-29 01:01:01,415 INFO L280 TraceCheckUtils]: 50: Hoare triple {8528#(<= main_~i~1 2)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {8528#(<= main_~i~1 2)} is VALID [2020-07-29 01:01:01,415 INFO L280 TraceCheckUtils]: 51: Hoare triple {8528#(<= main_~i~1 2)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {8528#(<= main_~i~1 2)} is VALID [2020-07-29 01:01:01,416 INFO L280 TraceCheckUtils]: 52: Hoare triple {8528#(<= main_~i~1 2)} havoc #t~ret3; {8528#(<= main_~i~1 2)} is VALID [2020-07-29 01:01:01,416 INFO L280 TraceCheckUtils]: 53: Hoare triple {8528#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8544#(<= main_~i~1 3)} is VALID [2020-07-29 01:01:01,417 INFO L280 TraceCheckUtils]: 54: Hoare triple {8544#(<= main_~i~1 3)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {8544#(<= main_~i~1 3)} is VALID [2020-07-29 01:01:01,417 INFO L263 TraceCheckUtils]: 55: Hoare triple {8544#(<= main_~i~1 3)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {8506#true} is VALID [2020-07-29 01:01:01,417 INFO L280 TraceCheckUtils]: 56: Hoare triple {8506#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {8506#true} is VALID [2020-07-29 01:01:01,417 INFO L280 TraceCheckUtils]: 57: Hoare triple {8506#true} assume !!(~i~0 < ~size); {8506#true} is VALID [2020-07-29 01:01:01,417 INFO L280 TraceCheckUtils]: 58: Hoare triple {8506#true} assume 0 <= ~i~0 && ~i~0 < 32; {8506#true} is VALID [2020-07-29 01:01:01,417 INFO L280 TraceCheckUtils]: 59: Hoare triple {8506#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {8506#true} is VALID [2020-07-29 01:01:01,417 INFO L280 TraceCheckUtils]: 60: Hoare triple {8506#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {8506#true} is VALID [2020-07-29 01:01:01,417 INFO L280 TraceCheckUtils]: 61: Hoare triple {8506#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8506#true} is VALID [2020-07-29 01:01:01,418 INFO L280 TraceCheckUtils]: 62: Hoare triple {8506#true} assume !!(~i~0 < ~size); {8506#true} is VALID [2020-07-29 01:01:01,418 INFO L280 TraceCheckUtils]: 63: Hoare triple {8506#true} assume 0 <= ~i~0 && ~i~0 < 32; {8506#true} is VALID [2020-07-29 01:01:01,418 INFO L280 TraceCheckUtils]: 64: Hoare triple {8506#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {8506#true} is VALID [2020-07-29 01:01:01,418 INFO L280 TraceCheckUtils]: 65: Hoare triple {8506#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {8506#true} is VALID [2020-07-29 01:01:01,418 INFO L280 TraceCheckUtils]: 66: Hoare triple {8506#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8506#true} is VALID [2020-07-29 01:01:01,418 INFO L280 TraceCheckUtils]: 67: Hoare triple {8506#true} assume !!(~i~0 < ~size); {8506#true} is VALID [2020-07-29 01:01:01,418 INFO L280 TraceCheckUtils]: 68: Hoare triple {8506#true} assume 0 <= ~i~0 && ~i~0 < 32; {8506#true} is VALID [2020-07-29 01:01:01,419 INFO L280 TraceCheckUtils]: 69: Hoare triple {8506#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {8506#true} is VALID [2020-07-29 01:01:01,419 INFO L280 TraceCheckUtils]: 70: Hoare triple {8506#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {8506#true} is VALID [2020-07-29 01:01:01,419 INFO L280 TraceCheckUtils]: 71: Hoare triple {8506#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8506#true} is VALID [2020-07-29 01:01:01,419 INFO L280 TraceCheckUtils]: 72: Hoare triple {8506#true} assume !(~i~0 < ~size); {8506#true} is VALID [2020-07-29 01:01:01,419 INFO L280 TraceCheckUtils]: 73: Hoare triple {8506#true} #res := ~i~0; {8506#true} is VALID [2020-07-29 01:01:01,419 INFO L280 TraceCheckUtils]: 74: Hoare triple {8506#true} assume true; {8506#true} is VALID [2020-07-29 01:01:01,420 INFO L275 TraceCheckUtils]: 75: Hoare quadruple {8506#true} {8544#(<= main_~i~1 3)} #78#return; {8544#(<= main_~i~1 3)} is VALID [2020-07-29 01:01:01,420 INFO L280 TraceCheckUtils]: 76: Hoare triple {8544#(<= main_~i~1 3)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {8544#(<= main_~i~1 3)} is VALID [2020-07-29 01:01:01,421 INFO L280 TraceCheckUtils]: 77: Hoare triple {8544#(<= main_~i~1 3)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {8544#(<= main_~i~1 3)} is VALID [2020-07-29 01:01:01,421 INFO L280 TraceCheckUtils]: 78: Hoare triple {8544#(<= main_~i~1 3)} havoc #t~ret3; {8544#(<= main_~i~1 3)} is VALID [2020-07-29 01:01:01,422 INFO L280 TraceCheckUtils]: 79: Hoare triple {8544#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8565#(<= main_~i~1 4)} is VALID [2020-07-29 01:01:01,422 INFO L280 TraceCheckUtils]: 80: Hoare triple {8565#(<= main_~i~1 4)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {8565#(<= main_~i~1 4)} is VALID [2020-07-29 01:01:01,422 INFO L263 TraceCheckUtils]: 81: Hoare triple {8565#(<= main_~i~1 4)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {8506#true} is VALID [2020-07-29 01:01:01,423 INFO L280 TraceCheckUtils]: 82: Hoare triple {8506#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {8506#true} is VALID [2020-07-29 01:01:01,423 INFO L280 TraceCheckUtils]: 83: Hoare triple {8506#true} assume !!(~i~0 < ~size); {8506#true} is VALID [2020-07-29 01:01:01,423 INFO L280 TraceCheckUtils]: 84: Hoare triple {8506#true} assume 0 <= ~i~0 && ~i~0 < 32; {8506#true} is VALID [2020-07-29 01:01:01,423 INFO L280 TraceCheckUtils]: 85: Hoare triple {8506#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {8506#true} is VALID [2020-07-29 01:01:01,423 INFO L280 TraceCheckUtils]: 86: Hoare triple {8506#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {8506#true} is VALID [2020-07-29 01:01:01,423 INFO L280 TraceCheckUtils]: 87: Hoare triple {8506#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8506#true} is VALID [2020-07-29 01:01:01,423 INFO L280 TraceCheckUtils]: 88: Hoare triple {8506#true} assume !!(~i~0 < ~size); {8506#true} is VALID [2020-07-29 01:01:01,423 INFO L280 TraceCheckUtils]: 89: Hoare triple {8506#true} assume 0 <= ~i~0 && ~i~0 < 32; {8506#true} is VALID [2020-07-29 01:01:01,424 INFO L280 TraceCheckUtils]: 90: Hoare triple {8506#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {8506#true} is VALID [2020-07-29 01:01:01,424 INFO L280 TraceCheckUtils]: 91: Hoare triple {8506#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {8506#true} is VALID [2020-07-29 01:01:01,424 INFO L280 TraceCheckUtils]: 92: Hoare triple {8506#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8506#true} is VALID [2020-07-29 01:01:01,424 INFO L280 TraceCheckUtils]: 93: Hoare triple {8506#true} assume !!(~i~0 < ~size); {8506#true} is VALID [2020-07-29 01:01:01,424 INFO L280 TraceCheckUtils]: 94: Hoare triple {8506#true} assume 0 <= ~i~0 && ~i~0 < 32; {8506#true} is VALID [2020-07-29 01:01:01,424 INFO L280 TraceCheckUtils]: 95: Hoare triple {8506#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {8506#true} is VALID [2020-07-29 01:01:01,424 INFO L280 TraceCheckUtils]: 96: Hoare triple {8506#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {8506#true} is VALID [2020-07-29 01:01:01,425 INFO L280 TraceCheckUtils]: 97: Hoare triple {8506#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8506#true} is VALID [2020-07-29 01:01:01,425 INFO L280 TraceCheckUtils]: 98: Hoare triple {8506#true} assume !(~i~0 < ~size); {8506#true} is VALID [2020-07-29 01:01:01,425 INFO L280 TraceCheckUtils]: 99: Hoare triple {8506#true} #res := ~i~0; {8506#true} is VALID [2020-07-29 01:01:01,425 INFO L280 TraceCheckUtils]: 100: Hoare triple {8506#true} assume true; {8506#true} is VALID [2020-07-29 01:01:01,426 INFO L275 TraceCheckUtils]: 101: Hoare quadruple {8506#true} {8565#(<= main_~i~1 4)} #78#return; {8565#(<= main_~i~1 4)} is VALID [2020-07-29 01:01:01,426 INFO L280 TraceCheckUtils]: 102: Hoare triple {8565#(<= main_~i~1 4)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {8565#(<= main_~i~1 4)} is VALID [2020-07-29 01:01:01,427 INFO L280 TraceCheckUtils]: 103: Hoare triple {8565#(<= main_~i~1 4)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {8565#(<= main_~i~1 4)} is VALID [2020-07-29 01:01:01,427 INFO L280 TraceCheckUtils]: 104: Hoare triple {8565#(<= main_~i~1 4)} havoc #t~ret3; {8565#(<= main_~i~1 4)} is VALID [2020-07-29 01:01:01,428 INFO L280 TraceCheckUtils]: 105: Hoare triple {8565#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8586#(<= main_~i~1 5)} is VALID [2020-07-29 01:01:01,428 INFO L280 TraceCheckUtils]: 106: Hoare triple {8586#(<= main_~i~1 5)} assume !(~i~1 < 32); {8507#false} is VALID [2020-07-29 01:01:01,429 INFO L280 TraceCheckUtils]: 107: Hoare triple {8507#false} ~i~1 := 0; {8507#false} is VALID [2020-07-29 01:01:01,429 INFO L280 TraceCheckUtils]: 108: Hoare triple {8507#false} assume !!(~i~1 < 32); {8507#false} is VALID [2020-07-29 01:01:01,429 INFO L280 TraceCheckUtils]: 109: Hoare triple {8507#false} SUMMARY for call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L30 {8507#false} is VALID [2020-07-29 01:01:01,429 INFO L280 TraceCheckUtils]: 110: Hoare triple {8507#false} assume #t~mem5 != ~i~1;havoc #t~mem5; {8507#false} is VALID [2020-07-29 01:01:01,429 INFO L280 TraceCheckUtils]: 111: Hoare triple {8507#false} #res := 1;call ULTIMATE.dealloc(~#b~0.base, ~#b~0.offset);havoc ~#b~0.base, ~#b~0.offset;call ULTIMATE.dealloc(~#mask~0.base, ~#mask~0.offset);havoc ~#mask~0.base, ~#mask~0.offset; {8507#false} is VALID [2020-07-29 01:01:01,429 INFO L280 TraceCheckUtils]: 112: Hoare triple {8507#false} assume !(#valid == old(#valid)); {8507#false} is VALID [2020-07-29 01:01:01,438 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2020-07-29 01:01:01,438 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094966777] [2020-07-29 01:01:01,439 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199454089] [2020-07-29 01:01:01,439 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:01:01,473 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-29 01:01:01,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:01:01,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:01:01,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:01,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:01:01,581 INFO L350 Elim1Store]: treesize reduction 14, result has 50.0 percent of original size [2020-07-29 01:01:01,581 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 29 [2020-07-29 01:01:01,583 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:01:01,588 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:01:01,612 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-29 01:01:01,612 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2020-07-29 01:01:01,616 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:01:01,616 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_old(#valid)_BEFORE_CALL_1|, |v_main_~#b~0.base_BEFORE_CALL_6|, |v_main_~#mask~0.base_BEFORE_CALL_10|]. (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_1| |v_main_~#b~0.base_BEFORE_CALL_6| 1))) (and (= 0 (select .cse0 |v_main_~#mask~0.base_BEFORE_CALL_10|)) (= 0 (select |v_old(#valid)_BEFORE_CALL_1| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= (store .cse0 |v_main_~#mask~0.base_BEFORE_CALL_10| 1) |#valid|))) [2020-07-29 01:01:01,616 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [|v_main_~#mask~0.base_BEFORE_CALL_10|, |v_main_~#b~0.base_BEFORE_CALL_6|]. (and (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))) [2020-07-29 01:01:02,070 INFO L350 Elim1Store]: treesize reduction 14, result has 50.0 percent of original size [2020-07-29 01:01:02,071 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 29 [2020-07-29 01:01:02,072 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:01:02,078 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:01:02,090 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-29 01:01:02,090 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2020-07-29 01:01:02,093 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:01:02,093 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_old(#valid)_BEFORE_CALL_2|, |v_main_~#b~0.base_BEFORE_CALL_7|, |v_main_~#mask~0.base_BEFORE_CALL_11|]. (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_2| |v_main_~#b~0.base_BEFORE_CALL_7| 1))) (and (= |#valid| (store .cse0 |v_main_~#mask~0.base_BEFORE_CALL_11| 1)) (= 0 (select .cse0 |v_main_~#mask~0.base_BEFORE_CALL_11|)) (= (select |v_old(#valid)_BEFORE_CALL_2| |v_main_~#b~0.base_BEFORE_CALL_7|) 0))) [2020-07-29 01:01:02,093 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [|v_main_~#b~0.base_BEFORE_CALL_7|, |v_main_~#mask~0.base_BEFORE_CALL_11|]. (and (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_7|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_11|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_11| |v_main_~#b~0.base_BEFORE_CALL_7|))) [2020-07-29 01:01:02,837 INFO L350 Elim1Store]: treesize reduction 14, result has 50.0 percent of original size [2020-07-29 01:01:02,838 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 29 [2020-07-29 01:01:02,839 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:01:02,845 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:01:02,859 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-29 01:01:02,860 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2020-07-29 01:01:02,864 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:01:02,865 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_old(#valid)_BEFORE_CALL_3|, |v_main_~#b~0.base_BEFORE_CALL_8|, |v_main_~#mask~0.base_BEFORE_CALL_12|]. (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_3| |v_main_~#b~0.base_BEFORE_CALL_8| 1))) (and (= |#valid| (store .cse0 |v_main_~#mask~0.base_BEFORE_CALL_12| 1)) (= (select .cse0 |v_main_~#mask~0.base_BEFORE_CALL_12|) 0) (= 0 (select |v_old(#valid)_BEFORE_CALL_3| |v_main_~#b~0.base_BEFORE_CALL_8|)))) [2020-07-29 01:01:02,865 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [|v_main_~#mask~0.base_BEFORE_CALL_12|, |v_main_~#b~0.base_BEFORE_CALL_8|]. (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_12|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_12| |v_main_~#b~0.base_BEFORE_CALL_8|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_8|))) [2020-07-29 01:01:03,797 INFO L350 Elim1Store]: treesize reduction 14, result has 50.0 percent of original size [2020-07-29 01:01:03,798 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 29 [2020-07-29 01:01:03,799 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:01:03,805 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:01:03,820 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-29 01:01:03,820 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2020-07-29 01:01:03,823 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:01:03,823 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_old(#valid)_BEFORE_CALL_4|, |v_main_~#b~0.base_BEFORE_CALL_9|, |v_main_~#mask~0.base_BEFORE_CALL_13|]. (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_4| |v_main_~#b~0.base_BEFORE_CALL_9| 1))) (and (= |#valid| (store .cse0 |v_main_~#mask~0.base_BEFORE_CALL_13| 1)) (= 0 (select |v_old(#valid)_BEFORE_CALL_4| |v_main_~#b~0.base_BEFORE_CALL_9|)) (= 0 (select .cse0 |v_main_~#mask~0.base_BEFORE_CALL_13|)))) [2020-07-29 01:01:03,823 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [|v_main_~#mask~0.base_BEFORE_CALL_13|, |v_main_~#b~0.base_BEFORE_CALL_9|]. (and (not (= |v_main_~#mask~0.base_BEFORE_CALL_13| |v_main_~#b~0.base_BEFORE_CALL_9|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_13|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_9|))) [2020-07-29 01:01:05,153 INFO L350 Elim1Store]: treesize reduction 14, result has 50.0 percent of original size [2020-07-29 01:01:05,153 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 29 [2020-07-29 01:01:05,154 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:01:05,162 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:01:05,172 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-29 01:01:05,173 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2020-07-29 01:01:05,176 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:01:05,176 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_old(#valid)_BEFORE_CALL_5|, |v_main_~#b~0.base_BEFORE_CALL_10|, |v_main_~#mask~0.base_BEFORE_CALL_14|]. (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_5| |v_main_~#b~0.base_BEFORE_CALL_10| 1))) (and (= 0 (select .cse0 |v_main_~#mask~0.base_BEFORE_CALL_14|)) (= (store .cse0 |v_main_~#mask~0.base_BEFORE_CALL_14| 1) |#valid|) (= 0 (select |v_old(#valid)_BEFORE_CALL_5| |v_main_~#b~0.base_BEFORE_CALL_10|)))) [2020-07-29 01:01:05,176 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [|v_main_~#mask~0.base_BEFORE_CALL_14|, |v_main_~#b~0.base_BEFORE_CALL_10|]. (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_14|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_14| |v_main_~#b~0.base_BEFORE_CALL_10|))) [2020-07-29 01:01:06,945 INFO L263 TraceCheckUtils]: 0: Hoare triple {8506#true} call ULTIMATE.init(); {8506#true} is VALID [2020-07-29 01:01:06,946 INFO L280 TraceCheckUtils]: 1: Hoare triple {8506#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {8506#true} is VALID [2020-07-29 01:01:06,946 INFO L280 TraceCheckUtils]: 2: Hoare triple {8506#true} assume true; {8506#true} is VALID [2020-07-29 01:01:06,946 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8506#true} {8506#true} #74#return; {8506#true} is VALID [2020-07-29 01:01:06,947 INFO L263 TraceCheckUtils]: 4: Hoare triple {8506#true} call #t~ret6 := main(); {8603#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:01:06,948 INFO L280 TraceCheckUtils]: 5: Hoare triple {8603#(= |#valid| |old(#valid)|)} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(128);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} is VALID [2020-07-29 01:01:06,949 INFO L280 TraceCheckUtils]: 6: Hoare triple {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} is VALID [2020-07-29 01:01:06,950 INFO L263 TraceCheckUtils]: 7: Hoare triple {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:06,951 INFO L280 TraceCheckUtils]: 8: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:06,952 INFO L280 TraceCheckUtils]: 9: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume !(~i~0 < ~size); {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:06,952 INFO L280 TraceCheckUtils]: 10: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} #res := ~i~0; {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:06,953 INFO L280 TraceCheckUtils]: 11: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume true; {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:06,954 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} #78#return; {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} is VALID [2020-07-29 01:01:06,955 INFO L280 TraceCheckUtils]: 13: Hoare triple {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} is VALID [2020-07-29 01:01:06,956 INFO L280 TraceCheckUtils]: 14: Hoare triple {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} is VALID [2020-07-29 01:01:06,956 INFO L280 TraceCheckUtils]: 15: Hoare triple {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} havoc #t~ret3; {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} is VALID [2020-07-29 01:01:06,957 INFO L280 TraceCheckUtils]: 16: Hoare triple {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} is VALID [2020-07-29 01:01:06,957 INFO L280 TraceCheckUtils]: 17: Hoare triple {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} is VALID [2020-07-29 01:01:06,958 INFO L263 TraceCheckUtils]: 18: Hoare triple {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:06,959 INFO L280 TraceCheckUtils]: 19: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:06,959 INFO L280 TraceCheckUtils]: 20: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume !!(~i~0 < ~size); {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:06,960 INFO L280 TraceCheckUtils]: 21: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume 0 <= ~i~0 && ~i~0 < 32; {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:06,967 INFO L280 TraceCheckUtils]: 22: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:06,968 INFO L280 TraceCheckUtils]: 23: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:06,969 INFO L280 TraceCheckUtils]: 24: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:06,973 INFO L280 TraceCheckUtils]: 25: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume !(~i~0 < ~size); {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:06,974 INFO L280 TraceCheckUtils]: 26: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} #res := ~i~0; {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:06,978 INFO L280 TraceCheckUtils]: 27: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume true; {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:06,985 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} #78#return; {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} is VALID [2020-07-29 01:01:06,986 INFO L280 TraceCheckUtils]: 29: Hoare triple {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} is VALID [2020-07-29 01:01:06,987 INFO L280 TraceCheckUtils]: 30: Hoare triple {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} is VALID [2020-07-29 01:01:06,988 INFO L280 TraceCheckUtils]: 31: Hoare triple {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} havoc #t~ret3; {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} is VALID [2020-07-29 01:01:06,989 INFO L280 TraceCheckUtils]: 32: Hoare triple {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} is VALID [2020-07-29 01:01:06,989 INFO L280 TraceCheckUtils]: 33: Hoare triple {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} is VALID [2020-07-29 01:01:06,991 INFO L263 TraceCheckUtils]: 34: Hoare triple {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:06,992 INFO L280 TraceCheckUtils]: 35: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:06,992 INFO L280 TraceCheckUtils]: 36: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume !!(~i~0 < ~size); {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:06,993 INFO L280 TraceCheckUtils]: 37: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume 0 <= ~i~0 && ~i~0 < 32; {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:06,993 INFO L280 TraceCheckUtils]: 38: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:06,994 INFO L280 TraceCheckUtils]: 39: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:06,994 INFO L280 TraceCheckUtils]: 40: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:06,995 INFO L280 TraceCheckUtils]: 41: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume !!(~i~0 < ~size); {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:06,996 INFO L280 TraceCheckUtils]: 42: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume 0 <= ~i~0 && ~i~0 < 32; {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:06,996 INFO L280 TraceCheckUtils]: 43: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:06,997 INFO L280 TraceCheckUtils]: 44: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:06,997 INFO L280 TraceCheckUtils]: 45: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:06,998 INFO L280 TraceCheckUtils]: 46: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume !(~i~0 < ~size); {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:06,998 INFO L280 TraceCheckUtils]: 47: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} #res := ~i~0; {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:06,999 INFO L280 TraceCheckUtils]: 48: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume true; {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:07,000 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} #78#return; {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} is VALID [2020-07-29 01:01:07,008 INFO L280 TraceCheckUtils]: 50: Hoare triple {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} is VALID [2020-07-29 01:01:07,009 INFO L280 TraceCheckUtils]: 51: Hoare triple {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} is VALID [2020-07-29 01:01:07,010 INFO L280 TraceCheckUtils]: 52: Hoare triple {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} havoc #t~ret3; {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} is VALID [2020-07-29 01:01:07,011 INFO L280 TraceCheckUtils]: 53: Hoare triple {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} is VALID [2020-07-29 01:01:07,011 INFO L280 TraceCheckUtils]: 54: Hoare triple {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} is VALID [2020-07-29 01:01:07,013 INFO L263 TraceCheckUtils]: 55: Hoare triple {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:07,014 INFO L280 TraceCheckUtils]: 56: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:07,014 INFO L280 TraceCheckUtils]: 57: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume !!(~i~0 < ~size); {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:07,015 INFO L280 TraceCheckUtils]: 58: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume 0 <= ~i~0 && ~i~0 < 32; {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:07,015 INFO L280 TraceCheckUtils]: 59: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:07,016 INFO L280 TraceCheckUtils]: 60: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:07,016 INFO L280 TraceCheckUtils]: 61: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:07,017 INFO L280 TraceCheckUtils]: 62: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume !!(~i~0 < ~size); {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:07,017 INFO L280 TraceCheckUtils]: 63: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume 0 <= ~i~0 && ~i~0 < 32; {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:07,018 INFO L280 TraceCheckUtils]: 64: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:07,018 INFO L280 TraceCheckUtils]: 65: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:07,019 INFO L280 TraceCheckUtils]: 66: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:07,019 INFO L280 TraceCheckUtils]: 67: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume !!(~i~0 < ~size); {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:07,020 INFO L280 TraceCheckUtils]: 68: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume 0 <= ~i~0 && ~i~0 < 32; {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:07,020 INFO L280 TraceCheckUtils]: 69: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:07,021 INFO L280 TraceCheckUtils]: 70: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:07,021 INFO L280 TraceCheckUtils]: 71: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:07,022 INFO L280 TraceCheckUtils]: 72: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume !(~i~0 < ~size); {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:07,022 INFO L280 TraceCheckUtils]: 73: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} #res := ~i~0; {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:07,023 INFO L280 TraceCheckUtils]: 74: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume true; {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:07,024 INFO L275 TraceCheckUtils]: 75: Hoare quadruple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} #78#return; {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} is VALID [2020-07-29 01:01:07,024 INFO L280 TraceCheckUtils]: 76: Hoare triple {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} is VALID [2020-07-29 01:01:07,025 INFO L280 TraceCheckUtils]: 77: Hoare triple {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} is VALID [2020-07-29 01:01:07,026 INFO L280 TraceCheckUtils]: 78: Hoare triple {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} havoc #t~ret3; {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} is VALID [2020-07-29 01:01:07,027 INFO L280 TraceCheckUtils]: 79: Hoare triple {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} is VALID [2020-07-29 01:01:07,027 INFO L280 TraceCheckUtils]: 80: Hoare triple {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} is VALID [2020-07-29 01:01:07,029 INFO L263 TraceCheckUtils]: 81: Hoare triple {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:07,030 INFO L280 TraceCheckUtils]: 82: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:07,030 INFO L280 TraceCheckUtils]: 83: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume !!(~i~0 < ~size); {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:07,030 INFO L280 TraceCheckUtils]: 84: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume 0 <= ~i~0 && ~i~0 < 32; {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:07,031 INFO L280 TraceCheckUtils]: 85: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:07,031 INFO L280 TraceCheckUtils]: 86: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:07,032 INFO L280 TraceCheckUtils]: 87: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:07,032 INFO L280 TraceCheckUtils]: 88: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume !!(~i~0 < ~size); {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:07,033 INFO L280 TraceCheckUtils]: 89: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume 0 <= ~i~0 && ~i~0 < 32; {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:07,033 INFO L280 TraceCheckUtils]: 90: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:07,034 INFO L280 TraceCheckUtils]: 91: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:07,034 INFO L280 TraceCheckUtils]: 92: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:07,035 INFO L280 TraceCheckUtils]: 93: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume !!(~i~0 < ~size); {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:07,035 INFO L280 TraceCheckUtils]: 94: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume 0 <= ~i~0 && ~i~0 < 32; {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:07,036 INFO L280 TraceCheckUtils]: 95: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:07,036 INFO L280 TraceCheckUtils]: 96: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:07,037 INFO L280 TraceCheckUtils]: 97: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:07,037 INFO L280 TraceCheckUtils]: 98: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume !(~i~0 < ~size); {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:07,038 INFO L280 TraceCheckUtils]: 99: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} #res := ~i~0; {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:07,038 INFO L280 TraceCheckUtils]: 100: Hoare triple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume true; {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:07,039 INFO L275 TraceCheckUtils]: 101: Hoare quadruple {8614#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_10|)) (not (= |v_main_~#mask~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} #78#return; {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} is VALID [2020-07-29 01:01:07,040 INFO L280 TraceCheckUtils]: 102: Hoare triple {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} is VALID [2020-07-29 01:01:07,041 INFO L280 TraceCheckUtils]: 103: Hoare triple {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} is VALID [2020-07-29 01:01:07,042 INFO L280 TraceCheckUtils]: 104: Hoare triple {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} havoc #t~ret3; {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} is VALID [2020-07-29 01:01:07,042 INFO L280 TraceCheckUtils]: 105: Hoare triple {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} is VALID [2020-07-29 01:01:07,043 INFO L280 TraceCheckUtils]: 106: Hoare triple {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} assume !(~i~1 < 32); {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} is VALID [2020-07-29 01:01:07,044 INFO L280 TraceCheckUtils]: 107: Hoare triple {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} ~i~1 := 0; {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} is VALID [2020-07-29 01:01:07,044 INFO L280 TraceCheckUtils]: 108: Hoare triple {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} assume !!(~i~1 < 32); {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} is VALID [2020-07-29 01:01:07,045 INFO L280 TraceCheckUtils]: 109: Hoare triple {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} SUMMARY for call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L30 {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} is VALID [2020-07-29 01:01:07,046 INFO L280 TraceCheckUtils]: 110: Hoare triple {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} assume #t~mem5 != ~i~1;havoc #t~mem5; {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} is VALID [2020-07-29 01:01:07,048 INFO L280 TraceCheckUtils]: 111: Hoare triple {8607#(and (= 0 (select (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base|)) (= (select |old(#valid)| |main_~#b~0.base|) 0) (= |#valid| (store (store |old(#valid)| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)))} #res := 1;call ULTIMATE.dealloc(~#b~0.base, ~#b~0.offset);havoc ~#b~0.base, ~#b~0.offset;call ULTIMATE.dealloc(~#mask~0.base, ~#mask~0.offset);havoc ~#mask~0.base, ~#mask~0.offset; {8927#(exists ((|v_main_~#mask~0.base_7| Int) (|v_main_~#b~0.base_12| Int)) (and (= (store (store (store (store |old(#valid)| |v_main_~#b~0.base_12| 1) |v_main_~#mask~0.base_7| 1) |v_main_~#b~0.base_12| 0) |v_main_~#mask~0.base_7| 0) |#valid|) (= 0 (select |old(#valid)| |v_main_~#b~0.base_12|)) (= 0 (select (store |old(#valid)| |v_main_~#b~0.base_12| 1) |v_main_~#mask~0.base_7|))))} is VALID [2020-07-29 01:01:07,049 INFO L280 TraceCheckUtils]: 112: Hoare triple {8927#(exists ((|v_main_~#mask~0.base_7| Int) (|v_main_~#b~0.base_12| Int)) (and (= (store (store (store (store |old(#valid)| |v_main_~#b~0.base_12| 1) |v_main_~#mask~0.base_7| 1) |v_main_~#b~0.base_12| 0) |v_main_~#mask~0.base_7| 0) |#valid|) (= 0 (select |old(#valid)| |v_main_~#b~0.base_12|)) (= 0 (select (store |old(#valid)| |v_main_~#b~0.base_12| 1) |v_main_~#mask~0.base_7|))))} assume !(#valid == old(#valid)); {8507#false} is VALID [2020-07-29 01:01:07,128 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2020-07-29 01:01:07,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-29 01:01:07,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2020-07-29 01:01:07,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581603122] [2020-07-29 01:01:07,130 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2020-07-29 01:01:07,130 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:01:07,130 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:01:07,170 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:01:07,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-29 01:01:07,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:01:07,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:01:07,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-07-29 01:01:07,171 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand 6 states. [2020-07-29 01:01:07,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:01:07,387 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2020-07-29 01:01:07,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:01:07,387 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2020-07-29 01:01:07,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:01:07,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:01:07,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2020-07-29 01:01:07,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:01:07,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2020-07-29 01:01:07,392 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 34 transitions. [2020-07-29 01:01:07,454 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:01:07,456 INFO L225 Difference]: With dead ends: 113 [2020-07-29 01:01:07,456 INFO L226 Difference]: Without dead ends: 110 [2020-07-29 01:01:07,457 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 112 SyntacticMatches, 9 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2020-07-29 01:01:07,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-07-29 01:01:07,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2020-07-29 01:01:07,462 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:01:07,463 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand 107 states. [2020-07-29 01:01:07,463 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 107 states. [2020-07-29 01:01:07,463 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 107 states. [2020-07-29 01:01:07,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:01:07,469 INFO L93 Difference]: Finished difference Result 110 states and 113 transitions. [2020-07-29 01:01:07,469 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 113 transitions. [2020-07-29 01:01:07,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:01:07,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:01:07,472 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 110 states. [2020-07-29 01:01:07,472 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 110 states. [2020-07-29 01:01:07,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:01:07,476 INFO L93 Difference]: Finished difference Result 110 states and 113 transitions. [2020-07-29 01:01:07,476 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 113 transitions. [2020-07-29 01:01:07,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:01:07,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:01:07,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:01:07,477 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:01:07,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-07-29 01:01:07,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 110 transitions. [2020-07-29 01:01:07,483 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 110 transitions. Word has length 113 [2020-07-29 01:01:07,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:01:07,484 INFO L479 AbstractCegarLoop]: Abstraction has 107 states and 110 transitions. [2020-07-29 01:01:07,484 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-29 01:01:07,484 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 110 transitions. [2020-07-29 01:01:07,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2020-07-29 01:01:07,486 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:01:07,486 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:01:07,699 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:01:07,700 INFO L427 AbstractCegarLoop]: === Iteration 21 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:01:07,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:01:07,700 INFO L82 PathProgramCache]: Analyzing trace with hash 419498507, now seen corresponding path program 1 times [2020-07-29 01:01:07,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:01:07,700 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688136537] [2020-07-29 01:01:07,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:01:07,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:07,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:01:07,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:07,829 INFO L280 TraceCheckUtils]: 0: Hoare triple {9453#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {9372#true} is VALID [2020-07-29 01:01:07,830 INFO L280 TraceCheckUtils]: 1: Hoare triple {9372#true} assume true; {9372#true} is VALID [2020-07-29 01:01:07,830 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {9372#true} {9372#true} #74#return; {9372#true} is VALID [2020-07-29 01:01:07,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-07-29 01:01:07,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:07,835 INFO L280 TraceCheckUtils]: 0: Hoare triple {9372#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {9372#true} is VALID [2020-07-29 01:01:07,835 INFO L280 TraceCheckUtils]: 1: Hoare triple {9372#true} assume !(~i~0 < ~size); {9372#true} is VALID [2020-07-29 01:01:07,835 INFO L280 TraceCheckUtils]: 2: Hoare triple {9372#true} #res := ~i~0; {9372#true} is VALID [2020-07-29 01:01:07,836 INFO L280 TraceCheckUtils]: 3: Hoare triple {9372#true} assume true; {9372#true} is VALID [2020-07-29 01:01:07,837 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {9372#true} {9377#(= 0 main_~i~1)} #78#return; {9377#(= 0 main_~i~1)} is VALID [2020-07-29 01:01:07,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-07-29 01:01:07,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:07,844 INFO L280 TraceCheckUtils]: 0: Hoare triple {9372#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {9372#true} is VALID [2020-07-29 01:01:07,844 INFO L280 TraceCheckUtils]: 1: Hoare triple {9372#true} assume !!(~i~0 < ~size); {9372#true} is VALID [2020-07-29 01:01:07,844 INFO L280 TraceCheckUtils]: 2: Hoare triple {9372#true} assume 0 <= ~i~0 && ~i~0 < 32; {9372#true} is VALID [2020-07-29 01:01:07,844 INFO L280 TraceCheckUtils]: 3: Hoare triple {9372#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {9372#true} is VALID [2020-07-29 01:01:07,844 INFO L280 TraceCheckUtils]: 4: Hoare triple {9372#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {9372#true} is VALID [2020-07-29 01:01:07,845 INFO L280 TraceCheckUtils]: 5: Hoare triple {9372#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9372#true} is VALID [2020-07-29 01:01:07,845 INFO L280 TraceCheckUtils]: 6: Hoare triple {9372#true} assume !(~i~0 < ~size); {9372#true} is VALID [2020-07-29 01:01:07,845 INFO L280 TraceCheckUtils]: 7: Hoare triple {9372#true} #res := ~i~0; {9372#true} is VALID [2020-07-29 01:01:07,845 INFO L280 TraceCheckUtils]: 8: Hoare triple {9372#true} assume true; {9372#true} is VALID [2020-07-29 01:01:07,847 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {9372#true} {9383#(<= main_~i~1 1)} #78#return; {9383#(<= main_~i~1 1)} is VALID [2020-07-29 01:01:07,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-07-29 01:01:07,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:07,856 INFO L280 TraceCheckUtils]: 0: Hoare triple {9372#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {9372#true} is VALID [2020-07-29 01:01:07,857 INFO L280 TraceCheckUtils]: 1: Hoare triple {9372#true} assume !!(~i~0 < ~size); {9372#true} is VALID [2020-07-29 01:01:07,857 INFO L280 TraceCheckUtils]: 2: Hoare triple {9372#true} assume 0 <= ~i~0 && ~i~0 < 32; {9372#true} is VALID [2020-07-29 01:01:07,857 INFO L280 TraceCheckUtils]: 3: Hoare triple {9372#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {9372#true} is VALID [2020-07-29 01:01:07,857 INFO L280 TraceCheckUtils]: 4: Hoare triple {9372#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {9372#true} is VALID [2020-07-29 01:01:07,857 INFO L280 TraceCheckUtils]: 5: Hoare triple {9372#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9372#true} is VALID [2020-07-29 01:01:07,858 INFO L280 TraceCheckUtils]: 6: Hoare triple {9372#true} assume !!(~i~0 < ~size); {9372#true} is VALID [2020-07-29 01:01:07,858 INFO L280 TraceCheckUtils]: 7: Hoare triple {9372#true} assume 0 <= ~i~0 && ~i~0 < 32; {9372#true} is VALID [2020-07-29 01:01:07,858 INFO L280 TraceCheckUtils]: 8: Hoare triple {9372#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {9372#true} is VALID [2020-07-29 01:01:07,858 INFO L280 TraceCheckUtils]: 9: Hoare triple {9372#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {9372#true} is VALID [2020-07-29 01:01:07,858 INFO L280 TraceCheckUtils]: 10: Hoare triple {9372#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9372#true} is VALID [2020-07-29 01:01:07,858 INFO L280 TraceCheckUtils]: 11: Hoare triple {9372#true} assume !(~i~0 < ~size); {9372#true} is VALID [2020-07-29 01:01:07,859 INFO L280 TraceCheckUtils]: 12: Hoare triple {9372#true} #res := ~i~0; {9372#true} is VALID [2020-07-29 01:01:07,859 INFO L280 TraceCheckUtils]: 13: Hoare triple {9372#true} assume true; {9372#true} is VALID [2020-07-29 01:01:07,861 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {9372#true} {9394#(<= main_~i~1 2)} #78#return; {9394#(<= main_~i~1 2)} is VALID [2020-07-29 01:01:07,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-07-29 01:01:07,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:07,870 INFO L280 TraceCheckUtils]: 0: Hoare triple {9372#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {9372#true} is VALID [2020-07-29 01:01:07,870 INFO L280 TraceCheckUtils]: 1: Hoare triple {9372#true} assume !!(~i~0 < ~size); {9372#true} is VALID [2020-07-29 01:01:07,870 INFO L280 TraceCheckUtils]: 2: Hoare triple {9372#true} assume 0 <= ~i~0 && ~i~0 < 32; {9372#true} is VALID [2020-07-29 01:01:07,870 INFO L280 TraceCheckUtils]: 3: Hoare triple {9372#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {9372#true} is VALID [2020-07-29 01:01:07,871 INFO L280 TraceCheckUtils]: 4: Hoare triple {9372#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {9372#true} is VALID [2020-07-29 01:01:07,871 INFO L280 TraceCheckUtils]: 5: Hoare triple {9372#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9372#true} is VALID [2020-07-29 01:01:07,871 INFO L280 TraceCheckUtils]: 6: Hoare triple {9372#true} assume !!(~i~0 < ~size); {9372#true} is VALID [2020-07-29 01:01:07,872 INFO L280 TraceCheckUtils]: 7: Hoare triple {9372#true} assume 0 <= ~i~0 && ~i~0 < 32; {9372#true} is VALID [2020-07-29 01:01:07,872 INFO L280 TraceCheckUtils]: 8: Hoare triple {9372#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {9372#true} is VALID [2020-07-29 01:01:07,872 INFO L280 TraceCheckUtils]: 9: Hoare triple {9372#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {9372#true} is VALID [2020-07-29 01:01:07,872 INFO L280 TraceCheckUtils]: 10: Hoare triple {9372#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9372#true} is VALID [2020-07-29 01:01:07,872 INFO L280 TraceCheckUtils]: 11: Hoare triple {9372#true} assume !!(~i~0 < ~size); {9372#true} is VALID [2020-07-29 01:01:07,872 INFO L280 TraceCheckUtils]: 12: Hoare triple {9372#true} assume 0 <= ~i~0 && ~i~0 < 32; {9372#true} is VALID [2020-07-29 01:01:07,873 INFO L280 TraceCheckUtils]: 13: Hoare triple {9372#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {9372#true} is VALID [2020-07-29 01:01:07,873 INFO L280 TraceCheckUtils]: 14: Hoare triple {9372#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {9372#true} is VALID [2020-07-29 01:01:07,873 INFO L280 TraceCheckUtils]: 15: Hoare triple {9372#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9372#true} is VALID [2020-07-29 01:01:07,874 INFO L280 TraceCheckUtils]: 16: Hoare triple {9372#true} assume !(~i~0 < ~size); {9372#true} is VALID [2020-07-29 01:01:07,874 INFO L280 TraceCheckUtils]: 17: Hoare triple {9372#true} #res := ~i~0; {9372#true} is VALID [2020-07-29 01:01:07,874 INFO L280 TraceCheckUtils]: 18: Hoare triple {9372#true} assume true; {9372#true} is VALID [2020-07-29 01:01:07,875 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {9372#true} {9410#(<= main_~i~1 3)} #78#return; {9410#(<= main_~i~1 3)} is VALID [2020-07-29 01:01:07,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-07-29 01:01:07,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:07,885 INFO L280 TraceCheckUtils]: 0: Hoare triple {9372#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {9372#true} is VALID [2020-07-29 01:01:07,885 INFO L280 TraceCheckUtils]: 1: Hoare triple {9372#true} assume !!(~i~0 < ~size); {9372#true} is VALID [2020-07-29 01:01:07,886 INFO L280 TraceCheckUtils]: 2: Hoare triple {9372#true} assume 0 <= ~i~0 && ~i~0 < 32; {9372#true} is VALID [2020-07-29 01:01:07,886 INFO L280 TraceCheckUtils]: 3: Hoare triple {9372#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {9372#true} is VALID [2020-07-29 01:01:07,886 INFO L280 TraceCheckUtils]: 4: Hoare triple {9372#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {9372#true} is VALID [2020-07-29 01:01:07,886 INFO L280 TraceCheckUtils]: 5: Hoare triple {9372#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9372#true} is VALID [2020-07-29 01:01:07,887 INFO L280 TraceCheckUtils]: 6: Hoare triple {9372#true} assume !!(~i~0 < ~size); {9372#true} is VALID [2020-07-29 01:01:07,887 INFO L280 TraceCheckUtils]: 7: Hoare triple {9372#true} assume 0 <= ~i~0 && ~i~0 < 32; {9372#true} is VALID [2020-07-29 01:01:07,887 INFO L280 TraceCheckUtils]: 8: Hoare triple {9372#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {9372#true} is VALID [2020-07-29 01:01:07,887 INFO L280 TraceCheckUtils]: 9: Hoare triple {9372#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {9372#true} is VALID [2020-07-29 01:01:07,887 INFO L280 TraceCheckUtils]: 10: Hoare triple {9372#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9372#true} is VALID [2020-07-29 01:01:07,887 INFO L280 TraceCheckUtils]: 11: Hoare triple {9372#true} assume !!(~i~0 < ~size); {9372#true} is VALID [2020-07-29 01:01:07,888 INFO L280 TraceCheckUtils]: 12: Hoare triple {9372#true} assume 0 <= ~i~0 && ~i~0 < 32; {9372#true} is VALID [2020-07-29 01:01:07,888 INFO L280 TraceCheckUtils]: 13: Hoare triple {9372#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {9372#true} is VALID [2020-07-29 01:01:07,888 INFO L280 TraceCheckUtils]: 14: Hoare triple {9372#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {9372#true} is VALID [2020-07-29 01:01:07,888 INFO L280 TraceCheckUtils]: 15: Hoare triple {9372#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9372#true} is VALID [2020-07-29 01:01:07,889 INFO L280 TraceCheckUtils]: 16: Hoare triple {9372#true} assume !(~i~0 < ~size); {9372#true} is VALID [2020-07-29 01:01:07,889 INFO L280 TraceCheckUtils]: 17: Hoare triple {9372#true} #res := ~i~0; {9372#true} is VALID [2020-07-29 01:01:07,889 INFO L280 TraceCheckUtils]: 18: Hoare triple {9372#true} assume true; {9372#true} is VALID [2020-07-29 01:01:07,890 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {9372#true} {9431#(<= main_~i~1 4)} #78#return; {9431#(<= main_~i~1 4)} is VALID [2020-07-29 01:01:07,892 INFO L263 TraceCheckUtils]: 0: Hoare triple {9372#true} call ULTIMATE.init(); {9453#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:01:07,892 INFO L280 TraceCheckUtils]: 1: Hoare triple {9453#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {9372#true} is VALID [2020-07-29 01:01:07,892 INFO L280 TraceCheckUtils]: 2: Hoare triple {9372#true} assume true; {9372#true} is VALID [2020-07-29 01:01:07,892 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {9372#true} {9372#true} #74#return; {9372#true} is VALID [2020-07-29 01:01:07,892 INFO L263 TraceCheckUtils]: 4: Hoare triple {9372#true} call #t~ret6 := main(); {9372#true} is VALID [2020-07-29 01:01:07,894 INFO L280 TraceCheckUtils]: 5: Hoare triple {9372#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(128);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {9377#(= 0 main_~i~1)} is VALID [2020-07-29 01:01:07,894 INFO L280 TraceCheckUtils]: 6: Hoare triple {9377#(= 0 main_~i~1)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {9377#(= 0 main_~i~1)} is VALID [2020-07-29 01:01:07,895 INFO L263 TraceCheckUtils]: 7: Hoare triple {9377#(= 0 main_~i~1)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {9372#true} is VALID [2020-07-29 01:01:07,895 INFO L280 TraceCheckUtils]: 8: Hoare triple {9372#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {9372#true} is VALID [2020-07-29 01:01:07,895 INFO L280 TraceCheckUtils]: 9: Hoare triple {9372#true} assume !(~i~0 < ~size); {9372#true} is VALID [2020-07-29 01:01:07,895 INFO L280 TraceCheckUtils]: 10: Hoare triple {9372#true} #res := ~i~0; {9372#true} is VALID [2020-07-29 01:01:07,895 INFO L280 TraceCheckUtils]: 11: Hoare triple {9372#true} assume true; {9372#true} is VALID [2020-07-29 01:01:07,897 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {9372#true} {9377#(= 0 main_~i~1)} #78#return; {9377#(= 0 main_~i~1)} is VALID [2020-07-29 01:01:07,897 INFO L280 TraceCheckUtils]: 13: Hoare triple {9377#(= 0 main_~i~1)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {9377#(= 0 main_~i~1)} is VALID [2020-07-29 01:01:07,898 INFO L280 TraceCheckUtils]: 14: Hoare triple {9377#(= 0 main_~i~1)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {9377#(= 0 main_~i~1)} is VALID [2020-07-29 01:01:07,899 INFO L280 TraceCheckUtils]: 15: Hoare triple {9377#(= 0 main_~i~1)} havoc #t~ret3; {9377#(= 0 main_~i~1)} is VALID [2020-07-29 01:01:07,900 INFO L280 TraceCheckUtils]: 16: Hoare triple {9377#(= 0 main_~i~1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9383#(<= main_~i~1 1)} is VALID [2020-07-29 01:01:07,901 INFO L280 TraceCheckUtils]: 17: Hoare triple {9383#(<= main_~i~1 1)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {9383#(<= main_~i~1 1)} is VALID [2020-07-29 01:01:07,901 INFO L263 TraceCheckUtils]: 18: Hoare triple {9383#(<= main_~i~1 1)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {9372#true} is VALID [2020-07-29 01:01:07,901 INFO L280 TraceCheckUtils]: 19: Hoare triple {9372#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {9372#true} is VALID [2020-07-29 01:01:07,901 INFO L280 TraceCheckUtils]: 20: Hoare triple {9372#true} assume !!(~i~0 < ~size); {9372#true} is VALID [2020-07-29 01:01:07,901 INFO L280 TraceCheckUtils]: 21: Hoare triple {9372#true} assume 0 <= ~i~0 && ~i~0 < 32; {9372#true} is VALID [2020-07-29 01:01:07,902 INFO L280 TraceCheckUtils]: 22: Hoare triple {9372#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {9372#true} is VALID [2020-07-29 01:01:07,902 INFO L280 TraceCheckUtils]: 23: Hoare triple {9372#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {9372#true} is VALID [2020-07-29 01:01:07,902 INFO L280 TraceCheckUtils]: 24: Hoare triple {9372#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9372#true} is VALID [2020-07-29 01:01:07,902 INFO L280 TraceCheckUtils]: 25: Hoare triple {9372#true} assume !(~i~0 < ~size); {9372#true} is VALID [2020-07-29 01:01:07,903 INFO L280 TraceCheckUtils]: 26: Hoare triple {9372#true} #res := ~i~0; {9372#true} is VALID [2020-07-29 01:01:07,903 INFO L280 TraceCheckUtils]: 27: Hoare triple {9372#true} assume true; {9372#true} is VALID [2020-07-29 01:01:07,904 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {9372#true} {9383#(<= main_~i~1 1)} #78#return; {9383#(<= main_~i~1 1)} is VALID [2020-07-29 01:01:07,905 INFO L280 TraceCheckUtils]: 29: Hoare triple {9383#(<= main_~i~1 1)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {9383#(<= main_~i~1 1)} is VALID [2020-07-29 01:01:07,905 INFO L280 TraceCheckUtils]: 30: Hoare triple {9383#(<= main_~i~1 1)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {9383#(<= main_~i~1 1)} is VALID [2020-07-29 01:01:07,906 INFO L280 TraceCheckUtils]: 31: Hoare triple {9383#(<= main_~i~1 1)} havoc #t~ret3; {9383#(<= main_~i~1 1)} is VALID [2020-07-29 01:01:07,907 INFO L280 TraceCheckUtils]: 32: Hoare triple {9383#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9394#(<= main_~i~1 2)} is VALID [2020-07-29 01:01:07,908 INFO L280 TraceCheckUtils]: 33: Hoare triple {9394#(<= main_~i~1 2)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {9394#(<= main_~i~1 2)} is VALID [2020-07-29 01:01:07,908 INFO L263 TraceCheckUtils]: 34: Hoare triple {9394#(<= main_~i~1 2)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {9372#true} is VALID [2020-07-29 01:01:07,908 INFO L280 TraceCheckUtils]: 35: Hoare triple {9372#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {9372#true} is VALID [2020-07-29 01:01:07,909 INFO L280 TraceCheckUtils]: 36: Hoare triple {9372#true} assume !!(~i~0 < ~size); {9372#true} is VALID [2020-07-29 01:01:07,909 INFO L280 TraceCheckUtils]: 37: Hoare triple {9372#true} assume 0 <= ~i~0 && ~i~0 < 32; {9372#true} is VALID [2020-07-29 01:01:07,909 INFO L280 TraceCheckUtils]: 38: Hoare triple {9372#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {9372#true} is VALID [2020-07-29 01:01:07,910 INFO L280 TraceCheckUtils]: 39: Hoare triple {9372#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {9372#true} is VALID [2020-07-29 01:01:07,910 INFO L280 TraceCheckUtils]: 40: Hoare triple {9372#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9372#true} is VALID [2020-07-29 01:01:07,910 INFO L280 TraceCheckUtils]: 41: Hoare triple {9372#true} assume !!(~i~0 < ~size); {9372#true} is VALID [2020-07-29 01:01:07,910 INFO L280 TraceCheckUtils]: 42: Hoare triple {9372#true} assume 0 <= ~i~0 && ~i~0 < 32; {9372#true} is VALID [2020-07-29 01:01:07,910 INFO L280 TraceCheckUtils]: 43: Hoare triple {9372#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {9372#true} is VALID [2020-07-29 01:01:07,911 INFO L280 TraceCheckUtils]: 44: Hoare triple {9372#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {9372#true} is VALID [2020-07-29 01:01:07,911 INFO L280 TraceCheckUtils]: 45: Hoare triple {9372#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9372#true} is VALID [2020-07-29 01:01:07,911 INFO L280 TraceCheckUtils]: 46: Hoare triple {9372#true} assume !(~i~0 < ~size); {9372#true} is VALID [2020-07-29 01:01:07,912 INFO L280 TraceCheckUtils]: 47: Hoare triple {9372#true} #res := ~i~0; {9372#true} is VALID [2020-07-29 01:01:07,912 INFO L280 TraceCheckUtils]: 48: Hoare triple {9372#true} assume true; {9372#true} is VALID [2020-07-29 01:01:07,914 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {9372#true} {9394#(<= main_~i~1 2)} #78#return; {9394#(<= main_~i~1 2)} is VALID [2020-07-29 01:01:07,915 INFO L280 TraceCheckUtils]: 50: Hoare triple {9394#(<= main_~i~1 2)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {9394#(<= main_~i~1 2)} is VALID [2020-07-29 01:01:07,915 INFO L280 TraceCheckUtils]: 51: Hoare triple {9394#(<= main_~i~1 2)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {9394#(<= main_~i~1 2)} is VALID [2020-07-29 01:01:07,916 INFO L280 TraceCheckUtils]: 52: Hoare triple {9394#(<= main_~i~1 2)} havoc #t~ret3; {9394#(<= main_~i~1 2)} is VALID [2020-07-29 01:01:07,917 INFO L280 TraceCheckUtils]: 53: Hoare triple {9394#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9410#(<= main_~i~1 3)} is VALID [2020-07-29 01:01:07,918 INFO L280 TraceCheckUtils]: 54: Hoare triple {9410#(<= main_~i~1 3)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {9410#(<= main_~i~1 3)} is VALID [2020-07-29 01:01:07,918 INFO L263 TraceCheckUtils]: 55: Hoare triple {9410#(<= main_~i~1 3)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {9372#true} is VALID [2020-07-29 01:01:07,918 INFO L280 TraceCheckUtils]: 56: Hoare triple {9372#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {9372#true} is VALID [2020-07-29 01:01:07,919 INFO L280 TraceCheckUtils]: 57: Hoare triple {9372#true} assume !!(~i~0 < ~size); {9372#true} is VALID [2020-07-29 01:01:07,919 INFO L280 TraceCheckUtils]: 58: Hoare triple {9372#true} assume 0 <= ~i~0 && ~i~0 < 32; {9372#true} is VALID [2020-07-29 01:01:07,919 INFO L280 TraceCheckUtils]: 59: Hoare triple {9372#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {9372#true} is VALID [2020-07-29 01:01:07,919 INFO L280 TraceCheckUtils]: 60: Hoare triple {9372#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {9372#true} is VALID [2020-07-29 01:01:07,919 INFO L280 TraceCheckUtils]: 61: Hoare triple {9372#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9372#true} is VALID [2020-07-29 01:01:07,919 INFO L280 TraceCheckUtils]: 62: Hoare triple {9372#true} assume !!(~i~0 < ~size); {9372#true} is VALID [2020-07-29 01:01:07,920 INFO L280 TraceCheckUtils]: 63: Hoare triple {9372#true} assume 0 <= ~i~0 && ~i~0 < 32; {9372#true} is VALID [2020-07-29 01:01:07,920 INFO L280 TraceCheckUtils]: 64: Hoare triple {9372#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {9372#true} is VALID [2020-07-29 01:01:07,920 INFO L280 TraceCheckUtils]: 65: Hoare triple {9372#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {9372#true} is VALID [2020-07-29 01:01:07,920 INFO L280 TraceCheckUtils]: 66: Hoare triple {9372#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9372#true} is VALID [2020-07-29 01:01:07,920 INFO L280 TraceCheckUtils]: 67: Hoare triple {9372#true} assume !!(~i~0 < ~size); {9372#true} is VALID [2020-07-29 01:01:07,920 INFO L280 TraceCheckUtils]: 68: Hoare triple {9372#true} assume 0 <= ~i~0 && ~i~0 < 32; {9372#true} is VALID [2020-07-29 01:01:07,921 INFO L280 TraceCheckUtils]: 69: Hoare triple {9372#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {9372#true} is VALID [2020-07-29 01:01:07,921 INFO L280 TraceCheckUtils]: 70: Hoare triple {9372#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {9372#true} is VALID [2020-07-29 01:01:07,921 INFO L280 TraceCheckUtils]: 71: Hoare triple {9372#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9372#true} is VALID [2020-07-29 01:01:07,921 INFO L280 TraceCheckUtils]: 72: Hoare triple {9372#true} assume !(~i~0 < ~size); {9372#true} is VALID [2020-07-29 01:01:07,922 INFO L280 TraceCheckUtils]: 73: Hoare triple {9372#true} #res := ~i~0; {9372#true} is VALID [2020-07-29 01:01:07,922 INFO L280 TraceCheckUtils]: 74: Hoare triple {9372#true} assume true; {9372#true} is VALID [2020-07-29 01:01:07,923 INFO L275 TraceCheckUtils]: 75: Hoare quadruple {9372#true} {9410#(<= main_~i~1 3)} #78#return; {9410#(<= main_~i~1 3)} is VALID [2020-07-29 01:01:07,924 INFO L280 TraceCheckUtils]: 76: Hoare triple {9410#(<= main_~i~1 3)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {9410#(<= main_~i~1 3)} is VALID [2020-07-29 01:01:07,925 INFO L280 TraceCheckUtils]: 77: Hoare triple {9410#(<= main_~i~1 3)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {9410#(<= main_~i~1 3)} is VALID [2020-07-29 01:01:07,925 INFO L280 TraceCheckUtils]: 78: Hoare triple {9410#(<= main_~i~1 3)} havoc #t~ret3; {9410#(<= main_~i~1 3)} is VALID [2020-07-29 01:01:07,926 INFO L280 TraceCheckUtils]: 79: Hoare triple {9410#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9431#(<= main_~i~1 4)} is VALID [2020-07-29 01:01:07,927 INFO L280 TraceCheckUtils]: 80: Hoare triple {9431#(<= main_~i~1 4)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {9431#(<= main_~i~1 4)} is VALID [2020-07-29 01:01:07,927 INFO L263 TraceCheckUtils]: 81: Hoare triple {9431#(<= main_~i~1 4)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {9372#true} is VALID [2020-07-29 01:01:07,927 INFO L280 TraceCheckUtils]: 82: Hoare triple {9372#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {9372#true} is VALID [2020-07-29 01:01:07,928 INFO L280 TraceCheckUtils]: 83: Hoare triple {9372#true} assume !!(~i~0 < ~size); {9372#true} is VALID [2020-07-29 01:01:07,928 INFO L280 TraceCheckUtils]: 84: Hoare triple {9372#true} assume 0 <= ~i~0 && ~i~0 < 32; {9372#true} is VALID [2020-07-29 01:01:07,928 INFO L280 TraceCheckUtils]: 85: Hoare triple {9372#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {9372#true} is VALID [2020-07-29 01:01:07,928 INFO L280 TraceCheckUtils]: 86: Hoare triple {9372#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {9372#true} is VALID [2020-07-29 01:01:07,929 INFO L280 TraceCheckUtils]: 87: Hoare triple {9372#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9372#true} is VALID [2020-07-29 01:01:07,929 INFO L280 TraceCheckUtils]: 88: Hoare triple {9372#true} assume !!(~i~0 < ~size); {9372#true} is VALID [2020-07-29 01:01:07,929 INFO L280 TraceCheckUtils]: 89: Hoare triple {9372#true} assume 0 <= ~i~0 && ~i~0 < 32; {9372#true} is VALID [2020-07-29 01:01:07,929 INFO L280 TraceCheckUtils]: 90: Hoare triple {9372#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {9372#true} is VALID [2020-07-29 01:01:07,929 INFO L280 TraceCheckUtils]: 91: Hoare triple {9372#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {9372#true} is VALID [2020-07-29 01:01:07,929 INFO L280 TraceCheckUtils]: 92: Hoare triple {9372#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9372#true} is VALID [2020-07-29 01:01:07,930 INFO L280 TraceCheckUtils]: 93: Hoare triple {9372#true} assume !!(~i~0 < ~size); {9372#true} is VALID [2020-07-29 01:01:07,930 INFO L280 TraceCheckUtils]: 94: Hoare triple {9372#true} assume 0 <= ~i~0 && ~i~0 < 32; {9372#true} is VALID [2020-07-29 01:01:07,930 INFO L280 TraceCheckUtils]: 95: Hoare triple {9372#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {9372#true} is VALID [2020-07-29 01:01:07,930 INFO L280 TraceCheckUtils]: 96: Hoare triple {9372#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {9372#true} is VALID [2020-07-29 01:01:07,931 INFO L280 TraceCheckUtils]: 97: Hoare triple {9372#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9372#true} is VALID [2020-07-29 01:01:07,931 INFO L280 TraceCheckUtils]: 98: Hoare triple {9372#true} assume !(~i~0 < ~size); {9372#true} is VALID [2020-07-29 01:01:07,931 INFO L280 TraceCheckUtils]: 99: Hoare triple {9372#true} #res := ~i~0; {9372#true} is VALID [2020-07-29 01:01:07,931 INFO L280 TraceCheckUtils]: 100: Hoare triple {9372#true} assume true; {9372#true} is VALID [2020-07-29 01:01:07,933 INFO L275 TraceCheckUtils]: 101: Hoare quadruple {9372#true} {9431#(<= main_~i~1 4)} #78#return; {9431#(<= main_~i~1 4)} is VALID [2020-07-29 01:01:07,933 INFO L280 TraceCheckUtils]: 102: Hoare triple {9431#(<= main_~i~1 4)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {9431#(<= main_~i~1 4)} is VALID [2020-07-29 01:01:07,934 INFO L280 TraceCheckUtils]: 103: Hoare triple {9431#(<= main_~i~1 4)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {9431#(<= main_~i~1 4)} is VALID [2020-07-29 01:01:07,935 INFO L280 TraceCheckUtils]: 104: Hoare triple {9431#(<= main_~i~1 4)} havoc #t~ret3; {9431#(<= main_~i~1 4)} is VALID [2020-07-29 01:01:07,935 INFO L280 TraceCheckUtils]: 105: Hoare triple {9431#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9452#(<= main_~i~1 5)} is VALID [2020-07-29 01:01:07,936 INFO L280 TraceCheckUtils]: 106: Hoare triple {9452#(<= main_~i~1 5)} assume !(~i~1 < 32); {9373#false} is VALID [2020-07-29 01:01:07,936 INFO L280 TraceCheckUtils]: 107: Hoare triple {9373#false} ~i~1 := 0; {9373#false} is VALID [2020-07-29 01:01:07,937 INFO L280 TraceCheckUtils]: 108: Hoare triple {9373#false} assume !!(~i~1 < 32); {9373#false} is VALID [2020-07-29 01:01:07,937 INFO L280 TraceCheckUtils]: 109: Hoare triple {9373#false} SUMMARY for call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L30 {9373#false} is VALID [2020-07-29 01:01:07,937 INFO L280 TraceCheckUtils]: 110: Hoare triple {9373#false} assume !(#t~mem5 != ~i~1);havoc #t~mem5; {9373#false} is VALID [2020-07-29 01:01:07,937 INFO L280 TraceCheckUtils]: 111: Hoare triple {9373#false} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9373#false} is VALID [2020-07-29 01:01:07,938 INFO L280 TraceCheckUtils]: 112: Hoare triple {9373#false} assume !!(~i~1 < 32); {9373#false} is VALID [2020-07-29 01:01:07,938 INFO L280 TraceCheckUtils]: 113: Hoare triple {9373#false} SUMMARY for call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L30 {9373#false} is VALID [2020-07-29 01:01:07,938 INFO L280 TraceCheckUtils]: 114: Hoare triple {9373#false} assume !(#t~mem5 != ~i~1);havoc #t~mem5; {9373#false} is VALID [2020-07-29 01:01:07,938 INFO L280 TraceCheckUtils]: 115: Hoare triple {9373#false} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9373#false} is VALID [2020-07-29 01:01:07,939 INFO L280 TraceCheckUtils]: 116: Hoare triple {9373#false} assume !!(~i~1 < 32); {9373#false} is VALID [2020-07-29 01:01:07,939 INFO L280 TraceCheckUtils]: 117: Hoare triple {9373#false} SUMMARY for call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L30 {9373#false} is VALID [2020-07-29 01:01:07,939 INFO L280 TraceCheckUtils]: 118: Hoare triple {9373#false} assume !(#t~mem5 != ~i~1);havoc #t~mem5; {9373#false} is VALID [2020-07-29 01:01:07,939 INFO L280 TraceCheckUtils]: 119: Hoare triple {9373#false} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9373#false} is VALID [2020-07-29 01:01:07,939 INFO L280 TraceCheckUtils]: 120: Hoare triple {9373#false} assume !!(~i~1 < 32); {9373#false} is VALID [2020-07-29 01:01:07,939 INFO L280 TraceCheckUtils]: 121: Hoare triple {9373#false} SUMMARY for call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L30 {9373#false} is VALID [2020-07-29 01:01:07,940 INFO L280 TraceCheckUtils]: 122: Hoare triple {9373#false} assume !(#t~mem5 != ~i~1);havoc #t~mem5; {9373#false} is VALID [2020-07-29 01:01:07,940 INFO L280 TraceCheckUtils]: 123: Hoare triple {9373#false} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9373#false} is VALID [2020-07-29 01:01:07,940 INFO L280 TraceCheckUtils]: 124: Hoare triple {9373#false} assume !!(~i~1 < 32); {9373#false} is VALID [2020-07-29 01:01:07,940 INFO L280 TraceCheckUtils]: 125: Hoare triple {9373#false} assume !(4 + (~#b~0.offset + 4 * ~i~1) <= #length[~#b~0.base] && 0 <= ~#b~0.offset + 4 * ~i~1); {9373#false} is VALID [2020-07-29 01:01:07,950 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2020-07-29 01:01:07,950 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688136537] [2020-07-29 01:01:07,950 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391417776] [2020-07-29 01:01:07,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:01:08,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:08,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-29 01:01:08,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:08,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:01:08,592 INFO L263 TraceCheckUtils]: 0: Hoare triple {9372#true} call ULTIMATE.init(); {9372#true} is VALID [2020-07-29 01:01:08,593 INFO L280 TraceCheckUtils]: 1: Hoare triple {9372#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {9372#true} is VALID [2020-07-29 01:01:08,593 INFO L280 TraceCheckUtils]: 2: Hoare triple {9372#true} assume true; {9372#true} is VALID [2020-07-29 01:01:08,593 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {9372#true} {9372#true} #74#return; {9372#true} is VALID [2020-07-29 01:01:08,593 INFO L263 TraceCheckUtils]: 4: Hoare triple {9372#true} call #t~ret6 := main(); {9372#true} is VALID [2020-07-29 01:01:08,594 INFO L280 TraceCheckUtils]: 5: Hoare triple {9372#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(128);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {9472#(<= 0 main_~i~1)} is VALID [2020-07-29 01:01:08,594 INFO L280 TraceCheckUtils]: 6: Hoare triple {9472#(<= 0 main_~i~1)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {9472#(<= 0 main_~i~1)} is VALID [2020-07-29 01:01:08,594 INFO L263 TraceCheckUtils]: 7: Hoare triple {9472#(<= 0 main_~i~1)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {9372#true} is VALID [2020-07-29 01:01:08,594 INFO L280 TraceCheckUtils]: 8: Hoare triple {9372#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {9372#true} is VALID [2020-07-29 01:01:08,595 INFO L280 TraceCheckUtils]: 9: Hoare triple {9372#true} assume !(~i~0 < ~size); {9372#true} is VALID [2020-07-29 01:01:08,595 INFO L280 TraceCheckUtils]: 10: Hoare triple {9372#true} #res := ~i~0; {9372#true} is VALID [2020-07-29 01:01:08,595 INFO L280 TraceCheckUtils]: 11: Hoare triple {9372#true} assume true; {9372#true} is VALID [2020-07-29 01:01:08,596 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {9372#true} {9472#(<= 0 main_~i~1)} #78#return; {9472#(<= 0 main_~i~1)} is VALID [2020-07-29 01:01:08,596 INFO L280 TraceCheckUtils]: 13: Hoare triple {9472#(<= 0 main_~i~1)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {9472#(<= 0 main_~i~1)} is VALID [2020-07-29 01:01:08,596 INFO L280 TraceCheckUtils]: 14: Hoare triple {9472#(<= 0 main_~i~1)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {9472#(<= 0 main_~i~1)} is VALID [2020-07-29 01:01:08,597 INFO L280 TraceCheckUtils]: 15: Hoare triple {9472#(<= 0 main_~i~1)} havoc #t~ret3; {9472#(<= 0 main_~i~1)} is VALID [2020-07-29 01:01:08,597 INFO L280 TraceCheckUtils]: 16: Hoare triple {9472#(<= 0 main_~i~1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9506#(<= 1 main_~i~1)} is VALID [2020-07-29 01:01:08,598 INFO L280 TraceCheckUtils]: 17: Hoare triple {9506#(<= 1 main_~i~1)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {9506#(<= 1 main_~i~1)} is VALID [2020-07-29 01:01:08,598 INFO L263 TraceCheckUtils]: 18: Hoare triple {9506#(<= 1 main_~i~1)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {9372#true} is VALID [2020-07-29 01:01:08,598 INFO L280 TraceCheckUtils]: 19: Hoare triple {9372#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {9372#true} is VALID [2020-07-29 01:01:08,598 INFO L280 TraceCheckUtils]: 20: Hoare triple {9372#true} assume !!(~i~0 < ~size); {9372#true} is VALID [2020-07-29 01:01:08,598 INFO L280 TraceCheckUtils]: 21: Hoare triple {9372#true} assume 0 <= ~i~0 && ~i~0 < 32; {9372#true} is VALID [2020-07-29 01:01:08,599 INFO L280 TraceCheckUtils]: 22: Hoare triple {9372#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {9372#true} is VALID [2020-07-29 01:01:08,599 INFO L280 TraceCheckUtils]: 23: Hoare triple {9372#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {9372#true} is VALID [2020-07-29 01:01:08,599 INFO L280 TraceCheckUtils]: 24: Hoare triple {9372#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9372#true} is VALID [2020-07-29 01:01:08,599 INFO L280 TraceCheckUtils]: 25: Hoare triple {9372#true} assume !(~i~0 < ~size); {9372#true} is VALID [2020-07-29 01:01:08,599 INFO L280 TraceCheckUtils]: 26: Hoare triple {9372#true} #res := ~i~0; {9372#true} is VALID [2020-07-29 01:01:08,599 INFO L280 TraceCheckUtils]: 27: Hoare triple {9372#true} assume true; {9372#true} is VALID [2020-07-29 01:01:08,600 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {9372#true} {9506#(<= 1 main_~i~1)} #78#return; {9506#(<= 1 main_~i~1)} is VALID [2020-07-29 01:01:08,600 INFO L280 TraceCheckUtils]: 29: Hoare triple {9506#(<= 1 main_~i~1)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {9506#(<= 1 main_~i~1)} is VALID [2020-07-29 01:01:08,601 INFO L280 TraceCheckUtils]: 30: Hoare triple {9506#(<= 1 main_~i~1)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {9506#(<= 1 main_~i~1)} is VALID [2020-07-29 01:01:08,601 INFO L280 TraceCheckUtils]: 31: Hoare triple {9506#(<= 1 main_~i~1)} havoc #t~ret3; {9506#(<= 1 main_~i~1)} is VALID [2020-07-29 01:01:08,602 INFO L280 TraceCheckUtils]: 32: Hoare triple {9506#(<= 1 main_~i~1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9555#(<= 2 main_~i~1)} is VALID [2020-07-29 01:01:08,602 INFO L280 TraceCheckUtils]: 33: Hoare triple {9555#(<= 2 main_~i~1)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {9555#(<= 2 main_~i~1)} is VALID [2020-07-29 01:01:08,602 INFO L263 TraceCheckUtils]: 34: Hoare triple {9555#(<= 2 main_~i~1)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {9372#true} is VALID [2020-07-29 01:01:08,603 INFO L280 TraceCheckUtils]: 35: Hoare triple {9372#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {9372#true} is VALID [2020-07-29 01:01:08,603 INFO L280 TraceCheckUtils]: 36: Hoare triple {9372#true} assume !!(~i~0 < ~size); {9372#true} is VALID [2020-07-29 01:01:08,603 INFO L280 TraceCheckUtils]: 37: Hoare triple {9372#true} assume 0 <= ~i~0 && ~i~0 < 32; {9372#true} is VALID [2020-07-29 01:01:08,603 INFO L280 TraceCheckUtils]: 38: Hoare triple {9372#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {9372#true} is VALID [2020-07-29 01:01:08,603 INFO L280 TraceCheckUtils]: 39: Hoare triple {9372#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {9372#true} is VALID [2020-07-29 01:01:08,604 INFO L280 TraceCheckUtils]: 40: Hoare triple {9372#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9372#true} is VALID [2020-07-29 01:01:08,604 INFO L280 TraceCheckUtils]: 41: Hoare triple {9372#true} assume !!(~i~0 < ~size); {9372#true} is VALID [2020-07-29 01:01:08,604 INFO L280 TraceCheckUtils]: 42: Hoare triple {9372#true} assume 0 <= ~i~0 && ~i~0 < 32; {9372#true} is VALID [2020-07-29 01:01:08,604 INFO L280 TraceCheckUtils]: 43: Hoare triple {9372#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {9372#true} is VALID [2020-07-29 01:01:08,605 INFO L280 TraceCheckUtils]: 44: Hoare triple {9372#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {9372#true} is VALID [2020-07-29 01:01:08,605 INFO L280 TraceCheckUtils]: 45: Hoare triple {9372#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9372#true} is VALID [2020-07-29 01:01:08,605 INFO L280 TraceCheckUtils]: 46: Hoare triple {9372#true} assume !(~i~0 < ~size); {9372#true} is VALID [2020-07-29 01:01:08,605 INFO L280 TraceCheckUtils]: 47: Hoare triple {9372#true} #res := ~i~0; {9372#true} is VALID [2020-07-29 01:01:08,605 INFO L280 TraceCheckUtils]: 48: Hoare triple {9372#true} assume true; {9372#true} is VALID [2020-07-29 01:01:08,606 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {9372#true} {9555#(<= 2 main_~i~1)} #78#return; {9555#(<= 2 main_~i~1)} is VALID [2020-07-29 01:01:08,606 INFO L280 TraceCheckUtils]: 50: Hoare triple {9555#(<= 2 main_~i~1)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {9555#(<= 2 main_~i~1)} is VALID [2020-07-29 01:01:08,607 INFO L280 TraceCheckUtils]: 51: Hoare triple {9555#(<= 2 main_~i~1)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {9555#(<= 2 main_~i~1)} is VALID [2020-07-29 01:01:08,607 INFO L280 TraceCheckUtils]: 52: Hoare triple {9555#(<= 2 main_~i~1)} havoc #t~ret3; {9555#(<= 2 main_~i~1)} is VALID [2020-07-29 01:01:08,608 INFO L280 TraceCheckUtils]: 53: Hoare triple {9555#(<= 2 main_~i~1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9619#(<= 3 main_~i~1)} is VALID [2020-07-29 01:01:08,608 INFO L280 TraceCheckUtils]: 54: Hoare triple {9619#(<= 3 main_~i~1)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {9619#(<= 3 main_~i~1)} is VALID [2020-07-29 01:01:08,608 INFO L263 TraceCheckUtils]: 55: Hoare triple {9619#(<= 3 main_~i~1)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {9372#true} is VALID [2020-07-29 01:01:08,609 INFO L280 TraceCheckUtils]: 56: Hoare triple {9372#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {9372#true} is VALID [2020-07-29 01:01:08,609 INFO L280 TraceCheckUtils]: 57: Hoare triple {9372#true} assume !!(~i~0 < ~size); {9372#true} is VALID [2020-07-29 01:01:08,609 INFO L280 TraceCheckUtils]: 58: Hoare triple {9372#true} assume 0 <= ~i~0 && ~i~0 < 32; {9372#true} is VALID [2020-07-29 01:01:08,609 INFO L280 TraceCheckUtils]: 59: Hoare triple {9372#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {9372#true} is VALID [2020-07-29 01:01:08,609 INFO L280 TraceCheckUtils]: 60: Hoare triple {9372#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {9372#true} is VALID [2020-07-29 01:01:08,609 INFO L280 TraceCheckUtils]: 61: Hoare triple {9372#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9372#true} is VALID [2020-07-29 01:01:08,609 INFO L280 TraceCheckUtils]: 62: Hoare triple {9372#true} assume !!(~i~0 < ~size); {9372#true} is VALID [2020-07-29 01:01:08,610 INFO L280 TraceCheckUtils]: 63: Hoare triple {9372#true} assume 0 <= ~i~0 && ~i~0 < 32; {9372#true} is VALID [2020-07-29 01:01:08,610 INFO L280 TraceCheckUtils]: 64: Hoare triple {9372#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {9372#true} is VALID [2020-07-29 01:01:08,610 INFO L280 TraceCheckUtils]: 65: Hoare triple {9372#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {9372#true} is VALID [2020-07-29 01:01:08,610 INFO L280 TraceCheckUtils]: 66: Hoare triple {9372#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9372#true} is VALID [2020-07-29 01:01:08,610 INFO L280 TraceCheckUtils]: 67: Hoare triple {9372#true} assume !!(~i~0 < ~size); {9372#true} is VALID [2020-07-29 01:01:08,610 INFO L280 TraceCheckUtils]: 68: Hoare triple {9372#true} assume 0 <= ~i~0 && ~i~0 < 32; {9372#true} is VALID [2020-07-29 01:01:08,610 INFO L280 TraceCheckUtils]: 69: Hoare triple {9372#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {9372#true} is VALID [2020-07-29 01:01:08,610 INFO L280 TraceCheckUtils]: 70: Hoare triple {9372#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {9372#true} is VALID [2020-07-29 01:01:08,611 INFO L280 TraceCheckUtils]: 71: Hoare triple {9372#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9372#true} is VALID [2020-07-29 01:01:08,611 INFO L280 TraceCheckUtils]: 72: Hoare triple {9372#true} assume !(~i~0 < ~size); {9372#true} is VALID [2020-07-29 01:01:08,611 INFO L280 TraceCheckUtils]: 73: Hoare triple {9372#true} #res := ~i~0; {9372#true} is VALID [2020-07-29 01:01:08,611 INFO L280 TraceCheckUtils]: 74: Hoare triple {9372#true} assume true; {9372#true} is VALID [2020-07-29 01:01:08,612 INFO L275 TraceCheckUtils]: 75: Hoare quadruple {9372#true} {9619#(<= 3 main_~i~1)} #78#return; {9619#(<= 3 main_~i~1)} is VALID [2020-07-29 01:01:08,612 INFO L280 TraceCheckUtils]: 76: Hoare triple {9619#(<= 3 main_~i~1)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {9619#(<= 3 main_~i~1)} is VALID [2020-07-29 01:01:08,613 INFO L280 TraceCheckUtils]: 77: Hoare triple {9619#(<= 3 main_~i~1)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {9619#(<= 3 main_~i~1)} is VALID [2020-07-29 01:01:08,613 INFO L280 TraceCheckUtils]: 78: Hoare triple {9619#(<= 3 main_~i~1)} havoc #t~ret3; {9619#(<= 3 main_~i~1)} is VALID [2020-07-29 01:01:08,614 INFO L280 TraceCheckUtils]: 79: Hoare triple {9619#(<= 3 main_~i~1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9698#(<= 4 main_~i~1)} is VALID [2020-07-29 01:01:08,614 INFO L280 TraceCheckUtils]: 80: Hoare triple {9698#(<= 4 main_~i~1)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {9698#(<= 4 main_~i~1)} is VALID [2020-07-29 01:01:08,614 INFO L263 TraceCheckUtils]: 81: Hoare triple {9698#(<= 4 main_~i~1)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {9372#true} is VALID [2020-07-29 01:01:08,615 INFO L280 TraceCheckUtils]: 82: Hoare triple {9372#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {9708#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:01:08,615 INFO L280 TraceCheckUtils]: 83: Hoare triple {9708#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} assume !!(~i~0 < ~size); {9708#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:01:08,616 INFO L280 TraceCheckUtils]: 84: Hoare triple {9708#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} assume 0 <= ~i~0 && ~i~0 < 32; {9708#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:01:08,617 INFO L280 TraceCheckUtils]: 85: Hoare triple {9708#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {9708#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:01:08,617 INFO L280 TraceCheckUtils]: 86: Hoare triple {9708#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {9708#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:01:08,618 INFO L280 TraceCheckUtils]: 87: Hoare triple {9708#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9724#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} is VALID [2020-07-29 01:01:08,618 INFO L280 TraceCheckUtils]: 88: Hoare triple {9724#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} assume !!(~i~0 < ~size); {9724#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} is VALID [2020-07-29 01:01:08,619 INFO L280 TraceCheckUtils]: 89: Hoare triple {9724#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} assume 0 <= ~i~0 && ~i~0 < 32; {9724#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} is VALID [2020-07-29 01:01:08,619 INFO L280 TraceCheckUtils]: 90: Hoare triple {9724#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {9724#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} is VALID [2020-07-29 01:01:08,620 INFO L280 TraceCheckUtils]: 91: Hoare triple {9724#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {9724#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} is VALID [2020-07-29 01:01:08,621 INFO L280 TraceCheckUtils]: 92: Hoare triple {9724#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9740#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} is VALID [2020-07-29 01:01:08,621 INFO L280 TraceCheckUtils]: 93: Hoare triple {9740#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} assume !!(~i~0 < ~size); {9740#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} is VALID [2020-07-29 01:01:08,622 INFO L280 TraceCheckUtils]: 94: Hoare triple {9740#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} assume 0 <= ~i~0 && ~i~0 < 32; {9740#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} is VALID [2020-07-29 01:01:08,622 INFO L280 TraceCheckUtils]: 95: Hoare triple {9740#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {9740#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} is VALID [2020-07-29 01:01:08,623 INFO L280 TraceCheckUtils]: 96: Hoare triple {9740#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {9740#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} is VALID [2020-07-29 01:01:08,623 INFO L280 TraceCheckUtils]: 97: Hoare triple {9740#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9756#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 3))} is VALID [2020-07-29 01:01:08,624 INFO L280 TraceCheckUtils]: 98: Hoare triple {9756#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 3))} assume !(~i~0 < ~size); {9760#(<= |foo_#in~size| 3)} is VALID [2020-07-29 01:01:08,624 INFO L280 TraceCheckUtils]: 99: Hoare triple {9760#(<= |foo_#in~size| 3)} #res := ~i~0; {9760#(<= |foo_#in~size| 3)} is VALID [2020-07-29 01:01:08,625 INFO L280 TraceCheckUtils]: 100: Hoare triple {9760#(<= |foo_#in~size| 3)} assume true; {9760#(<= |foo_#in~size| 3)} is VALID [2020-07-29 01:01:08,626 INFO L275 TraceCheckUtils]: 101: Hoare quadruple {9760#(<= |foo_#in~size| 3)} {9698#(<= 4 main_~i~1)} #78#return; {9373#false} is VALID [2020-07-29 01:01:08,626 INFO L280 TraceCheckUtils]: 102: Hoare triple {9373#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {9373#false} is VALID [2020-07-29 01:01:08,626 INFO L280 TraceCheckUtils]: 103: Hoare triple {9373#false} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {9373#false} is VALID [2020-07-29 01:01:08,626 INFO L280 TraceCheckUtils]: 104: Hoare triple {9373#false} havoc #t~ret3; {9373#false} is VALID [2020-07-29 01:01:08,626 INFO L280 TraceCheckUtils]: 105: Hoare triple {9373#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9373#false} is VALID [2020-07-29 01:01:08,626 INFO L280 TraceCheckUtils]: 106: Hoare triple {9373#false} assume !(~i~1 < 32); {9373#false} is VALID [2020-07-29 01:01:08,627 INFO L280 TraceCheckUtils]: 107: Hoare triple {9373#false} ~i~1 := 0; {9373#false} is VALID [2020-07-29 01:01:08,627 INFO L280 TraceCheckUtils]: 108: Hoare triple {9373#false} assume !!(~i~1 < 32); {9373#false} is VALID [2020-07-29 01:01:08,627 INFO L280 TraceCheckUtils]: 109: Hoare triple {9373#false} SUMMARY for call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L30 {9373#false} is VALID [2020-07-29 01:01:08,627 INFO L280 TraceCheckUtils]: 110: Hoare triple {9373#false} assume !(#t~mem5 != ~i~1);havoc #t~mem5; {9373#false} is VALID [2020-07-29 01:01:08,627 INFO L280 TraceCheckUtils]: 111: Hoare triple {9373#false} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9373#false} is VALID [2020-07-29 01:01:08,627 INFO L280 TraceCheckUtils]: 112: Hoare triple {9373#false} assume !!(~i~1 < 32); {9373#false} is VALID [2020-07-29 01:01:08,627 INFO L280 TraceCheckUtils]: 113: Hoare triple {9373#false} SUMMARY for call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L30 {9373#false} is VALID [2020-07-29 01:01:08,628 INFO L280 TraceCheckUtils]: 114: Hoare triple {9373#false} assume !(#t~mem5 != ~i~1);havoc #t~mem5; {9373#false} is VALID [2020-07-29 01:01:08,628 INFO L280 TraceCheckUtils]: 115: Hoare triple {9373#false} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9373#false} is VALID [2020-07-29 01:01:08,628 INFO L280 TraceCheckUtils]: 116: Hoare triple {9373#false} assume !!(~i~1 < 32); {9373#false} is VALID [2020-07-29 01:01:08,628 INFO L280 TraceCheckUtils]: 117: Hoare triple {9373#false} SUMMARY for call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L30 {9373#false} is VALID [2020-07-29 01:01:08,628 INFO L280 TraceCheckUtils]: 118: Hoare triple {9373#false} assume !(#t~mem5 != ~i~1);havoc #t~mem5; {9373#false} is VALID [2020-07-29 01:01:08,628 INFO L280 TraceCheckUtils]: 119: Hoare triple {9373#false} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9373#false} is VALID [2020-07-29 01:01:08,628 INFO L280 TraceCheckUtils]: 120: Hoare triple {9373#false} assume !!(~i~1 < 32); {9373#false} is VALID [2020-07-29 01:01:08,629 INFO L280 TraceCheckUtils]: 121: Hoare triple {9373#false} SUMMARY for call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L30 {9373#false} is VALID [2020-07-29 01:01:08,629 INFO L280 TraceCheckUtils]: 122: Hoare triple {9373#false} assume !(#t~mem5 != ~i~1);havoc #t~mem5; {9373#false} is VALID [2020-07-29 01:01:08,629 INFO L280 TraceCheckUtils]: 123: Hoare triple {9373#false} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9373#false} is VALID [2020-07-29 01:01:08,629 INFO L280 TraceCheckUtils]: 124: Hoare triple {9373#false} assume !!(~i~1 < 32); {9373#false} is VALID [2020-07-29 01:01:08,629 INFO L280 TraceCheckUtils]: 125: Hoare triple {9373#false} assume !(4 + (~#b~0.offset + 4 * ~i~1) <= #length[~#b~0.base] && 0 <= ~#b~0.offset + 4 * ~i~1); {9373#false} is VALID [2020-07-29 01:01:08,638 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 189 proven. 18 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2020-07-29 01:01:08,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:01:08,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 19 [2020-07-29 01:01:08,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303313972] [2020-07-29 01:01:08,640 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 126 [2020-07-29 01:01:08,640 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:01:08,641 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2020-07-29 01:01:08,783 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:01:08,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-29 01:01:08,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:01:08,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-29 01:01:08,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2020-07-29 01:01:08,785 INFO L87 Difference]: Start difference. First operand 107 states and 110 transitions. Second operand 19 states. [2020-07-29 01:01:10,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:01:10,860 INFO L93 Difference]: Finished difference Result 171 states and 178 transitions. [2020-07-29 01:01:10,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-29 01:01:10,860 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 126 [2020-07-29 01:01:10,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:01:10,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-29 01:01:10,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 164 transitions. [2020-07-29 01:01:10,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-29 01:01:10,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 164 transitions. [2020-07-29 01:01:10,869 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 164 transitions. [2020-07-29 01:01:11,134 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:01:11,146 INFO L225 Difference]: With dead ends: 171 [2020-07-29 01:01:11,146 INFO L226 Difference]: Without dead ends: 171 [2020-07-29 01:01:11,147 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=866, Unknown=0, NotChecked=0, Total=1056 [2020-07-29 01:01:11,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-07-29 01:01:11,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 138. [2020-07-29 01:01:11,155 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:01:11,155 INFO L82 GeneralOperation]: Start isEquivalent. First operand 171 states. Second operand 138 states. [2020-07-29 01:01:11,155 INFO L74 IsIncluded]: Start isIncluded. First operand 171 states. Second operand 138 states. [2020-07-29 01:01:11,155 INFO L87 Difference]: Start difference. First operand 171 states. Second operand 138 states. [2020-07-29 01:01:11,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:01:11,166 INFO L93 Difference]: Finished difference Result 171 states and 178 transitions. [2020-07-29 01:01:11,166 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 178 transitions. [2020-07-29 01:01:11,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:01:11,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:01:11,167 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 171 states. [2020-07-29 01:01:11,167 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 171 states. [2020-07-29 01:01:11,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:01:11,174 INFO L93 Difference]: Finished difference Result 171 states and 178 transitions. [2020-07-29 01:01:11,174 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 178 transitions. [2020-07-29 01:01:11,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:01:11,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:01:11,175 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:01:11,175 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:01:11,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-07-29 01:01:11,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 143 transitions. [2020-07-29 01:01:11,180 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 143 transitions. Word has length 126 [2020-07-29 01:01:11,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:01:11,181 INFO L479 AbstractCegarLoop]: Abstraction has 138 states and 143 transitions. [2020-07-29 01:01:11,181 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-29 01:01:11,181 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 143 transitions. [2020-07-29 01:01:11,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2020-07-29 01:01:11,183 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:01:11,184 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:01:11,398 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:01:11,399 INFO L427 AbstractCegarLoop]: === Iteration 22 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:01:11,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:01:11,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1289574162, now seen corresponding path program 2 times [2020-07-29 01:01:11,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:01:11,400 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569791195] [2020-07-29 01:01:11,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:01:11,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:11,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:01:11,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:11,569 INFO L280 TraceCheckUtils]: 0: Hoare triple {10632#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {10520#true} is VALID [2020-07-29 01:01:11,569 INFO L280 TraceCheckUtils]: 1: Hoare triple {10520#true} assume true; {10520#true} is VALID [2020-07-29 01:01:11,570 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {10520#true} {10520#true} #74#return; {10520#true} is VALID [2020-07-29 01:01:11,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-07-29 01:01:11,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:11,574 INFO L280 TraceCheckUtils]: 0: Hoare triple {10520#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {10520#true} is VALID [2020-07-29 01:01:11,575 INFO L280 TraceCheckUtils]: 1: Hoare triple {10520#true} assume !(~i~0 < ~size); {10520#true} is VALID [2020-07-29 01:01:11,575 INFO L280 TraceCheckUtils]: 2: Hoare triple {10520#true} #res := ~i~0; {10520#true} is VALID [2020-07-29 01:01:11,575 INFO L280 TraceCheckUtils]: 3: Hoare triple {10520#true} assume true; {10520#true} is VALID [2020-07-29 01:01:11,576 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {10520#true} {10525#(= 0 main_~i~1)} #78#return; {10525#(= 0 main_~i~1)} is VALID [2020-07-29 01:01:11,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-07-29 01:01:11,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:11,582 INFO L280 TraceCheckUtils]: 0: Hoare triple {10520#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {10520#true} is VALID [2020-07-29 01:01:11,583 INFO L280 TraceCheckUtils]: 1: Hoare triple {10520#true} assume !!(~i~0 < ~size); {10520#true} is VALID [2020-07-29 01:01:11,583 INFO L280 TraceCheckUtils]: 2: Hoare triple {10520#true} assume 0 <= ~i~0 && ~i~0 < 32; {10520#true} is VALID [2020-07-29 01:01:11,583 INFO L280 TraceCheckUtils]: 3: Hoare triple {10520#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {10520#true} is VALID [2020-07-29 01:01:11,583 INFO L280 TraceCheckUtils]: 4: Hoare triple {10520#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {10520#true} is VALID [2020-07-29 01:01:11,583 INFO L280 TraceCheckUtils]: 5: Hoare triple {10520#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10520#true} is VALID [2020-07-29 01:01:11,584 INFO L280 TraceCheckUtils]: 6: Hoare triple {10520#true} assume !(~i~0 < ~size); {10520#true} is VALID [2020-07-29 01:01:11,584 INFO L280 TraceCheckUtils]: 7: Hoare triple {10520#true} #res := ~i~0; {10520#true} is VALID [2020-07-29 01:01:11,584 INFO L280 TraceCheckUtils]: 8: Hoare triple {10520#true} assume true; {10520#true} is VALID [2020-07-29 01:01:11,585 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {10520#true} {10531#(<= main_~i~1 1)} #78#return; {10531#(<= main_~i~1 1)} is VALID [2020-07-29 01:01:11,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-07-29 01:01:11,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:11,592 INFO L280 TraceCheckUtils]: 0: Hoare triple {10520#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {10520#true} is VALID [2020-07-29 01:01:11,592 INFO L280 TraceCheckUtils]: 1: Hoare triple {10520#true} assume !!(~i~0 < ~size); {10520#true} is VALID [2020-07-29 01:01:11,593 INFO L280 TraceCheckUtils]: 2: Hoare triple {10520#true} assume 0 <= ~i~0 && ~i~0 < 32; {10520#true} is VALID [2020-07-29 01:01:11,593 INFO L280 TraceCheckUtils]: 3: Hoare triple {10520#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {10520#true} is VALID [2020-07-29 01:01:11,593 INFO L280 TraceCheckUtils]: 4: Hoare triple {10520#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {10520#true} is VALID [2020-07-29 01:01:11,593 INFO L280 TraceCheckUtils]: 5: Hoare triple {10520#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10520#true} is VALID [2020-07-29 01:01:11,593 INFO L280 TraceCheckUtils]: 6: Hoare triple {10520#true} assume !!(~i~0 < ~size); {10520#true} is VALID [2020-07-29 01:01:11,594 INFO L280 TraceCheckUtils]: 7: Hoare triple {10520#true} assume 0 <= ~i~0 && ~i~0 < 32; {10520#true} is VALID [2020-07-29 01:01:11,594 INFO L280 TraceCheckUtils]: 8: Hoare triple {10520#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {10520#true} is VALID [2020-07-29 01:01:11,594 INFO L280 TraceCheckUtils]: 9: Hoare triple {10520#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {10520#true} is VALID [2020-07-29 01:01:11,594 INFO L280 TraceCheckUtils]: 10: Hoare triple {10520#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10520#true} is VALID [2020-07-29 01:01:11,594 INFO L280 TraceCheckUtils]: 11: Hoare triple {10520#true} assume !(~i~0 < ~size); {10520#true} is VALID [2020-07-29 01:01:11,594 INFO L280 TraceCheckUtils]: 12: Hoare triple {10520#true} #res := ~i~0; {10520#true} is VALID [2020-07-29 01:01:11,595 INFO L280 TraceCheckUtils]: 13: Hoare triple {10520#true} assume true; {10520#true} is VALID [2020-07-29 01:01:11,596 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {10520#true} {10542#(<= main_~i~1 2)} #78#return; {10542#(<= main_~i~1 2)} is VALID [2020-07-29 01:01:11,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-07-29 01:01:11,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:11,605 INFO L280 TraceCheckUtils]: 0: Hoare triple {10520#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {10520#true} is VALID [2020-07-29 01:01:11,606 INFO L280 TraceCheckUtils]: 1: Hoare triple {10520#true} assume !!(~i~0 < ~size); {10520#true} is VALID [2020-07-29 01:01:11,606 INFO L280 TraceCheckUtils]: 2: Hoare triple {10520#true} assume 0 <= ~i~0 && ~i~0 < 32; {10520#true} is VALID [2020-07-29 01:01:11,606 INFO L280 TraceCheckUtils]: 3: Hoare triple {10520#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {10520#true} is VALID [2020-07-29 01:01:11,606 INFO L280 TraceCheckUtils]: 4: Hoare triple {10520#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {10520#true} is VALID [2020-07-29 01:01:11,606 INFO L280 TraceCheckUtils]: 5: Hoare triple {10520#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10520#true} is VALID [2020-07-29 01:01:11,606 INFO L280 TraceCheckUtils]: 6: Hoare triple {10520#true} assume !!(~i~0 < ~size); {10520#true} is VALID [2020-07-29 01:01:11,607 INFO L280 TraceCheckUtils]: 7: Hoare triple {10520#true} assume 0 <= ~i~0 && ~i~0 < 32; {10520#true} is VALID [2020-07-29 01:01:11,607 INFO L280 TraceCheckUtils]: 8: Hoare triple {10520#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {10520#true} is VALID [2020-07-29 01:01:11,607 INFO L280 TraceCheckUtils]: 9: Hoare triple {10520#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {10520#true} is VALID [2020-07-29 01:01:11,607 INFO L280 TraceCheckUtils]: 10: Hoare triple {10520#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10520#true} is VALID [2020-07-29 01:01:11,607 INFO L280 TraceCheckUtils]: 11: Hoare triple {10520#true} assume !!(~i~0 < ~size); {10520#true} is VALID [2020-07-29 01:01:11,608 INFO L280 TraceCheckUtils]: 12: Hoare triple {10520#true} assume 0 <= ~i~0 && ~i~0 < 32; {10520#true} is VALID [2020-07-29 01:01:11,608 INFO L280 TraceCheckUtils]: 13: Hoare triple {10520#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {10520#true} is VALID [2020-07-29 01:01:11,608 INFO L280 TraceCheckUtils]: 14: Hoare triple {10520#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {10520#true} is VALID [2020-07-29 01:01:11,608 INFO L280 TraceCheckUtils]: 15: Hoare triple {10520#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10520#true} is VALID [2020-07-29 01:01:11,608 INFO L280 TraceCheckUtils]: 16: Hoare triple {10520#true} assume !(~i~0 < ~size); {10520#true} is VALID [2020-07-29 01:01:11,608 INFO L280 TraceCheckUtils]: 17: Hoare triple {10520#true} #res := ~i~0; {10520#true} is VALID [2020-07-29 01:01:11,609 INFO L280 TraceCheckUtils]: 18: Hoare triple {10520#true} assume true; {10520#true} is VALID [2020-07-29 01:01:11,610 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {10520#true} {10558#(<= main_~i~1 3)} #78#return; {10558#(<= main_~i~1 3)} is VALID [2020-07-29 01:01:11,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-07-29 01:01:11,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:11,622 INFO L280 TraceCheckUtils]: 0: Hoare triple {10520#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {10520#true} is VALID [2020-07-29 01:01:11,623 INFO L280 TraceCheckUtils]: 1: Hoare triple {10520#true} assume !!(~i~0 < ~size); {10520#true} is VALID [2020-07-29 01:01:11,623 INFO L280 TraceCheckUtils]: 2: Hoare triple {10520#true} assume 0 <= ~i~0 && ~i~0 < 32; {10520#true} is VALID [2020-07-29 01:01:11,623 INFO L280 TraceCheckUtils]: 3: Hoare triple {10520#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {10520#true} is VALID [2020-07-29 01:01:11,623 INFO L280 TraceCheckUtils]: 4: Hoare triple {10520#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {10520#true} is VALID [2020-07-29 01:01:11,623 INFO L280 TraceCheckUtils]: 5: Hoare triple {10520#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10520#true} is VALID [2020-07-29 01:01:11,624 INFO L280 TraceCheckUtils]: 6: Hoare triple {10520#true} assume !!(~i~0 < ~size); {10520#true} is VALID [2020-07-29 01:01:11,624 INFO L280 TraceCheckUtils]: 7: Hoare triple {10520#true} assume 0 <= ~i~0 && ~i~0 < 32; {10520#true} is VALID [2020-07-29 01:01:11,624 INFO L280 TraceCheckUtils]: 8: Hoare triple {10520#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {10520#true} is VALID [2020-07-29 01:01:11,624 INFO L280 TraceCheckUtils]: 9: Hoare triple {10520#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {10520#true} is VALID [2020-07-29 01:01:11,624 INFO L280 TraceCheckUtils]: 10: Hoare triple {10520#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10520#true} is VALID [2020-07-29 01:01:11,625 INFO L280 TraceCheckUtils]: 11: Hoare triple {10520#true} assume !!(~i~0 < ~size); {10520#true} is VALID [2020-07-29 01:01:11,625 INFO L280 TraceCheckUtils]: 12: Hoare triple {10520#true} assume 0 <= ~i~0 && ~i~0 < 32; {10520#true} is VALID [2020-07-29 01:01:11,625 INFO L280 TraceCheckUtils]: 13: Hoare triple {10520#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {10520#true} is VALID [2020-07-29 01:01:11,625 INFO L280 TraceCheckUtils]: 14: Hoare triple {10520#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {10520#true} is VALID [2020-07-29 01:01:11,625 INFO L280 TraceCheckUtils]: 15: Hoare triple {10520#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10520#true} is VALID [2020-07-29 01:01:11,626 INFO L280 TraceCheckUtils]: 16: Hoare triple {10520#true} assume !!(~i~0 < ~size); {10520#true} is VALID [2020-07-29 01:01:11,626 INFO L280 TraceCheckUtils]: 17: Hoare triple {10520#true} assume 0 <= ~i~0 && ~i~0 < 32; {10520#true} is VALID [2020-07-29 01:01:11,626 INFO L280 TraceCheckUtils]: 18: Hoare triple {10520#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {10520#true} is VALID [2020-07-29 01:01:11,626 INFO L280 TraceCheckUtils]: 19: Hoare triple {10520#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {10520#true} is VALID [2020-07-29 01:01:11,626 INFO L280 TraceCheckUtils]: 20: Hoare triple {10520#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10520#true} is VALID [2020-07-29 01:01:11,627 INFO L280 TraceCheckUtils]: 21: Hoare triple {10520#true} assume !(~i~0 < ~size); {10520#true} is VALID [2020-07-29 01:01:11,627 INFO L280 TraceCheckUtils]: 22: Hoare triple {10520#true} #res := ~i~0; {10520#true} is VALID [2020-07-29 01:01:11,627 INFO L280 TraceCheckUtils]: 23: Hoare triple {10520#true} assume true; {10520#true} is VALID [2020-07-29 01:01:11,629 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {10520#true} {10579#(<= main_~i~1 4)} #78#return; {10579#(<= main_~i~1 4)} is VALID [2020-07-29 01:01:11,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2020-07-29 01:01:11,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:11,640 INFO L280 TraceCheckUtils]: 0: Hoare triple {10520#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {10520#true} is VALID [2020-07-29 01:01:11,641 INFO L280 TraceCheckUtils]: 1: Hoare triple {10520#true} assume !!(~i~0 < ~size); {10520#true} is VALID [2020-07-29 01:01:11,641 INFO L280 TraceCheckUtils]: 2: Hoare triple {10520#true} assume 0 <= ~i~0 && ~i~0 < 32; {10520#true} is VALID [2020-07-29 01:01:11,641 INFO L280 TraceCheckUtils]: 3: Hoare triple {10520#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {10520#true} is VALID [2020-07-29 01:01:11,641 INFO L280 TraceCheckUtils]: 4: Hoare triple {10520#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {10520#true} is VALID [2020-07-29 01:01:11,641 INFO L280 TraceCheckUtils]: 5: Hoare triple {10520#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10520#true} is VALID [2020-07-29 01:01:11,641 INFO L280 TraceCheckUtils]: 6: Hoare triple {10520#true} assume !!(~i~0 < ~size); {10520#true} is VALID [2020-07-29 01:01:11,642 INFO L280 TraceCheckUtils]: 7: Hoare triple {10520#true} assume 0 <= ~i~0 && ~i~0 < 32; {10520#true} is VALID [2020-07-29 01:01:11,642 INFO L280 TraceCheckUtils]: 8: Hoare triple {10520#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {10520#true} is VALID [2020-07-29 01:01:11,642 INFO L280 TraceCheckUtils]: 9: Hoare triple {10520#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {10520#true} is VALID [2020-07-29 01:01:11,642 INFO L280 TraceCheckUtils]: 10: Hoare triple {10520#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10520#true} is VALID [2020-07-29 01:01:11,642 INFO L280 TraceCheckUtils]: 11: Hoare triple {10520#true} assume !!(~i~0 < ~size); {10520#true} is VALID [2020-07-29 01:01:11,643 INFO L280 TraceCheckUtils]: 12: Hoare triple {10520#true} assume 0 <= ~i~0 && ~i~0 < 32; {10520#true} is VALID [2020-07-29 01:01:11,643 INFO L280 TraceCheckUtils]: 13: Hoare triple {10520#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {10520#true} is VALID [2020-07-29 01:01:11,643 INFO L280 TraceCheckUtils]: 14: Hoare triple {10520#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {10520#true} is VALID [2020-07-29 01:01:11,643 INFO L280 TraceCheckUtils]: 15: Hoare triple {10520#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10520#true} is VALID [2020-07-29 01:01:11,643 INFO L280 TraceCheckUtils]: 16: Hoare triple {10520#true} assume !!(~i~0 < ~size); {10520#true} is VALID [2020-07-29 01:01:11,643 INFO L280 TraceCheckUtils]: 17: Hoare triple {10520#true} assume 0 <= ~i~0 && ~i~0 < 32; {10520#true} is VALID [2020-07-29 01:01:11,644 INFO L280 TraceCheckUtils]: 18: Hoare triple {10520#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {10520#true} is VALID [2020-07-29 01:01:11,644 INFO L280 TraceCheckUtils]: 19: Hoare triple {10520#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {10520#true} is VALID [2020-07-29 01:01:11,644 INFO L280 TraceCheckUtils]: 20: Hoare triple {10520#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10520#true} is VALID [2020-07-29 01:01:11,644 INFO L280 TraceCheckUtils]: 21: Hoare triple {10520#true} assume !(~i~0 < ~size); {10520#true} is VALID [2020-07-29 01:01:11,644 INFO L280 TraceCheckUtils]: 22: Hoare triple {10520#true} #res := ~i~0; {10520#true} is VALID [2020-07-29 01:01:11,644 INFO L280 TraceCheckUtils]: 23: Hoare triple {10520#true} assume true; {10520#true} is VALID [2020-07-29 01:01:11,646 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {10520#true} {10605#(<= main_~i~1 5)} #78#return; {10605#(<= main_~i~1 5)} is VALID [2020-07-29 01:01:11,647 INFO L263 TraceCheckUtils]: 0: Hoare triple {10520#true} call ULTIMATE.init(); {10632#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:01:11,647 INFO L280 TraceCheckUtils]: 1: Hoare triple {10632#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {10520#true} is VALID [2020-07-29 01:01:11,647 INFO L280 TraceCheckUtils]: 2: Hoare triple {10520#true} assume true; {10520#true} is VALID [2020-07-29 01:01:11,647 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {10520#true} {10520#true} #74#return; {10520#true} is VALID [2020-07-29 01:01:11,648 INFO L263 TraceCheckUtils]: 4: Hoare triple {10520#true} call #t~ret6 := main(); {10520#true} is VALID [2020-07-29 01:01:11,648 INFO L280 TraceCheckUtils]: 5: Hoare triple {10520#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(128);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {10525#(= 0 main_~i~1)} is VALID [2020-07-29 01:01:11,649 INFO L280 TraceCheckUtils]: 6: Hoare triple {10525#(= 0 main_~i~1)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {10525#(= 0 main_~i~1)} is VALID [2020-07-29 01:01:11,649 INFO L263 TraceCheckUtils]: 7: Hoare triple {10525#(= 0 main_~i~1)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {10520#true} is VALID [2020-07-29 01:01:11,649 INFO L280 TraceCheckUtils]: 8: Hoare triple {10520#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {10520#true} is VALID [2020-07-29 01:01:11,649 INFO L280 TraceCheckUtils]: 9: Hoare triple {10520#true} assume !(~i~0 < ~size); {10520#true} is VALID [2020-07-29 01:01:11,650 INFO L280 TraceCheckUtils]: 10: Hoare triple {10520#true} #res := ~i~0; {10520#true} is VALID [2020-07-29 01:01:11,650 INFO L280 TraceCheckUtils]: 11: Hoare triple {10520#true} assume true; {10520#true} is VALID [2020-07-29 01:01:11,651 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {10520#true} {10525#(= 0 main_~i~1)} #78#return; {10525#(= 0 main_~i~1)} is VALID [2020-07-29 01:01:11,651 INFO L280 TraceCheckUtils]: 13: Hoare triple {10525#(= 0 main_~i~1)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {10525#(= 0 main_~i~1)} is VALID [2020-07-29 01:01:11,652 INFO L280 TraceCheckUtils]: 14: Hoare triple {10525#(= 0 main_~i~1)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {10525#(= 0 main_~i~1)} is VALID [2020-07-29 01:01:11,652 INFO L280 TraceCheckUtils]: 15: Hoare triple {10525#(= 0 main_~i~1)} havoc #t~ret3; {10525#(= 0 main_~i~1)} is VALID [2020-07-29 01:01:11,653 INFO L280 TraceCheckUtils]: 16: Hoare triple {10525#(= 0 main_~i~1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10531#(<= main_~i~1 1)} is VALID [2020-07-29 01:01:11,653 INFO L280 TraceCheckUtils]: 17: Hoare triple {10531#(<= main_~i~1 1)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {10531#(<= main_~i~1 1)} is VALID [2020-07-29 01:01:11,653 INFO L263 TraceCheckUtils]: 18: Hoare triple {10531#(<= main_~i~1 1)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {10520#true} is VALID [2020-07-29 01:01:11,654 INFO L280 TraceCheckUtils]: 19: Hoare triple {10520#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {10520#true} is VALID [2020-07-29 01:01:11,654 INFO L280 TraceCheckUtils]: 20: Hoare triple {10520#true} assume !!(~i~0 < ~size); {10520#true} is VALID [2020-07-29 01:01:11,654 INFO L280 TraceCheckUtils]: 21: Hoare triple {10520#true} assume 0 <= ~i~0 && ~i~0 < 32; {10520#true} is VALID [2020-07-29 01:01:11,654 INFO L280 TraceCheckUtils]: 22: Hoare triple {10520#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {10520#true} is VALID [2020-07-29 01:01:11,654 INFO L280 TraceCheckUtils]: 23: Hoare triple {10520#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {10520#true} is VALID [2020-07-29 01:01:11,654 INFO L280 TraceCheckUtils]: 24: Hoare triple {10520#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10520#true} is VALID [2020-07-29 01:01:11,655 INFO L280 TraceCheckUtils]: 25: Hoare triple {10520#true} assume !(~i~0 < ~size); {10520#true} is VALID [2020-07-29 01:01:11,655 INFO L280 TraceCheckUtils]: 26: Hoare triple {10520#true} #res := ~i~0; {10520#true} is VALID [2020-07-29 01:01:11,655 INFO L280 TraceCheckUtils]: 27: Hoare triple {10520#true} assume true; {10520#true} is VALID [2020-07-29 01:01:11,656 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {10520#true} {10531#(<= main_~i~1 1)} #78#return; {10531#(<= main_~i~1 1)} is VALID [2020-07-29 01:01:11,656 INFO L280 TraceCheckUtils]: 29: Hoare triple {10531#(<= main_~i~1 1)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {10531#(<= main_~i~1 1)} is VALID [2020-07-29 01:01:11,657 INFO L280 TraceCheckUtils]: 30: Hoare triple {10531#(<= main_~i~1 1)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {10531#(<= main_~i~1 1)} is VALID [2020-07-29 01:01:11,657 INFO L280 TraceCheckUtils]: 31: Hoare triple {10531#(<= main_~i~1 1)} havoc #t~ret3; {10531#(<= main_~i~1 1)} is VALID [2020-07-29 01:01:11,658 INFO L280 TraceCheckUtils]: 32: Hoare triple {10531#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10542#(<= main_~i~1 2)} is VALID [2020-07-29 01:01:11,659 INFO L280 TraceCheckUtils]: 33: Hoare triple {10542#(<= main_~i~1 2)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {10542#(<= main_~i~1 2)} is VALID [2020-07-29 01:01:11,659 INFO L263 TraceCheckUtils]: 34: Hoare triple {10542#(<= main_~i~1 2)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {10520#true} is VALID [2020-07-29 01:01:11,659 INFO L280 TraceCheckUtils]: 35: Hoare triple {10520#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {10520#true} is VALID [2020-07-29 01:01:11,659 INFO L280 TraceCheckUtils]: 36: Hoare triple {10520#true} assume !!(~i~0 < ~size); {10520#true} is VALID [2020-07-29 01:01:11,659 INFO L280 TraceCheckUtils]: 37: Hoare triple {10520#true} assume 0 <= ~i~0 && ~i~0 < 32; {10520#true} is VALID [2020-07-29 01:01:11,659 INFO L280 TraceCheckUtils]: 38: Hoare triple {10520#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {10520#true} is VALID [2020-07-29 01:01:11,660 INFO L280 TraceCheckUtils]: 39: Hoare triple {10520#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {10520#true} is VALID [2020-07-29 01:01:11,660 INFO L280 TraceCheckUtils]: 40: Hoare triple {10520#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10520#true} is VALID [2020-07-29 01:01:11,660 INFO L280 TraceCheckUtils]: 41: Hoare triple {10520#true} assume !!(~i~0 < ~size); {10520#true} is VALID [2020-07-29 01:01:11,660 INFO L280 TraceCheckUtils]: 42: Hoare triple {10520#true} assume 0 <= ~i~0 && ~i~0 < 32; {10520#true} is VALID [2020-07-29 01:01:11,660 INFO L280 TraceCheckUtils]: 43: Hoare triple {10520#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {10520#true} is VALID [2020-07-29 01:01:11,660 INFO L280 TraceCheckUtils]: 44: Hoare triple {10520#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {10520#true} is VALID [2020-07-29 01:01:11,661 INFO L280 TraceCheckUtils]: 45: Hoare triple {10520#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10520#true} is VALID [2020-07-29 01:01:11,661 INFO L280 TraceCheckUtils]: 46: Hoare triple {10520#true} assume !(~i~0 < ~size); {10520#true} is VALID [2020-07-29 01:01:11,661 INFO L280 TraceCheckUtils]: 47: Hoare triple {10520#true} #res := ~i~0; {10520#true} is VALID [2020-07-29 01:01:11,661 INFO L280 TraceCheckUtils]: 48: Hoare triple {10520#true} assume true; {10520#true} is VALID [2020-07-29 01:01:11,662 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {10520#true} {10542#(<= main_~i~1 2)} #78#return; {10542#(<= main_~i~1 2)} is VALID [2020-07-29 01:01:11,663 INFO L280 TraceCheckUtils]: 50: Hoare triple {10542#(<= main_~i~1 2)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {10542#(<= main_~i~1 2)} is VALID [2020-07-29 01:01:11,663 INFO L280 TraceCheckUtils]: 51: Hoare triple {10542#(<= main_~i~1 2)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {10542#(<= main_~i~1 2)} is VALID [2020-07-29 01:01:11,664 INFO L280 TraceCheckUtils]: 52: Hoare triple {10542#(<= main_~i~1 2)} havoc #t~ret3; {10542#(<= main_~i~1 2)} is VALID [2020-07-29 01:01:11,664 INFO L280 TraceCheckUtils]: 53: Hoare triple {10542#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10558#(<= main_~i~1 3)} is VALID [2020-07-29 01:01:11,665 INFO L280 TraceCheckUtils]: 54: Hoare triple {10558#(<= main_~i~1 3)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {10558#(<= main_~i~1 3)} is VALID [2020-07-29 01:01:11,665 INFO L263 TraceCheckUtils]: 55: Hoare triple {10558#(<= main_~i~1 3)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {10520#true} is VALID [2020-07-29 01:01:11,666 INFO L280 TraceCheckUtils]: 56: Hoare triple {10520#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {10520#true} is VALID [2020-07-29 01:01:11,666 INFO L280 TraceCheckUtils]: 57: Hoare triple {10520#true} assume !!(~i~0 < ~size); {10520#true} is VALID [2020-07-29 01:01:11,666 INFO L280 TraceCheckUtils]: 58: Hoare triple {10520#true} assume 0 <= ~i~0 && ~i~0 < 32; {10520#true} is VALID [2020-07-29 01:01:11,666 INFO L280 TraceCheckUtils]: 59: Hoare triple {10520#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {10520#true} is VALID [2020-07-29 01:01:11,666 INFO L280 TraceCheckUtils]: 60: Hoare triple {10520#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {10520#true} is VALID [2020-07-29 01:01:11,666 INFO L280 TraceCheckUtils]: 61: Hoare triple {10520#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10520#true} is VALID [2020-07-29 01:01:11,667 INFO L280 TraceCheckUtils]: 62: Hoare triple {10520#true} assume !!(~i~0 < ~size); {10520#true} is VALID [2020-07-29 01:01:11,667 INFO L280 TraceCheckUtils]: 63: Hoare triple {10520#true} assume 0 <= ~i~0 && ~i~0 < 32; {10520#true} is VALID [2020-07-29 01:01:11,667 INFO L280 TraceCheckUtils]: 64: Hoare triple {10520#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {10520#true} is VALID [2020-07-29 01:01:11,667 INFO L280 TraceCheckUtils]: 65: Hoare triple {10520#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {10520#true} is VALID [2020-07-29 01:01:11,667 INFO L280 TraceCheckUtils]: 66: Hoare triple {10520#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10520#true} is VALID [2020-07-29 01:01:11,667 INFO L280 TraceCheckUtils]: 67: Hoare triple {10520#true} assume !!(~i~0 < ~size); {10520#true} is VALID [2020-07-29 01:01:11,668 INFO L280 TraceCheckUtils]: 68: Hoare triple {10520#true} assume 0 <= ~i~0 && ~i~0 < 32; {10520#true} is VALID [2020-07-29 01:01:11,668 INFO L280 TraceCheckUtils]: 69: Hoare triple {10520#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {10520#true} is VALID [2020-07-29 01:01:11,668 INFO L280 TraceCheckUtils]: 70: Hoare triple {10520#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {10520#true} is VALID [2020-07-29 01:01:11,668 INFO L280 TraceCheckUtils]: 71: Hoare triple {10520#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10520#true} is VALID [2020-07-29 01:01:11,668 INFO L280 TraceCheckUtils]: 72: Hoare triple {10520#true} assume !(~i~0 < ~size); {10520#true} is VALID [2020-07-29 01:01:11,669 INFO L280 TraceCheckUtils]: 73: Hoare triple {10520#true} #res := ~i~0; {10520#true} is VALID [2020-07-29 01:01:11,669 INFO L280 TraceCheckUtils]: 74: Hoare triple {10520#true} assume true; {10520#true} is VALID [2020-07-29 01:01:11,670 INFO L275 TraceCheckUtils]: 75: Hoare quadruple {10520#true} {10558#(<= main_~i~1 3)} #78#return; {10558#(<= main_~i~1 3)} is VALID [2020-07-29 01:01:11,670 INFO L280 TraceCheckUtils]: 76: Hoare triple {10558#(<= main_~i~1 3)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {10558#(<= main_~i~1 3)} is VALID [2020-07-29 01:01:11,671 INFO L280 TraceCheckUtils]: 77: Hoare triple {10558#(<= main_~i~1 3)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {10558#(<= main_~i~1 3)} is VALID [2020-07-29 01:01:11,671 INFO L280 TraceCheckUtils]: 78: Hoare triple {10558#(<= main_~i~1 3)} havoc #t~ret3; {10558#(<= main_~i~1 3)} is VALID [2020-07-29 01:01:11,672 INFO L280 TraceCheckUtils]: 79: Hoare triple {10558#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10579#(<= main_~i~1 4)} is VALID [2020-07-29 01:01:11,673 INFO L280 TraceCheckUtils]: 80: Hoare triple {10579#(<= main_~i~1 4)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {10579#(<= main_~i~1 4)} is VALID [2020-07-29 01:01:11,673 INFO L263 TraceCheckUtils]: 81: Hoare triple {10579#(<= main_~i~1 4)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {10520#true} is VALID [2020-07-29 01:01:11,673 INFO L280 TraceCheckUtils]: 82: Hoare triple {10520#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {10520#true} is VALID [2020-07-29 01:01:11,673 INFO L280 TraceCheckUtils]: 83: Hoare triple {10520#true} assume !!(~i~0 < ~size); {10520#true} is VALID [2020-07-29 01:01:11,673 INFO L280 TraceCheckUtils]: 84: Hoare triple {10520#true} assume 0 <= ~i~0 && ~i~0 < 32; {10520#true} is VALID [2020-07-29 01:01:11,673 INFO L280 TraceCheckUtils]: 85: Hoare triple {10520#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {10520#true} is VALID [2020-07-29 01:01:11,673 INFO L280 TraceCheckUtils]: 86: Hoare triple {10520#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {10520#true} is VALID [2020-07-29 01:01:11,674 INFO L280 TraceCheckUtils]: 87: Hoare triple {10520#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10520#true} is VALID [2020-07-29 01:01:11,674 INFO L280 TraceCheckUtils]: 88: Hoare triple {10520#true} assume !!(~i~0 < ~size); {10520#true} is VALID [2020-07-29 01:01:11,674 INFO L280 TraceCheckUtils]: 89: Hoare triple {10520#true} assume 0 <= ~i~0 && ~i~0 < 32; {10520#true} is VALID [2020-07-29 01:01:11,674 INFO L280 TraceCheckUtils]: 90: Hoare triple {10520#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {10520#true} is VALID [2020-07-29 01:01:11,674 INFO L280 TraceCheckUtils]: 91: Hoare triple {10520#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {10520#true} is VALID [2020-07-29 01:01:11,674 INFO L280 TraceCheckUtils]: 92: Hoare triple {10520#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10520#true} is VALID [2020-07-29 01:01:11,674 INFO L280 TraceCheckUtils]: 93: Hoare triple {10520#true} assume !!(~i~0 < ~size); {10520#true} is VALID [2020-07-29 01:01:11,675 INFO L280 TraceCheckUtils]: 94: Hoare triple {10520#true} assume 0 <= ~i~0 && ~i~0 < 32; {10520#true} is VALID [2020-07-29 01:01:11,675 INFO L280 TraceCheckUtils]: 95: Hoare triple {10520#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {10520#true} is VALID [2020-07-29 01:01:11,675 INFO L280 TraceCheckUtils]: 96: Hoare triple {10520#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {10520#true} is VALID [2020-07-29 01:01:11,675 INFO L280 TraceCheckUtils]: 97: Hoare triple {10520#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10520#true} is VALID [2020-07-29 01:01:11,675 INFO L280 TraceCheckUtils]: 98: Hoare triple {10520#true} assume !!(~i~0 < ~size); {10520#true} is VALID [2020-07-29 01:01:11,675 INFO L280 TraceCheckUtils]: 99: Hoare triple {10520#true} assume 0 <= ~i~0 && ~i~0 < 32; {10520#true} is VALID [2020-07-29 01:01:11,675 INFO L280 TraceCheckUtils]: 100: Hoare triple {10520#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {10520#true} is VALID [2020-07-29 01:01:11,675 INFO L280 TraceCheckUtils]: 101: Hoare triple {10520#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {10520#true} is VALID [2020-07-29 01:01:11,676 INFO L280 TraceCheckUtils]: 102: Hoare triple {10520#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10520#true} is VALID [2020-07-29 01:01:11,676 INFO L280 TraceCheckUtils]: 103: Hoare triple {10520#true} assume !(~i~0 < ~size); {10520#true} is VALID [2020-07-29 01:01:11,676 INFO L280 TraceCheckUtils]: 104: Hoare triple {10520#true} #res := ~i~0; {10520#true} is VALID [2020-07-29 01:01:11,676 INFO L280 TraceCheckUtils]: 105: Hoare triple {10520#true} assume true; {10520#true} is VALID [2020-07-29 01:01:11,677 INFO L275 TraceCheckUtils]: 106: Hoare quadruple {10520#true} {10579#(<= main_~i~1 4)} #78#return; {10579#(<= main_~i~1 4)} is VALID [2020-07-29 01:01:11,677 INFO L280 TraceCheckUtils]: 107: Hoare triple {10579#(<= main_~i~1 4)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {10579#(<= main_~i~1 4)} is VALID [2020-07-29 01:01:11,678 INFO L280 TraceCheckUtils]: 108: Hoare triple {10579#(<= main_~i~1 4)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {10579#(<= main_~i~1 4)} is VALID [2020-07-29 01:01:11,678 INFO L280 TraceCheckUtils]: 109: Hoare triple {10579#(<= main_~i~1 4)} havoc #t~ret3; {10579#(<= main_~i~1 4)} is VALID [2020-07-29 01:01:11,679 INFO L280 TraceCheckUtils]: 110: Hoare triple {10579#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10605#(<= main_~i~1 5)} is VALID [2020-07-29 01:01:11,680 INFO L280 TraceCheckUtils]: 111: Hoare triple {10605#(<= main_~i~1 5)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {10605#(<= main_~i~1 5)} is VALID [2020-07-29 01:01:11,680 INFO L263 TraceCheckUtils]: 112: Hoare triple {10605#(<= main_~i~1 5)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {10520#true} is VALID [2020-07-29 01:01:11,680 INFO L280 TraceCheckUtils]: 113: Hoare triple {10520#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {10520#true} is VALID [2020-07-29 01:01:11,680 INFO L280 TraceCheckUtils]: 114: Hoare triple {10520#true} assume !!(~i~0 < ~size); {10520#true} is VALID [2020-07-29 01:01:11,680 INFO L280 TraceCheckUtils]: 115: Hoare triple {10520#true} assume 0 <= ~i~0 && ~i~0 < 32; {10520#true} is VALID [2020-07-29 01:01:11,680 INFO L280 TraceCheckUtils]: 116: Hoare triple {10520#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {10520#true} is VALID [2020-07-29 01:01:11,680 INFO L280 TraceCheckUtils]: 117: Hoare triple {10520#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {10520#true} is VALID [2020-07-29 01:01:11,681 INFO L280 TraceCheckUtils]: 118: Hoare triple {10520#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10520#true} is VALID [2020-07-29 01:01:11,681 INFO L280 TraceCheckUtils]: 119: Hoare triple {10520#true} assume !!(~i~0 < ~size); {10520#true} is VALID [2020-07-29 01:01:11,681 INFO L280 TraceCheckUtils]: 120: Hoare triple {10520#true} assume 0 <= ~i~0 && ~i~0 < 32; {10520#true} is VALID [2020-07-29 01:01:11,681 INFO L280 TraceCheckUtils]: 121: Hoare triple {10520#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {10520#true} is VALID [2020-07-29 01:01:11,681 INFO L280 TraceCheckUtils]: 122: Hoare triple {10520#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {10520#true} is VALID [2020-07-29 01:01:11,681 INFO L280 TraceCheckUtils]: 123: Hoare triple {10520#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10520#true} is VALID [2020-07-29 01:01:11,681 INFO L280 TraceCheckUtils]: 124: Hoare triple {10520#true} assume !!(~i~0 < ~size); {10520#true} is VALID [2020-07-29 01:01:11,682 INFO L280 TraceCheckUtils]: 125: Hoare triple {10520#true} assume 0 <= ~i~0 && ~i~0 < 32; {10520#true} is VALID [2020-07-29 01:01:11,682 INFO L280 TraceCheckUtils]: 126: Hoare triple {10520#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {10520#true} is VALID [2020-07-29 01:01:11,682 INFO L280 TraceCheckUtils]: 127: Hoare triple {10520#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {10520#true} is VALID [2020-07-29 01:01:11,682 INFO L280 TraceCheckUtils]: 128: Hoare triple {10520#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10520#true} is VALID [2020-07-29 01:01:11,682 INFO L280 TraceCheckUtils]: 129: Hoare triple {10520#true} assume !!(~i~0 < ~size); {10520#true} is VALID [2020-07-29 01:01:11,682 INFO L280 TraceCheckUtils]: 130: Hoare triple {10520#true} assume 0 <= ~i~0 && ~i~0 < 32; {10520#true} is VALID [2020-07-29 01:01:11,682 INFO L280 TraceCheckUtils]: 131: Hoare triple {10520#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {10520#true} is VALID [2020-07-29 01:01:11,682 INFO L280 TraceCheckUtils]: 132: Hoare triple {10520#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {10520#true} is VALID [2020-07-29 01:01:11,683 INFO L280 TraceCheckUtils]: 133: Hoare triple {10520#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10520#true} is VALID [2020-07-29 01:01:11,683 INFO L280 TraceCheckUtils]: 134: Hoare triple {10520#true} assume !(~i~0 < ~size); {10520#true} is VALID [2020-07-29 01:01:11,683 INFO L280 TraceCheckUtils]: 135: Hoare triple {10520#true} #res := ~i~0; {10520#true} is VALID [2020-07-29 01:01:11,683 INFO L280 TraceCheckUtils]: 136: Hoare triple {10520#true} assume true; {10520#true} is VALID [2020-07-29 01:01:11,684 INFO L275 TraceCheckUtils]: 137: Hoare quadruple {10520#true} {10605#(<= main_~i~1 5)} #78#return; {10605#(<= main_~i~1 5)} is VALID [2020-07-29 01:01:11,684 INFO L280 TraceCheckUtils]: 138: Hoare triple {10605#(<= main_~i~1 5)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {10605#(<= main_~i~1 5)} is VALID [2020-07-29 01:01:11,685 INFO L280 TraceCheckUtils]: 139: Hoare triple {10605#(<= main_~i~1 5)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {10605#(<= main_~i~1 5)} is VALID [2020-07-29 01:01:11,685 INFO L280 TraceCheckUtils]: 140: Hoare triple {10605#(<= main_~i~1 5)} havoc #t~ret3; {10605#(<= main_~i~1 5)} is VALID [2020-07-29 01:01:11,686 INFO L280 TraceCheckUtils]: 141: Hoare triple {10605#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10631#(<= main_~i~1 6)} is VALID [2020-07-29 01:01:11,687 INFO L280 TraceCheckUtils]: 142: Hoare triple {10631#(<= main_~i~1 6)} assume !(~i~1 < 32); {10521#false} is VALID [2020-07-29 01:01:11,687 INFO L280 TraceCheckUtils]: 143: Hoare triple {10521#false} ~i~1 := 0; {10521#false} is VALID [2020-07-29 01:01:11,687 INFO L280 TraceCheckUtils]: 144: Hoare triple {10521#false} assume !!(~i~1 < 32); {10521#false} is VALID [2020-07-29 01:01:11,687 INFO L280 TraceCheckUtils]: 145: Hoare triple {10521#false} SUMMARY for call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L30 {10521#false} is VALID [2020-07-29 01:01:11,687 INFO L280 TraceCheckUtils]: 146: Hoare triple {10521#false} assume !(#t~mem5 != ~i~1);havoc #t~mem5; {10521#false} is VALID [2020-07-29 01:01:11,688 INFO L280 TraceCheckUtils]: 147: Hoare triple {10521#false} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10521#false} is VALID [2020-07-29 01:01:11,688 INFO L280 TraceCheckUtils]: 148: Hoare triple {10521#false} assume !!(~i~1 < 32); {10521#false} is VALID [2020-07-29 01:01:11,688 INFO L280 TraceCheckUtils]: 149: Hoare triple {10521#false} SUMMARY for call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L30 {10521#false} is VALID [2020-07-29 01:01:11,688 INFO L280 TraceCheckUtils]: 150: Hoare triple {10521#false} assume !(#t~mem5 != ~i~1);havoc #t~mem5; {10521#false} is VALID [2020-07-29 01:01:11,688 INFO L280 TraceCheckUtils]: 151: Hoare triple {10521#false} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10521#false} is VALID [2020-07-29 01:01:11,688 INFO L280 TraceCheckUtils]: 152: Hoare triple {10521#false} assume !!(~i~1 < 32); {10521#false} is VALID [2020-07-29 01:01:11,689 INFO L280 TraceCheckUtils]: 153: Hoare triple {10521#false} SUMMARY for call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L30 {10521#false} is VALID [2020-07-29 01:01:11,689 INFO L280 TraceCheckUtils]: 154: Hoare triple {10521#false} assume !(#t~mem5 != ~i~1);havoc #t~mem5; {10521#false} is VALID [2020-07-29 01:01:11,689 INFO L280 TraceCheckUtils]: 155: Hoare triple {10521#false} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10521#false} is VALID [2020-07-29 01:01:11,689 INFO L280 TraceCheckUtils]: 156: Hoare triple {10521#false} assume !!(~i~1 < 32); {10521#false} is VALID [2020-07-29 01:01:11,689 INFO L280 TraceCheckUtils]: 157: Hoare triple {10521#false} SUMMARY for call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L30 {10521#false} is VALID [2020-07-29 01:01:11,690 INFO L280 TraceCheckUtils]: 158: Hoare triple {10521#false} assume !(#t~mem5 != ~i~1);havoc #t~mem5; {10521#false} is VALID [2020-07-29 01:01:11,690 INFO L280 TraceCheckUtils]: 159: Hoare triple {10521#false} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10521#false} is VALID [2020-07-29 01:01:11,690 INFO L280 TraceCheckUtils]: 160: Hoare triple {10521#false} assume !!(~i~1 < 32); {10521#false} is VALID [2020-07-29 01:01:11,690 INFO L280 TraceCheckUtils]: 161: Hoare triple {10521#false} assume !(4 + (~#b~0.offset + 4 * ~i~1) <= #length[~#b~0.base] && 0 <= ~#b~0.offset + 4 * ~i~1); {10521#false} is VALID [2020-07-29 01:01:11,707 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 646 trivial. 0 not checked. [2020-07-29 01:01:11,708 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569791195] [2020-07-29 01:01:11,708 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142866211] [2020-07-29 01:01:11,708 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:01:11,807 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 01:01:11,808 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:01:11,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-29 01:01:11,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:11,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:01:12,474 INFO L263 TraceCheckUtils]: 0: Hoare triple {10520#true} call ULTIMATE.init(); {10520#true} is VALID [2020-07-29 01:01:12,474 INFO L280 TraceCheckUtils]: 1: Hoare triple {10520#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {10520#true} is VALID [2020-07-29 01:01:12,475 INFO L280 TraceCheckUtils]: 2: Hoare triple {10520#true} assume true; {10520#true} is VALID [2020-07-29 01:01:12,475 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {10520#true} {10520#true} #74#return; {10520#true} is VALID [2020-07-29 01:01:12,475 INFO L263 TraceCheckUtils]: 4: Hoare triple {10520#true} call #t~ret6 := main(); {10520#true} is VALID [2020-07-29 01:01:12,476 INFO L280 TraceCheckUtils]: 5: Hoare triple {10520#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(128);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {10651#(<= 0 main_~i~1)} is VALID [2020-07-29 01:01:12,477 INFO L280 TraceCheckUtils]: 6: Hoare triple {10651#(<= 0 main_~i~1)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {10651#(<= 0 main_~i~1)} is VALID [2020-07-29 01:01:12,477 INFO L263 TraceCheckUtils]: 7: Hoare triple {10651#(<= 0 main_~i~1)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {10520#true} is VALID [2020-07-29 01:01:12,477 INFO L280 TraceCheckUtils]: 8: Hoare triple {10520#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {10520#true} is VALID [2020-07-29 01:01:12,477 INFO L280 TraceCheckUtils]: 9: Hoare triple {10520#true} assume !(~i~0 < ~size); {10520#true} is VALID [2020-07-29 01:01:12,477 INFO L280 TraceCheckUtils]: 10: Hoare triple {10520#true} #res := ~i~0; {10520#true} is VALID [2020-07-29 01:01:12,477 INFO L280 TraceCheckUtils]: 11: Hoare triple {10520#true} assume true; {10520#true} is VALID [2020-07-29 01:01:12,478 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {10520#true} {10651#(<= 0 main_~i~1)} #78#return; {10651#(<= 0 main_~i~1)} is VALID [2020-07-29 01:01:12,479 INFO L280 TraceCheckUtils]: 13: Hoare triple {10651#(<= 0 main_~i~1)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {10651#(<= 0 main_~i~1)} is VALID [2020-07-29 01:01:12,479 INFO L280 TraceCheckUtils]: 14: Hoare triple {10651#(<= 0 main_~i~1)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {10651#(<= 0 main_~i~1)} is VALID [2020-07-29 01:01:12,479 INFO L280 TraceCheckUtils]: 15: Hoare triple {10651#(<= 0 main_~i~1)} havoc #t~ret3; {10651#(<= 0 main_~i~1)} is VALID [2020-07-29 01:01:12,480 INFO L280 TraceCheckUtils]: 16: Hoare triple {10651#(<= 0 main_~i~1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10685#(<= 1 main_~i~1)} is VALID [2020-07-29 01:01:12,480 INFO L280 TraceCheckUtils]: 17: Hoare triple {10685#(<= 1 main_~i~1)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {10685#(<= 1 main_~i~1)} is VALID [2020-07-29 01:01:12,481 INFO L263 TraceCheckUtils]: 18: Hoare triple {10685#(<= 1 main_~i~1)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {10520#true} is VALID [2020-07-29 01:01:12,481 INFO L280 TraceCheckUtils]: 19: Hoare triple {10520#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {10520#true} is VALID [2020-07-29 01:01:12,481 INFO L280 TraceCheckUtils]: 20: Hoare triple {10520#true} assume !!(~i~0 < ~size); {10520#true} is VALID [2020-07-29 01:01:12,481 INFO L280 TraceCheckUtils]: 21: Hoare triple {10520#true} assume 0 <= ~i~0 && ~i~0 < 32; {10520#true} is VALID [2020-07-29 01:01:12,481 INFO L280 TraceCheckUtils]: 22: Hoare triple {10520#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {10520#true} is VALID [2020-07-29 01:01:12,481 INFO L280 TraceCheckUtils]: 23: Hoare triple {10520#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {10520#true} is VALID [2020-07-29 01:01:12,481 INFO L280 TraceCheckUtils]: 24: Hoare triple {10520#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10520#true} is VALID [2020-07-29 01:01:12,482 INFO L280 TraceCheckUtils]: 25: Hoare triple {10520#true} assume !(~i~0 < ~size); {10520#true} is VALID [2020-07-29 01:01:12,482 INFO L280 TraceCheckUtils]: 26: Hoare triple {10520#true} #res := ~i~0; {10520#true} is VALID [2020-07-29 01:01:12,482 INFO L280 TraceCheckUtils]: 27: Hoare triple {10520#true} assume true; {10520#true} is VALID [2020-07-29 01:01:12,483 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {10520#true} {10685#(<= 1 main_~i~1)} #78#return; {10685#(<= 1 main_~i~1)} is VALID [2020-07-29 01:01:12,483 INFO L280 TraceCheckUtils]: 29: Hoare triple {10685#(<= 1 main_~i~1)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {10685#(<= 1 main_~i~1)} is VALID [2020-07-29 01:01:12,483 INFO L280 TraceCheckUtils]: 30: Hoare triple {10685#(<= 1 main_~i~1)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {10685#(<= 1 main_~i~1)} is VALID [2020-07-29 01:01:12,484 INFO L280 TraceCheckUtils]: 31: Hoare triple {10685#(<= 1 main_~i~1)} havoc #t~ret3; {10685#(<= 1 main_~i~1)} is VALID [2020-07-29 01:01:12,484 INFO L280 TraceCheckUtils]: 32: Hoare triple {10685#(<= 1 main_~i~1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10734#(<= 2 main_~i~1)} is VALID [2020-07-29 01:01:12,485 INFO L280 TraceCheckUtils]: 33: Hoare triple {10734#(<= 2 main_~i~1)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {10734#(<= 2 main_~i~1)} is VALID [2020-07-29 01:01:12,485 INFO L263 TraceCheckUtils]: 34: Hoare triple {10734#(<= 2 main_~i~1)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {10520#true} is VALID [2020-07-29 01:01:12,485 INFO L280 TraceCheckUtils]: 35: Hoare triple {10520#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {10520#true} is VALID [2020-07-29 01:01:12,485 INFO L280 TraceCheckUtils]: 36: Hoare triple {10520#true} assume !!(~i~0 < ~size); {10520#true} is VALID [2020-07-29 01:01:12,485 INFO L280 TraceCheckUtils]: 37: Hoare triple {10520#true} assume 0 <= ~i~0 && ~i~0 < 32; {10520#true} is VALID [2020-07-29 01:01:12,486 INFO L280 TraceCheckUtils]: 38: Hoare triple {10520#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {10520#true} is VALID [2020-07-29 01:01:12,486 INFO L280 TraceCheckUtils]: 39: Hoare triple {10520#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {10520#true} is VALID [2020-07-29 01:01:12,486 INFO L280 TraceCheckUtils]: 40: Hoare triple {10520#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10520#true} is VALID [2020-07-29 01:01:12,486 INFO L280 TraceCheckUtils]: 41: Hoare triple {10520#true} assume !!(~i~0 < ~size); {10520#true} is VALID [2020-07-29 01:01:12,486 INFO L280 TraceCheckUtils]: 42: Hoare triple {10520#true} assume 0 <= ~i~0 && ~i~0 < 32; {10520#true} is VALID [2020-07-29 01:01:12,486 INFO L280 TraceCheckUtils]: 43: Hoare triple {10520#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {10520#true} is VALID [2020-07-29 01:01:12,486 INFO L280 TraceCheckUtils]: 44: Hoare triple {10520#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {10520#true} is VALID [2020-07-29 01:01:12,487 INFO L280 TraceCheckUtils]: 45: Hoare triple {10520#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10520#true} is VALID [2020-07-29 01:01:12,487 INFO L280 TraceCheckUtils]: 46: Hoare triple {10520#true} assume !(~i~0 < ~size); {10520#true} is VALID [2020-07-29 01:01:12,487 INFO L280 TraceCheckUtils]: 47: Hoare triple {10520#true} #res := ~i~0; {10520#true} is VALID [2020-07-29 01:01:12,487 INFO L280 TraceCheckUtils]: 48: Hoare triple {10520#true} assume true; {10520#true} is VALID [2020-07-29 01:01:12,488 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {10520#true} {10734#(<= 2 main_~i~1)} #78#return; {10734#(<= 2 main_~i~1)} is VALID [2020-07-29 01:01:12,488 INFO L280 TraceCheckUtils]: 50: Hoare triple {10734#(<= 2 main_~i~1)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {10734#(<= 2 main_~i~1)} is VALID [2020-07-29 01:01:12,489 INFO L280 TraceCheckUtils]: 51: Hoare triple {10734#(<= 2 main_~i~1)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {10734#(<= 2 main_~i~1)} is VALID [2020-07-29 01:01:12,489 INFO L280 TraceCheckUtils]: 52: Hoare triple {10734#(<= 2 main_~i~1)} havoc #t~ret3; {10734#(<= 2 main_~i~1)} is VALID [2020-07-29 01:01:12,495 INFO L280 TraceCheckUtils]: 53: Hoare triple {10734#(<= 2 main_~i~1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10798#(<= 3 main_~i~1)} is VALID [2020-07-29 01:01:12,495 INFO L280 TraceCheckUtils]: 54: Hoare triple {10798#(<= 3 main_~i~1)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {10798#(<= 3 main_~i~1)} is VALID [2020-07-29 01:01:12,495 INFO L263 TraceCheckUtils]: 55: Hoare triple {10798#(<= 3 main_~i~1)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {10520#true} is VALID [2020-07-29 01:01:12,496 INFO L280 TraceCheckUtils]: 56: Hoare triple {10520#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {10520#true} is VALID [2020-07-29 01:01:12,496 INFO L280 TraceCheckUtils]: 57: Hoare triple {10520#true} assume !!(~i~0 < ~size); {10520#true} is VALID [2020-07-29 01:01:12,496 INFO L280 TraceCheckUtils]: 58: Hoare triple {10520#true} assume 0 <= ~i~0 && ~i~0 < 32; {10520#true} is VALID [2020-07-29 01:01:12,496 INFO L280 TraceCheckUtils]: 59: Hoare triple {10520#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {10520#true} is VALID [2020-07-29 01:01:12,496 INFO L280 TraceCheckUtils]: 60: Hoare triple {10520#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {10520#true} is VALID [2020-07-29 01:01:12,496 INFO L280 TraceCheckUtils]: 61: Hoare triple {10520#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10520#true} is VALID [2020-07-29 01:01:12,496 INFO L280 TraceCheckUtils]: 62: Hoare triple {10520#true} assume !!(~i~0 < ~size); {10520#true} is VALID [2020-07-29 01:01:12,496 INFO L280 TraceCheckUtils]: 63: Hoare triple {10520#true} assume 0 <= ~i~0 && ~i~0 < 32; {10520#true} is VALID [2020-07-29 01:01:12,497 INFO L280 TraceCheckUtils]: 64: Hoare triple {10520#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {10520#true} is VALID [2020-07-29 01:01:12,497 INFO L280 TraceCheckUtils]: 65: Hoare triple {10520#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {10520#true} is VALID [2020-07-29 01:01:12,497 INFO L280 TraceCheckUtils]: 66: Hoare triple {10520#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10520#true} is VALID [2020-07-29 01:01:12,497 INFO L280 TraceCheckUtils]: 67: Hoare triple {10520#true} assume !!(~i~0 < ~size); {10520#true} is VALID [2020-07-29 01:01:12,497 INFO L280 TraceCheckUtils]: 68: Hoare triple {10520#true} assume 0 <= ~i~0 && ~i~0 < 32; {10520#true} is VALID [2020-07-29 01:01:12,497 INFO L280 TraceCheckUtils]: 69: Hoare triple {10520#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {10520#true} is VALID [2020-07-29 01:01:12,498 INFO L280 TraceCheckUtils]: 70: Hoare triple {10520#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {10520#true} is VALID [2020-07-29 01:01:12,498 INFO L280 TraceCheckUtils]: 71: Hoare triple {10520#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10520#true} is VALID [2020-07-29 01:01:12,498 INFO L280 TraceCheckUtils]: 72: Hoare triple {10520#true} assume !(~i~0 < ~size); {10520#true} is VALID [2020-07-29 01:01:12,498 INFO L280 TraceCheckUtils]: 73: Hoare triple {10520#true} #res := ~i~0; {10520#true} is VALID [2020-07-29 01:01:12,498 INFO L280 TraceCheckUtils]: 74: Hoare triple {10520#true} assume true; {10520#true} is VALID [2020-07-29 01:01:12,499 INFO L275 TraceCheckUtils]: 75: Hoare quadruple {10520#true} {10798#(<= 3 main_~i~1)} #78#return; {10798#(<= 3 main_~i~1)} is VALID [2020-07-29 01:01:12,500 INFO L280 TraceCheckUtils]: 76: Hoare triple {10798#(<= 3 main_~i~1)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {10798#(<= 3 main_~i~1)} is VALID [2020-07-29 01:01:12,500 INFO L280 TraceCheckUtils]: 77: Hoare triple {10798#(<= 3 main_~i~1)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {10798#(<= 3 main_~i~1)} is VALID [2020-07-29 01:01:12,500 INFO L280 TraceCheckUtils]: 78: Hoare triple {10798#(<= 3 main_~i~1)} havoc #t~ret3; {10798#(<= 3 main_~i~1)} is VALID [2020-07-29 01:01:12,501 INFO L280 TraceCheckUtils]: 79: Hoare triple {10798#(<= 3 main_~i~1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10877#(<= 4 main_~i~1)} is VALID [2020-07-29 01:01:12,502 INFO L280 TraceCheckUtils]: 80: Hoare triple {10877#(<= 4 main_~i~1)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {10877#(<= 4 main_~i~1)} is VALID [2020-07-29 01:01:12,502 INFO L263 TraceCheckUtils]: 81: Hoare triple {10877#(<= 4 main_~i~1)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {10520#true} is VALID [2020-07-29 01:01:12,502 INFO L280 TraceCheckUtils]: 82: Hoare triple {10520#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {10520#true} is VALID [2020-07-29 01:01:12,502 INFO L280 TraceCheckUtils]: 83: Hoare triple {10520#true} assume !!(~i~0 < ~size); {10520#true} is VALID [2020-07-29 01:01:12,502 INFO L280 TraceCheckUtils]: 84: Hoare triple {10520#true} assume 0 <= ~i~0 && ~i~0 < 32; {10520#true} is VALID [2020-07-29 01:01:12,502 INFO L280 TraceCheckUtils]: 85: Hoare triple {10520#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {10520#true} is VALID [2020-07-29 01:01:12,502 INFO L280 TraceCheckUtils]: 86: Hoare triple {10520#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {10520#true} is VALID [2020-07-29 01:01:12,502 INFO L280 TraceCheckUtils]: 87: Hoare triple {10520#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10520#true} is VALID [2020-07-29 01:01:12,503 INFO L280 TraceCheckUtils]: 88: Hoare triple {10520#true} assume !!(~i~0 < ~size); {10520#true} is VALID [2020-07-29 01:01:12,503 INFO L280 TraceCheckUtils]: 89: Hoare triple {10520#true} assume 0 <= ~i~0 && ~i~0 < 32; {10520#true} is VALID [2020-07-29 01:01:12,503 INFO L280 TraceCheckUtils]: 90: Hoare triple {10520#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {10520#true} is VALID [2020-07-29 01:01:12,503 INFO L280 TraceCheckUtils]: 91: Hoare triple {10520#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {10520#true} is VALID [2020-07-29 01:01:12,503 INFO L280 TraceCheckUtils]: 92: Hoare triple {10520#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10520#true} is VALID [2020-07-29 01:01:12,503 INFO L280 TraceCheckUtils]: 93: Hoare triple {10520#true} assume !!(~i~0 < ~size); {10520#true} is VALID [2020-07-29 01:01:12,503 INFO L280 TraceCheckUtils]: 94: Hoare triple {10520#true} assume 0 <= ~i~0 && ~i~0 < 32; {10520#true} is VALID [2020-07-29 01:01:12,504 INFO L280 TraceCheckUtils]: 95: Hoare triple {10520#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {10520#true} is VALID [2020-07-29 01:01:12,504 INFO L280 TraceCheckUtils]: 96: Hoare triple {10520#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {10520#true} is VALID [2020-07-29 01:01:12,504 INFO L280 TraceCheckUtils]: 97: Hoare triple {10520#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10520#true} is VALID [2020-07-29 01:01:12,504 INFO L280 TraceCheckUtils]: 98: Hoare triple {10520#true} assume !!(~i~0 < ~size); {10520#true} is VALID [2020-07-29 01:01:12,504 INFO L280 TraceCheckUtils]: 99: Hoare triple {10520#true} assume 0 <= ~i~0 && ~i~0 < 32; {10520#true} is VALID [2020-07-29 01:01:12,504 INFO L280 TraceCheckUtils]: 100: Hoare triple {10520#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {10520#true} is VALID [2020-07-29 01:01:12,505 INFO L280 TraceCheckUtils]: 101: Hoare triple {10520#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {10520#true} is VALID [2020-07-29 01:01:12,505 INFO L280 TraceCheckUtils]: 102: Hoare triple {10520#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10520#true} is VALID [2020-07-29 01:01:12,505 INFO L280 TraceCheckUtils]: 103: Hoare triple {10520#true} assume !(~i~0 < ~size); {10520#true} is VALID [2020-07-29 01:01:12,505 INFO L280 TraceCheckUtils]: 104: Hoare triple {10520#true} #res := ~i~0; {10520#true} is VALID [2020-07-29 01:01:12,505 INFO L280 TraceCheckUtils]: 105: Hoare triple {10520#true} assume true; {10520#true} is VALID [2020-07-29 01:01:12,513 INFO L275 TraceCheckUtils]: 106: Hoare quadruple {10520#true} {10877#(<= 4 main_~i~1)} #78#return; {10877#(<= 4 main_~i~1)} is VALID [2020-07-29 01:01:12,514 INFO L280 TraceCheckUtils]: 107: Hoare triple {10877#(<= 4 main_~i~1)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {10877#(<= 4 main_~i~1)} is VALID [2020-07-29 01:01:12,515 INFO L280 TraceCheckUtils]: 108: Hoare triple {10877#(<= 4 main_~i~1)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {10877#(<= 4 main_~i~1)} is VALID [2020-07-29 01:01:12,515 INFO L280 TraceCheckUtils]: 109: Hoare triple {10877#(<= 4 main_~i~1)} havoc #t~ret3; {10877#(<= 4 main_~i~1)} is VALID [2020-07-29 01:01:12,516 INFO L280 TraceCheckUtils]: 110: Hoare triple {10877#(<= 4 main_~i~1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10971#(<= 5 main_~i~1)} is VALID [2020-07-29 01:01:12,517 INFO L280 TraceCheckUtils]: 111: Hoare triple {10971#(<= 5 main_~i~1)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {10971#(<= 5 main_~i~1)} is VALID [2020-07-29 01:01:12,517 INFO L263 TraceCheckUtils]: 112: Hoare triple {10971#(<= 5 main_~i~1)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {10520#true} is VALID [2020-07-29 01:01:12,518 INFO L280 TraceCheckUtils]: 113: Hoare triple {10520#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {10981#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:01:12,518 INFO L280 TraceCheckUtils]: 114: Hoare triple {10981#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} assume !!(~i~0 < ~size); {10981#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:01:12,519 INFO L280 TraceCheckUtils]: 115: Hoare triple {10981#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} assume 0 <= ~i~0 && ~i~0 < 32; {10981#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:01:12,520 INFO L280 TraceCheckUtils]: 116: Hoare triple {10981#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {10981#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:01:12,520 INFO L280 TraceCheckUtils]: 117: Hoare triple {10981#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {10981#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:01:12,521 INFO L280 TraceCheckUtils]: 118: Hoare triple {10981#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10997#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} is VALID [2020-07-29 01:01:12,522 INFO L280 TraceCheckUtils]: 119: Hoare triple {10997#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} assume !!(~i~0 < ~size); {10997#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} is VALID [2020-07-29 01:01:12,523 INFO L280 TraceCheckUtils]: 120: Hoare triple {10997#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} assume 0 <= ~i~0 && ~i~0 < 32; {10997#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} is VALID [2020-07-29 01:01:12,524 INFO L280 TraceCheckUtils]: 121: Hoare triple {10997#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {10997#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} is VALID [2020-07-29 01:01:12,524 INFO L280 TraceCheckUtils]: 122: Hoare triple {10997#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {10997#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} is VALID [2020-07-29 01:01:12,528 INFO L280 TraceCheckUtils]: 123: Hoare triple {10997#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11013#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} is VALID [2020-07-29 01:01:12,529 INFO L280 TraceCheckUtils]: 124: Hoare triple {11013#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} assume !!(~i~0 < ~size); {11013#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} is VALID [2020-07-29 01:01:12,529 INFO L280 TraceCheckUtils]: 125: Hoare triple {11013#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} assume 0 <= ~i~0 && ~i~0 < 32; {11013#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} is VALID [2020-07-29 01:01:12,530 INFO L280 TraceCheckUtils]: 126: Hoare triple {11013#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {11013#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} is VALID [2020-07-29 01:01:12,531 INFO L280 TraceCheckUtils]: 127: Hoare triple {11013#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {11013#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} is VALID [2020-07-29 01:01:12,531 INFO L280 TraceCheckUtils]: 128: Hoare triple {11013#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11029#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 3))} is VALID [2020-07-29 01:01:12,532 INFO L280 TraceCheckUtils]: 129: Hoare triple {11029#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 3))} assume !!(~i~0 < ~size); {11029#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 3))} is VALID [2020-07-29 01:01:12,532 INFO L280 TraceCheckUtils]: 130: Hoare triple {11029#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 3))} assume 0 <= ~i~0 && ~i~0 < 32; {11029#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 3))} is VALID [2020-07-29 01:01:12,533 INFO L280 TraceCheckUtils]: 131: Hoare triple {11029#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 3))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {11029#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 3))} is VALID [2020-07-29 01:01:12,533 INFO L280 TraceCheckUtils]: 132: Hoare triple {11029#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 3))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {11029#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 3))} is VALID [2020-07-29 01:01:12,534 INFO L280 TraceCheckUtils]: 133: Hoare triple {11029#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 3))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11045#(and (<= foo_~i~0 4) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:01:12,535 INFO L280 TraceCheckUtils]: 134: Hoare triple {11045#(and (<= foo_~i~0 4) (<= |foo_#in~size| foo_~size))} assume !(~i~0 < ~size); {11049#(<= |foo_#in~size| 4)} is VALID [2020-07-29 01:01:12,535 INFO L280 TraceCheckUtils]: 135: Hoare triple {11049#(<= |foo_#in~size| 4)} #res := ~i~0; {11049#(<= |foo_#in~size| 4)} is VALID [2020-07-29 01:01:12,535 INFO L280 TraceCheckUtils]: 136: Hoare triple {11049#(<= |foo_#in~size| 4)} assume true; {11049#(<= |foo_#in~size| 4)} is VALID [2020-07-29 01:01:12,536 INFO L275 TraceCheckUtils]: 137: Hoare quadruple {11049#(<= |foo_#in~size| 4)} {10971#(<= 5 main_~i~1)} #78#return; {10521#false} is VALID [2020-07-29 01:01:12,537 INFO L280 TraceCheckUtils]: 138: Hoare triple {10521#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {10521#false} is VALID [2020-07-29 01:01:12,537 INFO L280 TraceCheckUtils]: 139: Hoare triple {10521#false} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {10521#false} is VALID [2020-07-29 01:01:12,537 INFO L280 TraceCheckUtils]: 140: Hoare triple {10521#false} havoc #t~ret3; {10521#false} is VALID [2020-07-29 01:01:12,537 INFO L280 TraceCheckUtils]: 141: Hoare triple {10521#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10521#false} is VALID [2020-07-29 01:01:12,537 INFO L280 TraceCheckUtils]: 142: Hoare triple {10521#false} assume !(~i~1 < 32); {10521#false} is VALID [2020-07-29 01:01:12,537 INFO L280 TraceCheckUtils]: 143: Hoare triple {10521#false} ~i~1 := 0; {10521#false} is VALID [2020-07-29 01:01:12,537 INFO L280 TraceCheckUtils]: 144: Hoare triple {10521#false} assume !!(~i~1 < 32); {10521#false} is VALID [2020-07-29 01:01:12,537 INFO L280 TraceCheckUtils]: 145: Hoare triple {10521#false} SUMMARY for call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L30 {10521#false} is VALID [2020-07-29 01:01:12,538 INFO L280 TraceCheckUtils]: 146: Hoare triple {10521#false} assume !(#t~mem5 != ~i~1);havoc #t~mem5; {10521#false} is VALID [2020-07-29 01:01:12,538 INFO L280 TraceCheckUtils]: 147: Hoare triple {10521#false} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10521#false} is VALID [2020-07-29 01:01:12,538 INFO L280 TraceCheckUtils]: 148: Hoare triple {10521#false} assume !!(~i~1 < 32); {10521#false} is VALID [2020-07-29 01:01:12,538 INFO L280 TraceCheckUtils]: 149: Hoare triple {10521#false} SUMMARY for call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L30 {10521#false} is VALID [2020-07-29 01:01:12,538 INFO L280 TraceCheckUtils]: 150: Hoare triple {10521#false} assume !(#t~mem5 != ~i~1);havoc #t~mem5; {10521#false} is VALID [2020-07-29 01:01:12,538 INFO L280 TraceCheckUtils]: 151: Hoare triple {10521#false} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10521#false} is VALID [2020-07-29 01:01:12,538 INFO L280 TraceCheckUtils]: 152: Hoare triple {10521#false} assume !!(~i~1 < 32); {10521#false} is VALID [2020-07-29 01:01:12,539 INFO L280 TraceCheckUtils]: 153: Hoare triple {10521#false} SUMMARY for call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L30 {10521#false} is VALID [2020-07-29 01:01:12,539 INFO L280 TraceCheckUtils]: 154: Hoare triple {10521#false} assume !(#t~mem5 != ~i~1);havoc #t~mem5; {10521#false} is VALID [2020-07-29 01:01:12,539 INFO L280 TraceCheckUtils]: 155: Hoare triple {10521#false} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10521#false} is VALID [2020-07-29 01:01:12,539 INFO L280 TraceCheckUtils]: 156: Hoare triple {10521#false} assume !!(~i~1 < 32); {10521#false} is VALID [2020-07-29 01:01:12,539 INFO L280 TraceCheckUtils]: 157: Hoare triple {10521#false} SUMMARY for call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L30 {10521#false} is VALID [2020-07-29 01:01:12,539 INFO L280 TraceCheckUtils]: 158: Hoare triple {10521#false} assume !(#t~mem5 != ~i~1);havoc #t~mem5; {10521#false} is VALID [2020-07-29 01:01:12,539 INFO L280 TraceCheckUtils]: 159: Hoare triple {10521#false} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10521#false} is VALID [2020-07-29 01:01:12,539 INFO L280 TraceCheckUtils]: 160: Hoare triple {10521#false} assume !!(~i~1 < 32); {10521#false} is VALID [2020-07-29 01:01:12,540 INFO L280 TraceCheckUtils]: 161: Hoare triple {10521#false} assume !(4 + (~#b~0.offset + 4 * ~i~1) <= #length[~#b~0.base] && 0 <= ~#b~0.offset + 4 * ~i~1); {10521#false} is VALID [2020-07-29 01:01:12,556 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 346 proven. 34 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2020-07-29 01:01:12,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:01:12,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14] total 22 [2020-07-29 01:01:12,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018122842] [2020-07-29 01:01:12,558 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 162 [2020-07-29 01:01:12,559 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:01:12,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2020-07-29 01:01:12,732 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:01:12,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-07-29 01:01:12,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:01:12,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-07-29 01:01:12,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2020-07-29 01:01:12,734 INFO L87 Difference]: Start difference. First operand 138 states and 143 transitions. Second operand 22 states. [2020-07-29 01:01:15,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:01:15,220 INFO L93 Difference]: Finished difference Result 232 states and 244 transitions. [2020-07-29 01:01:15,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-07-29 01:01:15,221 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 162 [2020-07-29 01:01:15,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:01:15,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-29 01:01:15,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 192 transitions. [2020-07-29 01:01:15,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-29 01:01:15,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 192 transitions. [2020-07-29 01:01:15,227 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 192 transitions. [2020-07-29 01:01:15,506 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:01:15,521 INFO L225 Difference]: With dead ends: 232 [2020-07-29 01:01:15,521 INFO L226 Difference]: Without dead ends: 232 [2020-07-29 01:01:15,522 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=257, Invalid=1225, Unknown=0, NotChecked=0, Total=1482 [2020-07-29 01:01:15,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2020-07-29 01:01:15,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 174. [2020-07-29 01:01:15,530 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:01:15,530 INFO L82 GeneralOperation]: Start isEquivalent. First operand 232 states. Second operand 174 states. [2020-07-29 01:01:15,530 INFO L74 IsIncluded]: Start isIncluded. First operand 232 states. Second operand 174 states. [2020-07-29 01:01:15,531 INFO L87 Difference]: Start difference. First operand 232 states. Second operand 174 states. [2020-07-29 01:01:15,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:01:15,543 INFO L93 Difference]: Finished difference Result 232 states and 244 transitions. [2020-07-29 01:01:15,544 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 244 transitions. [2020-07-29 01:01:15,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:01:15,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:01:15,546 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand 232 states. [2020-07-29 01:01:15,546 INFO L87 Difference]: Start difference. First operand 174 states. Second operand 232 states. [2020-07-29 01:01:15,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:01:15,557 INFO L93 Difference]: Finished difference Result 232 states and 244 transitions. [2020-07-29 01:01:15,557 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 244 transitions. [2020-07-29 01:01:15,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:01:15,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:01:15,560 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:01:15,560 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:01:15,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2020-07-29 01:01:15,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 182 transitions. [2020-07-29 01:01:15,566 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 182 transitions. Word has length 162 [2020-07-29 01:01:15,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:01:15,566 INFO L479 AbstractCegarLoop]: Abstraction has 174 states and 182 transitions. [2020-07-29 01:01:15,566 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-07-29 01:01:15,567 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 182 transitions. [2020-07-29 01:01:15,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2020-07-29 01:01:15,572 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:01:15,572 INFO L422 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:01:15,786 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2020-07-29 01:01:15,787 INFO L427 AbstractCegarLoop]: === Iteration 23 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:01:15,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:01:15,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1415289466, now seen corresponding path program 3 times [2020-07-29 01:01:15,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:01:15,788 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700985944] [2020-07-29 01:01:15,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:01:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:15,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:01:15,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:15,981 INFO L280 TraceCheckUtils]: 0: Hoare triple {12182#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {12034#true} is VALID [2020-07-29 01:01:15,982 INFO L280 TraceCheckUtils]: 1: Hoare triple {12034#true} assume true; {12034#true} is VALID [2020-07-29 01:01:15,982 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {12034#true} {12034#true} #74#return; {12034#true} is VALID [2020-07-29 01:01:15,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-07-29 01:01:15,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:15,987 INFO L280 TraceCheckUtils]: 0: Hoare triple {12034#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {12034#true} is VALID [2020-07-29 01:01:15,987 INFO L280 TraceCheckUtils]: 1: Hoare triple {12034#true} assume !(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:15,987 INFO L280 TraceCheckUtils]: 2: Hoare triple {12034#true} #res := ~i~0; {12034#true} is VALID [2020-07-29 01:01:15,987 INFO L280 TraceCheckUtils]: 3: Hoare triple {12034#true} assume true; {12034#true} is VALID [2020-07-29 01:01:15,989 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {12034#true} {12039#(= 0 main_~i~1)} #78#return; {12039#(= 0 main_~i~1)} is VALID [2020-07-29 01:01:15,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-07-29 01:01:15,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:15,994 INFO L280 TraceCheckUtils]: 0: Hoare triple {12034#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {12034#true} is VALID [2020-07-29 01:01:15,995 INFO L280 TraceCheckUtils]: 1: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:15,995 INFO L280 TraceCheckUtils]: 2: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:15,995 INFO L280 TraceCheckUtils]: 3: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:15,995 INFO L280 TraceCheckUtils]: 4: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:15,995 INFO L280 TraceCheckUtils]: 5: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:15,995 INFO L280 TraceCheckUtils]: 6: Hoare triple {12034#true} assume !(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:15,996 INFO L280 TraceCheckUtils]: 7: Hoare triple {12034#true} #res := ~i~0; {12034#true} is VALID [2020-07-29 01:01:15,996 INFO L280 TraceCheckUtils]: 8: Hoare triple {12034#true} assume true; {12034#true} is VALID [2020-07-29 01:01:15,997 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {12034#true} {12045#(<= main_~i~1 1)} #78#return; {12045#(<= main_~i~1 1)} is VALID [2020-07-29 01:01:15,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-07-29 01:01:16,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:16,005 INFO L280 TraceCheckUtils]: 0: Hoare triple {12034#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {12034#true} is VALID [2020-07-29 01:01:16,005 INFO L280 TraceCheckUtils]: 1: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,006 INFO L280 TraceCheckUtils]: 2: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,006 INFO L280 TraceCheckUtils]: 3: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,006 INFO L280 TraceCheckUtils]: 4: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,006 INFO L280 TraceCheckUtils]: 5: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,006 INFO L280 TraceCheckUtils]: 6: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,006 INFO L280 TraceCheckUtils]: 7: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,006 INFO L280 TraceCheckUtils]: 8: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,007 INFO L280 TraceCheckUtils]: 9: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,007 INFO L280 TraceCheckUtils]: 10: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,007 INFO L280 TraceCheckUtils]: 11: Hoare triple {12034#true} assume !(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,007 INFO L280 TraceCheckUtils]: 12: Hoare triple {12034#true} #res := ~i~0; {12034#true} is VALID [2020-07-29 01:01:16,008 INFO L280 TraceCheckUtils]: 13: Hoare triple {12034#true} assume true; {12034#true} is VALID [2020-07-29 01:01:16,009 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {12034#true} {12056#(<= main_~i~1 2)} #78#return; {12056#(<= main_~i~1 2)} is VALID [2020-07-29 01:01:16,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-07-29 01:01:16,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:16,017 INFO L280 TraceCheckUtils]: 0: Hoare triple {12034#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {12034#true} is VALID [2020-07-29 01:01:16,018 INFO L280 TraceCheckUtils]: 1: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,018 INFO L280 TraceCheckUtils]: 2: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,018 INFO L280 TraceCheckUtils]: 3: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,018 INFO L280 TraceCheckUtils]: 4: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,019 INFO L280 TraceCheckUtils]: 5: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,019 INFO L280 TraceCheckUtils]: 6: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,019 INFO L280 TraceCheckUtils]: 7: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,019 INFO L280 TraceCheckUtils]: 8: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,019 INFO L280 TraceCheckUtils]: 9: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,019 INFO L280 TraceCheckUtils]: 10: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,020 INFO L280 TraceCheckUtils]: 11: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,020 INFO L280 TraceCheckUtils]: 12: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,020 INFO L280 TraceCheckUtils]: 13: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,020 INFO L280 TraceCheckUtils]: 14: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,021 INFO L280 TraceCheckUtils]: 15: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,021 INFO L280 TraceCheckUtils]: 16: Hoare triple {12034#true} assume !(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,021 INFO L280 TraceCheckUtils]: 17: Hoare triple {12034#true} #res := ~i~0; {12034#true} is VALID [2020-07-29 01:01:16,021 INFO L280 TraceCheckUtils]: 18: Hoare triple {12034#true} assume true; {12034#true} is VALID [2020-07-29 01:01:16,023 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {12034#true} {12072#(<= main_~i~1 3)} #78#return; {12072#(<= main_~i~1 3)} is VALID [2020-07-29 01:01:16,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-07-29 01:01:16,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:16,032 INFO L280 TraceCheckUtils]: 0: Hoare triple {12034#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {12034#true} is VALID [2020-07-29 01:01:16,033 INFO L280 TraceCheckUtils]: 1: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,033 INFO L280 TraceCheckUtils]: 2: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,033 INFO L280 TraceCheckUtils]: 3: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,033 INFO L280 TraceCheckUtils]: 4: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,033 INFO L280 TraceCheckUtils]: 5: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,033 INFO L280 TraceCheckUtils]: 6: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,034 INFO L280 TraceCheckUtils]: 7: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,034 INFO L280 TraceCheckUtils]: 8: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,034 INFO L280 TraceCheckUtils]: 9: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,034 INFO L280 TraceCheckUtils]: 10: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,034 INFO L280 TraceCheckUtils]: 11: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,034 INFO L280 TraceCheckUtils]: 12: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,035 INFO L280 TraceCheckUtils]: 13: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,035 INFO L280 TraceCheckUtils]: 14: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,035 INFO L280 TraceCheckUtils]: 15: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,035 INFO L280 TraceCheckUtils]: 16: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,036 INFO L280 TraceCheckUtils]: 17: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,036 INFO L280 TraceCheckUtils]: 18: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,036 INFO L280 TraceCheckUtils]: 19: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,036 INFO L280 TraceCheckUtils]: 20: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,037 INFO L280 TraceCheckUtils]: 21: Hoare triple {12034#true} assume !(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,037 INFO L280 TraceCheckUtils]: 22: Hoare triple {12034#true} #res := ~i~0; {12034#true} is VALID [2020-07-29 01:01:16,037 INFO L280 TraceCheckUtils]: 23: Hoare triple {12034#true} assume true; {12034#true} is VALID [2020-07-29 01:01:16,038 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {12034#true} {12093#(<= main_~i~1 4)} #78#return; {12093#(<= main_~i~1 4)} is VALID [2020-07-29 01:01:16,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2020-07-29 01:01:16,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:16,049 INFO L280 TraceCheckUtils]: 0: Hoare triple {12034#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {12034#true} is VALID [2020-07-29 01:01:16,049 INFO L280 TraceCheckUtils]: 1: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,050 INFO L280 TraceCheckUtils]: 2: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,050 INFO L280 TraceCheckUtils]: 3: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,050 INFO L280 TraceCheckUtils]: 4: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,050 INFO L280 TraceCheckUtils]: 5: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,051 INFO L280 TraceCheckUtils]: 6: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,051 INFO L280 TraceCheckUtils]: 7: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,051 INFO L280 TraceCheckUtils]: 8: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,051 INFO L280 TraceCheckUtils]: 9: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,051 INFO L280 TraceCheckUtils]: 10: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,051 INFO L280 TraceCheckUtils]: 11: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,052 INFO L280 TraceCheckUtils]: 12: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,052 INFO L280 TraceCheckUtils]: 13: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,052 INFO L280 TraceCheckUtils]: 14: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,052 INFO L280 TraceCheckUtils]: 15: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,052 INFO L280 TraceCheckUtils]: 16: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,052 INFO L280 TraceCheckUtils]: 17: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,053 INFO L280 TraceCheckUtils]: 18: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,053 INFO L280 TraceCheckUtils]: 19: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,053 INFO L280 TraceCheckUtils]: 20: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,054 INFO L280 TraceCheckUtils]: 21: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,054 INFO L280 TraceCheckUtils]: 22: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,054 INFO L280 TraceCheckUtils]: 23: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,054 INFO L280 TraceCheckUtils]: 24: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,055 INFO L280 TraceCheckUtils]: 25: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,055 INFO L280 TraceCheckUtils]: 26: Hoare triple {12034#true} assume !(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,055 INFO L280 TraceCheckUtils]: 27: Hoare triple {12034#true} #res := ~i~0; {12034#true} is VALID [2020-07-29 01:01:16,055 INFO L280 TraceCheckUtils]: 28: Hoare triple {12034#true} assume true; {12034#true} is VALID [2020-07-29 01:01:16,057 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {12034#true} {12119#(<= main_~i~1 5)} #78#return; {12119#(<= main_~i~1 5)} is VALID [2020-07-29 01:01:16,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2020-07-29 01:01:16,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:16,075 INFO L280 TraceCheckUtils]: 0: Hoare triple {12034#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {12034#true} is VALID [2020-07-29 01:01:16,075 INFO L280 TraceCheckUtils]: 1: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,075 INFO L280 TraceCheckUtils]: 2: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,076 INFO L280 TraceCheckUtils]: 3: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,076 INFO L280 TraceCheckUtils]: 4: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,076 INFO L280 TraceCheckUtils]: 5: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,076 INFO L280 TraceCheckUtils]: 6: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,077 INFO L280 TraceCheckUtils]: 7: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,077 INFO L280 TraceCheckUtils]: 8: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,077 INFO L280 TraceCheckUtils]: 9: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,077 INFO L280 TraceCheckUtils]: 10: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,077 INFO L280 TraceCheckUtils]: 11: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,078 INFO L280 TraceCheckUtils]: 12: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,078 INFO L280 TraceCheckUtils]: 13: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,078 INFO L280 TraceCheckUtils]: 14: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,078 INFO L280 TraceCheckUtils]: 15: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,078 INFO L280 TraceCheckUtils]: 16: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,078 INFO L280 TraceCheckUtils]: 17: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,079 INFO L280 TraceCheckUtils]: 18: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,079 INFO L280 TraceCheckUtils]: 19: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,079 INFO L280 TraceCheckUtils]: 20: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,079 INFO L280 TraceCheckUtils]: 21: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,080 INFO L280 TraceCheckUtils]: 22: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,080 INFO L280 TraceCheckUtils]: 23: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,080 INFO L280 TraceCheckUtils]: 24: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,080 INFO L280 TraceCheckUtils]: 25: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,081 INFO L280 TraceCheckUtils]: 26: Hoare triple {12034#true} assume !(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,081 INFO L280 TraceCheckUtils]: 27: Hoare triple {12034#true} #res := ~i~0; {12034#true} is VALID [2020-07-29 01:01:16,081 INFO L280 TraceCheckUtils]: 28: Hoare triple {12034#true} assume true; {12034#true} is VALID [2020-07-29 01:01:16,083 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {12034#true} {12150#(<= main_~i~1 6)} #78#return; {12150#(<= main_~i~1 6)} is VALID [2020-07-29 01:01:16,084 INFO L263 TraceCheckUtils]: 0: Hoare triple {12034#true} call ULTIMATE.init(); {12182#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:01:16,085 INFO L280 TraceCheckUtils]: 1: Hoare triple {12182#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {12034#true} is VALID [2020-07-29 01:01:16,085 INFO L280 TraceCheckUtils]: 2: Hoare triple {12034#true} assume true; {12034#true} is VALID [2020-07-29 01:01:16,085 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {12034#true} {12034#true} #74#return; {12034#true} is VALID [2020-07-29 01:01:16,085 INFO L263 TraceCheckUtils]: 4: Hoare triple {12034#true} call #t~ret6 := main(); {12034#true} is VALID [2020-07-29 01:01:16,086 INFO L280 TraceCheckUtils]: 5: Hoare triple {12034#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(128);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {12039#(= 0 main_~i~1)} is VALID [2020-07-29 01:01:16,087 INFO L280 TraceCheckUtils]: 6: Hoare triple {12039#(= 0 main_~i~1)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {12039#(= 0 main_~i~1)} is VALID [2020-07-29 01:01:16,087 INFO L263 TraceCheckUtils]: 7: Hoare triple {12039#(= 0 main_~i~1)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {12034#true} is VALID [2020-07-29 01:01:16,087 INFO L280 TraceCheckUtils]: 8: Hoare triple {12034#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {12034#true} is VALID [2020-07-29 01:01:16,087 INFO L280 TraceCheckUtils]: 9: Hoare triple {12034#true} assume !(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,088 INFO L280 TraceCheckUtils]: 10: Hoare triple {12034#true} #res := ~i~0; {12034#true} is VALID [2020-07-29 01:01:16,088 INFO L280 TraceCheckUtils]: 11: Hoare triple {12034#true} assume true; {12034#true} is VALID [2020-07-29 01:01:16,089 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {12034#true} {12039#(= 0 main_~i~1)} #78#return; {12039#(= 0 main_~i~1)} is VALID [2020-07-29 01:01:16,090 INFO L280 TraceCheckUtils]: 13: Hoare triple {12039#(= 0 main_~i~1)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {12039#(= 0 main_~i~1)} is VALID [2020-07-29 01:01:16,090 INFO L280 TraceCheckUtils]: 14: Hoare triple {12039#(= 0 main_~i~1)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {12039#(= 0 main_~i~1)} is VALID [2020-07-29 01:01:16,091 INFO L280 TraceCheckUtils]: 15: Hoare triple {12039#(= 0 main_~i~1)} havoc #t~ret3; {12039#(= 0 main_~i~1)} is VALID [2020-07-29 01:01:16,091 INFO L280 TraceCheckUtils]: 16: Hoare triple {12039#(= 0 main_~i~1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12045#(<= main_~i~1 1)} is VALID [2020-07-29 01:01:16,092 INFO L280 TraceCheckUtils]: 17: Hoare triple {12045#(<= main_~i~1 1)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {12045#(<= main_~i~1 1)} is VALID [2020-07-29 01:01:16,092 INFO L263 TraceCheckUtils]: 18: Hoare triple {12045#(<= main_~i~1 1)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {12034#true} is VALID [2020-07-29 01:01:16,092 INFO L280 TraceCheckUtils]: 19: Hoare triple {12034#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {12034#true} is VALID [2020-07-29 01:01:16,092 INFO L280 TraceCheckUtils]: 20: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,093 INFO L280 TraceCheckUtils]: 21: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,093 INFO L280 TraceCheckUtils]: 22: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,093 INFO L280 TraceCheckUtils]: 23: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,093 INFO L280 TraceCheckUtils]: 24: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,093 INFO L280 TraceCheckUtils]: 25: Hoare triple {12034#true} assume !(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,094 INFO L280 TraceCheckUtils]: 26: Hoare triple {12034#true} #res := ~i~0; {12034#true} is VALID [2020-07-29 01:01:16,094 INFO L280 TraceCheckUtils]: 27: Hoare triple {12034#true} assume true; {12034#true} is VALID [2020-07-29 01:01:16,095 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {12034#true} {12045#(<= main_~i~1 1)} #78#return; {12045#(<= main_~i~1 1)} is VALID [2020-07-29 01:01:16,096 INFO L280 TraceCheckUtils]: 29: Hoare triple {12045#(<= main_~i~1 1)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {12045#(<= main_~i~1 1)} is VALID [2020-07-29 01:01:16,096 INFO L280 TraceCheckUtils]: 30: Hoare triple {12045#(<= main_~i~1 1)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {12045#(<= main_~i~1 1)} is VALID [2020-07-29 01:01:16,097 INFO L280 TraceCheckUtils]: 31: Hoare triple {12045#(<= main_~i~1 1)} havoc #t~ret3; {12045#(<= main_~i~1 1)} is VALID [2020-07-29 01:01:16,098 INFO L280 TraceCheckUtils]: 32: Hoare triple {12045#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12056#(<= main_~i~1 2)} is VALID [2020-07-29 01:01:16,099 INFO L280 TraceCheckUtils]: 33: Hoare triple {12056#(<= main_~i~1 2)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {12056#(<= main_~i~1 2)} is VALID [2020-07-29 01:01:16,099 INFO L263 TraceCheckUtils]: 34: Hoare triple {12056#(<= main_~i~1 2)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {12034#true} is VALID [2020-07-29 01:01:16,099 INFO L280 TraceCheckUtils]: 35: Hoare triple {12034#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {12034#true} is VALID [2020-07-29 01:01:16,099 INFO L280 TraceCheckUtils]: 36: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,099 INFO L280 TraceCheckUtils]: 37: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,099 INFO L280 TraceCheckUtils]: 38: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,100 INFO L280 TraceCheckUtils]: 39: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,100 INFO L280 TraceCheckUtils]: 40: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,100 INFO L280 TraceCheckUtils]: 41: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,100 INFO L280 TraceCheckUtils]: 42: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,101 INFO L280 TraceCheckUtils]: 43: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,101 INFO L280 TraceCheckUtils]: 44: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,101 INFO L280 TraceCheckUtils]: 45: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,101 INFO L280 TraceCheckUtils]: 46: Hoare triple {12034#true} assume !(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,101 INFO L280 TraceCheckUtils]: 47: Hoare triple {12034#true} #res := ~i~0; {12034#true} is VALID [2020-07-29 01:01:16,101 INFO L280 TraceCheckUtils]: 48: Hoare triple {12034#true} assume true; {12034#true} is VALID [2020-07-29 01:01:16,103 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {12034#true} {12056#(<= main_~i~1 2)} #78#return; {12056#(<= main_~i~1 2)} is VALID [2020-07-29 01:01:16,105 INFO L280 TraceCheckUtils]: 50: Hoare triple {12056#(<= main_~i~1 2)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {12056#(<= main_~i~1 2)} is VALID [2020-07-29 01:01:16,105 INFO L280 TraceCheckUtils]: 51: Hoare triple {12056#(<= main_~i~1 2)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {12056#(<= main_~i~1 2)} is VALID [2020-07-29 01:01:16,106 INFO L280 TraceCheckUtils]: 52: Hoare triple {12056#(<= main_~i~1 2)} havoc #t~ret3; {12056#(<= main_~i~1 2)} is VALID [2020-07-29 01:01:16,107 INFO L280 TraceCheckUtils]: 53: Hoare triple {12056#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12072#(<= main_~i~1 3)} is VALID [2020-07-29 01:01:16,108 INFO L280 TraceCheckUtils]: 54: Hoare triple {12072#(<= main_~i~1 3)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {12072#(<= main_~i~1 3)} is VALID [2020-07-29 01:01:16,108 INFO L263 TraceCheckUtils]: 55: Hoare triple {12072#(<= main_~i~1 3)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {12034#true} is VALID [2020-07-29 01:01:16,108 INFO L280 TraceCheckUtils]: 56: Hoare triple {12034#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {12034#true} is VALID [2020-07-29 01:01:16,108 INFO L280 TraceCheckUtils]: 57: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,108 INFO L280 TraceCheckUtils]: 58: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,108 INFO L280 TraceCheckUtils]: 59: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,109 INFO L280 TraceCheckUtils]: 60: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,109 INFO L280 TraceCheckUtils]: 61: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,109 INFO L280 TraceCheckUtils]: 62: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,109 INFO L280 TraceCheckUtils]: 63: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,110 INFO L280 TraceCheckUtils]: 64: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,110 INFO L280 TraceCheckUtils]: 65: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,110 INFO L280 TraceCheckUtils]: 66: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,110 INFO L280 TraceCheckUtils]: 67: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,110 INFO L280 TraceCheckUtils]: 68: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,110 INFO L280 TraceCheckUtils]: 69: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,111 INFO L280 TraceCheckUtils]: 70: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,111 INFO L280 TraceCheckUtils]: 71: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,111 INFO L280 TraceCheckUtils]: 72: Hoare triple {12034#true} assume !(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,111 INFO L280 TraceCheckUtils]: 73: Hoare triple {12034#true} #res := ~i~0; {12034#true} is VALID [2020-07-29 01:01:16,111 INFO L280 TraceCheckUtils]: 74: Hoare triple {12034#true} assume true; {12034#true} is VALID [2020-07-29 01:01:16,113 INFO L275 TraceCheckUtils]: 75: Hoare quadruple {12034#true} {12072#(<= main_~i~1 3)} #78#return; {12072#(<= main_~i~1 3)} is VALID [2020-07-29 01:01:16,113 INFO L280 TraceCheckUtils]: 76: Hoare triple {12072#(<= main_~i~1 3)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {12072#(<= main_~i~1 3)} is VALID [2020-07-29 01:01:16,114 INFO L280 TraceCheckUtils]: 77: Hoare triple {12072#(<= main_~i~1 3)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {12072#(<= main_~i~1 3)} is VALID [2020-07-29 01:01:16,114 INFO L280 TraceCheckUtils]: 78: Hoare triple {12072#(<= main_~i~1 3)} havoc #t~ret3; {12072#(<= main_~i~1 3)} is VALID [2020-07-29 01:01:16,115 INFO L280 TraceCheckUtils]: 79: Hoare triple {12072#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12093#(<= main_~i~1 4)} is VALID [2020-07-29 01:01:16,116 INFO L280 TraceCheckUtils]: 80: Hoare triple {12093#(<= main_~i~1 4)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {12093#(<= main_~i~1 4)} is VALID [2020-07-29 01:01:16,116 INFO L263 TraceCheckUtils]: 81: Hoare triple {12093#(<= main_~i~1 4)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {12034#true} is VALID [2020-07-29 01:01:16,116 INFO L280 TraceCheckUtils]: 82: Hoare triple {12034#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {12034#true} is VALID [2020-07-29 01:01:16,116 INFO L280 TraceCheckUtils]: 83: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,116 INFO L280 TraceCheckUtils]: 84: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,117 INFO L280 TraceCheckUtils]: 85: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,117 INFO L280 TraceCheckUtils]: 86: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,117 INFO L280 TraceCheckUtils]: 87: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,117 INFO L280 TraceCheckUtils]: 88: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,117 INFO L280 TraceCheckUtils]: 89: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,117 INFO L280 TraceCheckUtils]: 90: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,117 INFO L280 TraceCheckUtils]: 91: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,118 INFO L280 TraceCheckUtils]: 92: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,118 INFO L280 TraceCheckUtils]: 93: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,118 INFO L280 TraceCheckUtils]: 94: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,118 INFO L280 TraceCheckUtils]: 95: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,118 INFO L280 TraceCheckUtils]: 96: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,118 INFO L280 TraceCheckUtils]: 97: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,118 INFO L280 TraceCheckUtils]: 98: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,118 INFO L280 TraceCheckUtils]: 99: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,119 INFO L280 TraceCheckUtils]: 100: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,119 INFO L280 TraceCheckUtils]: 101: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,119 INFO L280 TraceCheckUtils]: 102: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,120 INFO L280 TraceCheckUtils]: 103: Hoare triple {12034#true} assume !(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,120 INFO L280 TraceCheckUtils]: 104: Hoare triple {12034#true} #res := ~i~0; {12034#true} is VALID [2020-07-29 01:01:16,120 INFO L280 TraceCheckUtils]: 105: Hoare triple {12034#true} assume true; {12034#true} is VALID [2020-07-29 01:01:16,121 INFO L275 TraceCheckUtils]: 106: Hoare quadruple {12034#true} {12093#(<= main_~i~1 4)} #78#return; {12093#(<= main_~i~1 4)} is VALID [2020-07-29 01:01:16,122 INFO L280 TraceCheckUtils]: 107: Hoare triple {12093#(<= main_~i~1 4)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {12093#(<= main_~i~1 4)} is VALID [2020-07-29 01:01:16,123 INFO L280 TraceCheckUtils]: 108: Hoare triple {12093#(<= main_~i~1 4)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {12093#(<= main_~i~1 4)} is VALID [2020-07-29 01:01:16,123 INFO L280 TraceCheckUtils]: 109: Hoare triple {12093#(<= main_~i~1 4)} havoc #t~ret3; {12093#(<= main_~i~1 4)} is VALID [2020-07-29 01:01:16,124 INFO L280 TraceCheckUtils]: 110: Hoare triple {12093#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12119#(<= main_~i~1 5)} is VALID [2020-07-29 01:01:16,125 INFO L280 TraceCheckUtils]: 111: Hoare triple {12119#(<= main_~i~1 5)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {12119#(<= main_~i~1 5)} is VALID [2020-07-29 01:01:16,125 INFO L263 TraceCheckUtils]: 112: Hoare triple {12119#(<= main_~i~1 5)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {12034#true} is VALID [2020-07-29 01:01:16,125 INFO L280 TraceCheckUtils]: 113: Hoare triple {12034#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {12034#true} is VALID [2020-07-29 01:01:16,125 INFO L280 TraceCheckUtils]: 114: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,125 INFO L280 TraceCheckUtils]: 115: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,126 INFO L280 TraceCheckUtils]: 116: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,126 INFO L280 TraceCheckUtils]: 117: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,126 INFO L280 TraceCheckUtils]: 118: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,126 INFO L280 TraceCheckUtils]: 119: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,127 INFO L280 TraceCheckUtils]: 120: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,127 INFO L280 TraceCheckUtils]: 121: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,127 INFO L280 TraceCheckUtils]: 122: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,127 INFO L280 TraceCheckUtils]: 123: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,127 INFO L280 TraceCheckUtils]: 124: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,127 INFO L280 TraceCheckUtils]: 125: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,128 INFO L280 TraceCheckUtils]: 126: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,128 INFO L280 TraceCheckUtils]: 127: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,128 INFO L280 TraceCheckUtils]: 128: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,128 INFO L280 TraceCheckUtils]: 129: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,128 INFO L280 TraceCheckUtils]: 130: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,128 INFO L280 TraceCheckUtils]: 131: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,128 INFO L280 TraceCheckUtils]: 132: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,129 INFO L280 TraceCheckUtils]: 133: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,129 INFO L280 TraceCheckUtils]: 134: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,129 INFO L280 TraceCheckUtils]: 135: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,129 INFO L280 TraceCheckUtils]: 136: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,129 INFO L280 TraceCheckUtils]: 137: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,130 INFO L280 TraceCheckUtils]: 138: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,130 INFO L280 TraceCheckUtils]: 139: Hoare triple {12034#true} assume !(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,131 INFO L280 TraceCheckUtils]: 140: Hoare triple {12034#true} #res := ~i~0; {12034#true} is VALID [2020-07-29 01:01:16,131 INFO L280 TraceCheckUtils]: 141: Hoare triple {12034#true} assume true; {12034#true} is VALID [2020-07-29 01:01:16,133 INFO L275 TraceCheckUtils]: 142: Hoare quadruple {12034#true} {12119#(<= main_~i~1 5)} #78#return; {12119#(<= main_~i~1 5)} is VALID [2020-07-29 01:01:16,134 INFO L280 TraceCheckUtils]: 143: Hoare triple {12119#(<= main_~i~1 5)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {12119#(<= main_~i~1 5)} is VALID [2020-07-29 01:01:16,135 INFO L280 TraceCheckUtils]: 144: Hoare triple {12119#(<= main_~i~1 5)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {12119#(<= main_~i~1 5)} is VALID [2020-07-29 01:01:16,136 INFO L280 TraceCheckUtils]: 145: Hoare triple {12119#(<= main_~i~1 5)} havoc #t~ret3; {12119#(<= main_~i~1 5)} is VALID [2020-07-29 01:01:16,137 INFO L280 TraceCheckUtils]: 146: Hoare triple {12119#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12150#(<= main_~i~1 6)} is VALID [2020-07-29 01:01:16,138 INFO L280 TraceCheckUtils]: 147: Hoare triple {12150#(<= main_~i~1 6)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {12150#(<= main_~i~1 6)} is VALID [2020-07-29 01:01:16,138 INFO L263 TraceCheckUtils]: 148: Hoare triple {12150#(<= main_~i~1 6)} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {12034#true} is VALID [2020-07-29 01:01:16,138 INFO L280 TraceCheckUtils]: 149: Hoare triple {12034#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {12034#true} is VALID [2020-07-29 01:01:16,139 INFO L280 TraceCheckUtils]: 150: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,139 INFO L280 TraceCheckUtils]: 151: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,139 INFO L280 TraceCheckUtils]: 152: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,139 INFO L280 TraceCheckUtils]: 153: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,140 INFO L280 TraceCheckUtils]: 154: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,140 INFO L280 TraceCheckUtils]: 155: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,140 INFO L280 TraceCheckUtils]: 156: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,140 INFO L280 TraceCheckUtils]: 157: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,141 INFO L280 TraceCheckUtils]: 158: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,141 INFO L280 TraceCheckUtils]: 159: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,141 INFO L280 TraceCheckUtils]: 160: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,142 INFO L280 TraceCheckUtils]: 161: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,142 INFO L280 TraceCheckUtils]: 162: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,142 INFO L280 TraceCheckUtils]: 163: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,143 INFO L280 TraceCheckUtils]: 164: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,143 INFO L280 TraceCheckUtils]: 165: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,143 INFO L280 TraceCheckUtils]: 166: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,144 INFO L280 TraceCheckUtils]: 167: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,144 INFO L280 TraceCheckUtils]: 168: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,145 INFO L280 TraceCheckUtils]: 169: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,145 INFO L280 TraceCheckUtils]: 170: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,145 INFO L280 TraceCheckUtils]: 171: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,146 INFO L280 TraceCheckUtils]: 172: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,146 INFO L280 TraceCheckUtils]: 173: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,146 INFO L280 TraceCheckUtils]: 174: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,147 INFO L280 TraceCheckUtils]: 175: Hoare triple {12034#true} assume !(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,147 INFO L280 TraceCheckUtils]: 176: Hoare triple {12034#true} #res := ~i~0; {12034#true} is VALID [2020-07-29 01:01:16,147 INFO L280 TraceCheckUtils]: 177: Hoare triple {12034#true} assume true; {12034#true} is VALID [2020-07-29 01:01:16,149 INFO L275 TraceCheckUtils]: 178: Hoare quadruple {12034#true} {12150#(<= main_~i~1 6)} #78#return; {12150#(<= main_~i~1 6)} is VALID [2020-07-29 01:01:16,150 INFO L280 TraceCheckUtils]: 179: Hoare triple {12150#(<= main_~i~1 6)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {12150#(<= main_~i~1 6)} is VALID [2020-07-29 01:01:16,151 INFO L280 TraceCheckUtils]: 180: Hoare triple {12150#(<= main_~i~1 6)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {12150#(<= main_~i~1 6)} is VALID [2020-07-29 01:01:16,152 INFO L280 TraceCheckUtils]: 181: Hoare triple {12150#(<= main_~i~1 6)} havoc #t~ret3; {12150#(<= main_~i~1 6)} is VALID [2020-07-29 01:01:16,153 INFO L280 TraceCheckUtils]: 182: Hoare triple {12150#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12181#(<= main_~i~1 7)} is VALID [2020-07-29 01:01:16,154 INFO L280 TraceCheckUtils]: 183: Hoare triple {12181#(<= main_~i~1 7)} assume !(~i~1 < 32); {12035#false} is VALID [2020-07-29 01:01:16,154 INFO L280 TraceCheckUtils]: 184: Hoare triple {12035#false} ~i~1 := 0; {12035#false} is VALID [2020-07-29 01:01:16,154 INFO L280 TraceCheckUtils]: 185: Hoare triple {12035#false} assume !!(~i~1 < 32); {12035#false} is VALID [2020-07-29 01:01:16,154 INFO L280 TraceCheckUtils]: 186: Hoare triple {12035#false} SUMMARY for call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L30 {12035#false} is VALID [2020-07-29 01:01:16,155 INFO L280 TraceCheckUtils]: 187: Hoare triple {12035#false} assume !(#t~mem5 != ~i~1);havoc #t~mem5; {12035#false} is VALID [2020-07-29 01:01:16,155 INFO L280 TraceCheckUtils]: 188: Hoare triple {12035#false} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12035#false} is VALID [2020-07-29 01:01:16,155 INFO L280 TraceCheckUtils]: 189: Hoare triple {12035#false} assume !!(~i~1 < 32); {12035#false} is VALID [2020-07-29 01:01:16,155 INFO L280 TraceCheckUtils]: 190: Hoare triple {12035#false} SUMMARY for call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L30 {12035#false} is VALID [2020-07-29 01:01:16,155 INFO L280 TraceCheckUtils]: 191: Hoare triple {12035#false} assume !(#t~mem5 != ~i~1);havoc #t~mem5; {12035#false} is VALID [2020-07-29 01:01:16,155 INFO L280 TraceCheckUtils]: 192: Hoare triple {12035#false} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12035#false} is VALID [2020-07-29 01:01:16,156 INFO L280 TraceCheckUtils]: 193: Hoare triple {12035#false} assume !!(~i~1 < 32); {12035#false} is VALID [2020-07-29 01:01:16,156 INFO L280 TraceCheckUtils]: 194: Hoare triple {12035#false} SUMMARY for call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L30 {12035#false} is VALID [2020-07-29 01:01:16,156 INFO L280 TraceCheckUtils]: 195: Hoare triple {12035#false} assume !(#t~mem5 != ~i~1);havoc #t~mem5; {12035#false} is VALID [2020-07-29 01:01:16,156 INFO L280 TraceCheckUtils]: 196: Hoare triple {12035#false} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12035#false} is VALID [2020-07-29 01:01:16,157 INFO L280 TraceCheckUtils]: 197: Hoare triple {12035#false} assume !!(~i~1 < 32); {12035#false} is VALID [2020-07-29 01:01:16,157 INFO L280 TraceCheckUtils]: 198: Hoare triple {12035#false} SUMMARY for call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L30 {12035#false} is VALID [2020-07-29 01:01:16,157 INFO L280 TraceCheckUtils]: 199: Hoare triple {12035#false} assume !(#t~mem5 != ~i~1);havoc #t~mem5; {12035#false} is VALID [2020-07-29 01:01:16,157 INFO L280 TraceCheckUtils]: 200: Hoare triple {12035#false} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12035#false} is VALID [2020-07-29 01:01:16,157 INFO L280 TraceCheckUtils]: 201: Hoare triple {12035#false} assume !!(~i~1 < 32); {12035#false} is VALID [2020-07-29 01:01:16,157 INFO L280 TraceCheckUtils]: 202: Hoare triple {12035#false} assume !(4 + (~#b~0.offset + 4 * ~i~1) <= #length[~#b~0.base] && 0 <= ~#b~0.offset + 4 * ~i~1); {12035#false} is VALID [2020-07-29 01:01:16,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1360 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 1227 trivial. 0 not checked. [2020-07-29 01:01:16,195 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700985944] [2020-07-29 01:01:16,195 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273966875] [2020-07-29 01:01:16,195 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:01:16,267 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-07-29 01:01:16,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:01:16,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:01:16,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:16,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:01:16,714 INFO L263 TraceCheckUtils]: 0: Hoare triple {12034#true} call ULTIMATE.init(); {12034#true} is VALID [2020-07-29 01:01:16,714 INFO L280 TraceCheckUtils]: 1: Hoare triple {12034#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {12034#true} is VALID [2020-07-29 01:01:16,715 INFO L280 TraceCheckUtils]: 2: Hoare triple {12034#true} assume true; {12034#true} is VALID [2020-07-29 01:01:16,715 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {12034#true} {12034#true} #74#return; {12034#true} is VALID [2020-07-29 01:01:16,715 INFO L263 TraceCheckUtils]: 4: Hoare triple {12034#true} call #t~ret6 := main(); {12034#true} is VALID [2020-07-29 01:01:16,715 INFO L280 TraceCheckUtils]: 5: Hoare triple {12034#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(128);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {12034#true} is VALID [2020-07-29 01:01:16,715 INFO L280 TraceCheckUtils]: 6: Hoare triple {12034#true} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {12034#true} is VALID [2020-07-29 01:01:16,716 INFO L263 TraceCheckUtils]: 7: Hoare triple {12034#true} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {12034#true} is VALID [2020-07-29 01:01:16,716 INFO L280 TraceCheckUtils]: 8: Hoare triple {12034#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {12034#true} is VALID [2020-07-29 01:01:16,716 INFO L280 TraceCheckUtils]: 9: Hoare triple {12034#true} assume !(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,716 INFO L280 TraceCheckUtils]: 10: Hoare triple {12034#true} #res := ~i~0; {12034#true} is VALID [2020-07-29 01:01:16,717 INFO L280 TraceCheckUtils]: 11: Hoare triple {12034#true} assume true; {12034#true} is VALID [2020-07-29 01:01:16,717 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {12034#true} {12034#true} #78#return; {12034#true} is VALID [2020-07-29 01:01:16,717 INFO L280 TraceCheckUtils]: 13: Hoare triple {12034#true} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {12034#true} is VALID [2020-07-29 01:01:16,717 INFO L280 TraceCheckUtils]: 14: Hoare triple {12034#true} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {12034#true} is VALID [2020-07-29 01:01:16,717 INFO L280 TraceCheckUtils]: 15: Hoare triple {12034#true} havoc #t~ret3; {12034#true} is VALID [2020-07-29 01:01:16,718 INFO L280 TraceCheckUtils]: 16: Hoare triple {12034#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12034#true} is VALID [2020-07-29 01:01:16,718 INFO L280 TraceCheckUtils]: 17: Hoare triple {12034#true} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {12034#true} is VALID [2020-07-29 01:01:16,718 INFO L263 TraceCheckUtils]: 18: Hoare triple {12034#true} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {12034#true} is VALID [2020-07-29 01:01:16,718 INFO L280 TraceCheckUtils]: 19: Hoare triple {12034#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {12034#true} is VALID [2020-07-29 01:01:16,718 INFO L280 TraceCheckUtils]: 20: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,719 INFO L280 TraceCheckUtils]: 21: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,719 INFO L280 TraceCheckUtils]: 22: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,719 INFO L280 TraceCheckUtils]: 23: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,719 INFO L280 TraceCheckUtils]: 24: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,720 INFO L280 TraceCheckUtils]: 25: Hoare triple {12034#true} assume !(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,720 INFO L280 TraceCheckUtils]: 26: Hoare triple {12034#true} #res := ~i~0; {12034#true} is VALID [2020-07-29 01:01:16,720 INFO L280 TraceCheckUtils]: 27: Hoare triple {12034#true} assume true; {12034#true} is VALID [2020-07-29 01:01:16,720 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {12034#true} {12034#true} #78#return; {12034#true} is VALID [2020-07-29 01:01:16,721 INFO L280 TraceCheckUtils]: 29: Hoare triple {12034#true} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {12034#true} is VALID [2020-07-29 01:01:16,721 INFO L280 TraceCheckUtils]: 30: Hoare triple {12034#true} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {12034#true} is VALID [2020-07-29 01:01:16,721 INFO L280 TraceCheckUtils]: 31: Hoare triple {12034#true} havoc #t~ret3; {12034#true} is VALID [2020-07-29 01:01:16,721 INFO L280 TraceCheckUtils]: 32: Hoare triple {12034#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12034#true} is VALID [2020-07-29 01:01:16,722 INFO L280 TraceCheckUtils]: 33: Hoare triple {12034#true} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {12034#true} is VALID [2020-07-29 01:01:16,722 INFO L263 TraceCheckUtils]: 34: Hoare triple {12034#true} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {12034#true} is VALID [2020-07-29 01:01:16,722 INFO L280 TraceCheckUtils]: 35: Hoare triple {12034#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {12034#true} is VALID [2020-07-29 01:01:16,722 INFO L280 TraceCheckUtils]: 36: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,723 INFO L280 TraceCheckUtils]: 37: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,723 INFO L280 TraceCheckUtils]: 38: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,723 INFO L280 TraceCheckUtils]: 39: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,723 INFO L280 TraceCheckUtils]: 40: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,724 INFO L280 TraceCheckUtils]: 41: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,724 INFO L280 TraceCheckUtils]: 42: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,724 INFO L280 TraceCheckUtils]: 43: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,724 INFO L280 TraceCheckUtils]: 44: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,725 INFO L280 TraceCheckUtils]: 45: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,725 INFO L280 TraceCheckUtils]: 46: Hoare triple {12034#true} assume !(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,725 INFO L280 TraceCheckUtils]: 47: Hoare triple {12034#true} #res := ~i~0; {12034#true} is VALID [2020-07-29 01:01:16,725 INFO L280 TraceCheckUtils]: 48: Hoare triple {12034#true} assume true; {12034#true} is VALID [2020-07-29 01:01:16,726 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {12034#true} {12034#true} #78#return; {12034#true} is VALID [2020-07-29 01:01:16,726 INFO L280 TraceCheckUtils]: 50: Hoare triple {12034#true} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {12034#true} is VALID [2020-07-29 01:01:16,726 INFO L280 TraceCheckUtils]: 51: Hoare triple {12034#true} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {12034#true} is VALID [2020-07-29 01:01:16,726 INFO L280 TraceCheckUtils]: 52: Hoare triple {12034#true} havoc #t~ret3; {12034#true} is VALID [2020-07-29 01:01:16,727 INFO L280 TraceCheckUtils]: 53: Hoare triple {12034#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12034#true} is VALID [2020-07-29 01:01:16,727 INFO L280 TraceCheckUtils]: 54: Hoare triple {12034#true} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {12034#true} is VALID [2020-07-29 01:01:16,727 INFO L263 TraceCheckUtils]: 55: Hoare triple {12034#true} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {12034#true} is VALID [2020-07-29 01:01:16,727 INFO L280 TraceCheckUtils]: 56: Hoare triple {12034#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {12034#true} is VALID [2020-07-29 01:01:16,728 INFO L280 TraceCheckUtils]: 57: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,728 INFO L280 TraceCheckUtils]: 58: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,728 INFO L280 TraceCheckUtils]: 59: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,728 INFO L280 TraceCheckUtils]: 60: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,729 INFO L280 TraceCheckUtils]: 61: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,729 INFO L280 TraceCheckUtils]: 62: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,729 INFO L280 TraceCheckUtils]: 63: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,729 INFO L280 TraceCheckUtils]: 64: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,730 INFO L280 TraceCheckUtils]: 65: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,730 INFO L280 TraceCheckUtils]: 66: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,730 INFO L280 TraceCheckUtils]: 67: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,730 INFO L280 TraceCheckUtils]: 68: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,730 INFO L280 TraceCheckUtils]: 69: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,731 INFO L280 TraceCheckUtils]: 70: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,731 INFO L280 TraceCheckUtils]: 71: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,731 INFO L280 TraceCheckUtils]: 72: Hoare triple {12034#true} assume !(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,731 INFO L280 TraceCheckUtils]: 73: Hoare triple {12034#true} #res := ~i~0; {12034#true} is VALID [2020-07-29 01:01:16,732 INFO L280 TraceCheckUtils]: 74: Hoare triple {12034#true} assume true; {12034#true} is VALID [2020-07-29 01:01:16,732 INFO L275 TraceCheckUtils]: 75: Hoare quadruple {12034#true} {12034#true} #78#return; {12034#true} is VALID [2020-07-29 01:01:16,732 INFO L280 TraceCheckUtils]: 76: Hoare triple {12034#true} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {12034#true} is VALID [2020-07-29 01:01:16,732 INFO L280 TraceCheckUtils]: 77: Hoare triple {12034#true} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {12034#true} is VALID [2020-07-29 01:01:16,733 INFO L280 TraceCheckUtils]: 78: Hoare triple {12034#true} havoc #t~ret3; {12034#true} is VALID [2020-07-29 01:01:16,733 INFO L280 TraceCheckUtils]: 79: Hoare triple {12034#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12034#true} is VALID [2020-07-29 01:01:16,733 INFO L280 TraceCheckUtils]: 80: Hoare triple {12034#true} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {12034#true} is VALID [2020-07-29 01:01:16,733 INFO L263 TraceCheckUtils]: 81: Hoare triple {12034#true} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {12034#true} is VALID [2020-07-29 01:01:16,733 INFO L280 TraceCheckUtils]: 82: Hoare triple {12034#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {12034#true} is VALID [2020-07-29 01:01:16,734 INFO L280 TraceCheckUtils]: 83: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,734 INFO L280 TraceCheckUtils]: 84: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,734 INFO L280 TraceCheckUtils]: 85: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,735 INFO L280 TraceCheckUtils]: 86: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,735 INFO L280 TraceCheckUtils]: 87: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,735 INFO L280 TraceCheckUtils]: 88: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,735 INFO L280 TraceCheckUtils]: 89: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,736 INFO L280 TraceCheckUtils]: 90: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,736 INFO L280 TraceCheckUtils]: 91: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,736 INFO L280 TraceCheckUtils]: 92: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,736 INFO L280 TraceCheckUtils]: 93: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,737 INFO L280 TraceCheckUtils]: 94: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,737 INFO L280 TraceCheckUtils]: 95: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,737 INFO L280 TraceCheckUtils]: 96: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,737 INFO L280 TraceCheckUtils]: 97: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,737 INFO L280 TraceCheckUtils]: 98: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,738 INFO L280 TraceCheckUtils]: 99: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,738 INFO L280 TraceCheckUtils]: 100: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,738 INFO L280 TraceCheckUtils]: 101: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,738 INFO L280 TraceCheckUtils]: 102: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,739 INFO L280 TraceCheckUtils]: 103: Hoare triple {12034#true} assume !(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,739 INFO L280 TraceCheckUtils]: 104: Hoare triple {12034#true} #res := ~i~0; {12034#true} is VALID [2020-07-29 01:01:16,739 INFO L280 TraceCheckUtils]: 105: Hoare triple {12034#true} assume true; {12034#true} is VALID [2020-07-29 01:01:16,739 INFO L275 TraceCheckUtils]: 106: Hoare quadruple {12034#true} {12034#true} #78#return; {12034#true} is VALID [2020-07-29 01:01:16,740 INFO L280 TraceCheckUtils]: 107: Hoare triple {12034#true} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {12034#true} is VALID [2020-07-29 01:01:16,740 INFO L280 TraceCheckUtils]: 108: Hoare triple {12034#true} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {12034#true} is VALID [2020-07-29 01:01:16,740 INFO L280 TraceCheckUtils]: 109: Hoare triple {12034#true} havoc #t~ret3; {12034#true} is VALID [2020-07-29 01:01:16,740 INFO L280 TraceCheckUtils]: 110: Hoare triple {12034#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12034#true} is VALID [2020-07-29 01:01:16,741 INFO L280 TraceCheckUtils]: 111: Hoare triple {12034#true} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {12034#true} is VALID [2020-07-29 01:01:16,741 INFO L263 TraceCheckUtils]: 112: Hoare triple {12034#true} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {12034#true} is VALID [2020-07-29 01:01:16,741 INFO L280 TraceCheckUtils]: 113: Hoare triple {12034#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {12034#true} is VALID [2020-07-29 01:01:16,741 INFO L280 TraceCheckUtils]: 114: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,741 INFO L280 TraceCheckUtils]: 115: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,742 INFO L280 TraceCheckUtils]: 116: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,742 INFO L280 TraceCheckUtils]: 117: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,742 INFO L280 TraceCheckUtils]: 118: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,742 INFO L280 TraceCheckUtils]: 119: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,743 INFO L280 TraceCheckUtils]: 120: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,743 INFO L280 TraceCheckUtils]: 121: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,743 INFO L280 TraceCheckUtils]: 122: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,743 INFO L280 TraceCheckUtils]: 123: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,744 INFO L280 TraceCheckUtils]: 124: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,744 INFO L280 TraceCheckUtils]: 125: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,744 INFO L280 TraceCheckUtils]: 126: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,744 INFO L280 TraceCheckUtils]: 127: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,744 INFO L280 TraceCheckUtils]: 128: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,745 INFO L280 TraceCheckUtils]: 129: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,745 INFO L280 TraceCheckUtils]: 130: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,745 INFO L280 TraceCheckUtils]: 131: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,745 INFO L280 TraceCheckUtils]: 132: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,746 INFO L280 TraceCheckUtils]: 133: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,746 INFO L280 TraceCheckUtils]: 134: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,746 INFO L280 TraceCheckUtils]: 135: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,746 INFO L280 TraceCheckUtils]: 136: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,746 INFO L280 TraceCheckUtils]: 137: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,747 INFO L280 TraceCheckUtils]: 138: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,747 INFO L280 TraceCheckUtils]: 139: Hoare triple {12034#true} assume !(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,747 INFO L280 TraceCheckUtils]: 140: Hoare triple {12034#true} #res := ~i~0; {12034#true} is VALID [2020-07-29 01:01:16,747 INFO L280 TraceCheckUtils]: 141: Hoare triple {12034#true} assume true; {12034#true} is VALID [2020-07-29 01:01:16,747 INFO L275 TraceCheckUtils]: 142: Hoare quadruple {12034#true} {12034#true} #78#return; {12034#true} is VALID [2020-07-29 01:01:16,748 INFO L280 TraceCheckUtils]: 143: Hoare triple {12034#true} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {12034#true} is VALID [2020-07-29 01:01:16,748 INFO L280 TraceCheckUtils]: 144: Hoare triple {12034#true} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {12034#true} is VALID [2020-07-29 01:01:16,748 INFO L280 TraceCheckUtils]: 145: Hoare triple {12034#true} havoc #t~ret3; {12034#true} is VALID [2020-07-29 01:01:16,748 INFO L280 TraceCheckUtils]: 146: Hoare triple {12034#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12034#true} is VALID [2020-07-29 01:01:16,748 INFO L280 TraceCheckUtils]: 147: Hoare triple {12034#true} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {12034#true} is VALID [2020-07-29 01:01:16,748 INFO L263 TraceCheckUtils]: 148: Hoare triple {12034#true} call #t~ret3 := foo(~c~0.base, ~c~0.offset, ~i~1); {12034#true} is VALID [2020-07-29 01:01:16,748 INFO L280 TraceCheckUtils]: 149: Hoare triple {12034#true} ~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; {12034#true} is VALID [2020-07-29 01:01:16,748 INFO L280 TraceCheckUtils]: 150: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,749 INFO L280 TraceCheckUtils]: 151: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,749 INFO L280 TraceCheckUtils]: 152: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,749 INFO L280 TraceCheckUtils]: 153: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,749 INFO L280 TraceCheckUtils]: 154: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,749 INFO L280 TraceCheckUtils]: 155: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,749 INFO L280 TraceCheckUtils]: 156: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,750 INFO L280 TraceCheckUtils]: 157: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,750 INFO L280 TraceCheckUtils]: 158: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,750 INFO L280 TraceCheckUtils]: 159: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,755 INFO L280 TraceCheckUtils]: 160: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,756 INFO L280 TraceCheckUtils]: 161: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,756 INFO L280 TraceCheckUtils]: 162: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,756 INFO L280 TraceCheckUtils]: 163: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,756 INFO L280 TraceCheckUtils]: 164: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,757 INFO L280 TraceCheckUtils]: 165: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,757 INFO L280 TraceCheckUtils]: 166: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,757 INFO L280 TraceCheckUtils]: 167: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,757 INFO L280 TraceCheckUtils]: 168: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,758 INFO L280 TraceCheckUtils]: 169: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,758 INFO L280 TraceCheckUtils]: 170: Hoare triple {12034#true} assume !!(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,758 INFO L280 TraceCheckUtils]: 171: Hoare triple {12034#true} assume 0 <= ~i~0 && ~i~0 < 32; {12034#true} is VALID [2020-07-29 01:01:16,759 INFO L280 TraceCheckUtils]: 172: Hoare triple {12034#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {12034#true} is VALID [2020-07-29 01:01:16,759 INFO L280 TraceCheckUtils]: 173: Hoare triple {12034#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {12034#true} is VALID [2020-07-29 01:01:16,759 INFO L280 TraceCheckUtils]: 174: Hoare triple {12034#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12034#true} is VALID [2020-07-29 01:01:16,760 INFO L280 TraceCheckUtils]: 175: Hoare triple {12034#true} assume !(~i~0 < ~size); {12034#true} is VALID [2020-07-29 01:01:16,760 INFO L280 TraceCheckUtils]: 176: Hoare triple {12034#true} #res := ~i~0; {12034#true} is VALID [2020-07-29 01:01:16,761 INFO L280 TraceCheckUtils]: 177: Hoare triple {12034#true} assume true; {12034#true} is VALID [2020-07-29 01:01:16,761 INFO L275 TraceCheckUtils]: 178: Hoare quadruple {12034#true} {12034#true} #78#return; {12034#true} is VALID [2020-07-29 01:01:16,761 INFO L280 TraceCheckUtils]: 179: Hoare triple {12034#true} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {12034#true} is VALID [2020-07-29 01:01:16,763 INFO L280 TraceCheckUtils]: 180: Hoare triple {12034#true} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {12726#(<= (+ (* 4 main_~i~1) |main_~#b~0.offset| 4) (select |#length| |main_~#b~0.base|))} is VALID [2020-07-29 01:01:16,764 INFO L280 TraceCheckUtils]: 181: Hoare triple {12726#(<= (+ (* 4 main_~i~1) |main_~#b~0.offset| 4) (select |#length| |main_~#b~0.base|))} havoc #t~ret3; {12726#(<= (+ (* 4 main_~i~1) |main_~#b~0.offset| 4) (select |#length| |main_~#b~0.base|))} is VALID [2020-07-29 01:01:16,766 INFO L280 TraceCheckUtils]: 182: Hoare triple {12726#(<= (+ (* 4 main_~i~1) |main_~#b~0.offset| 4) (select |#length| |main_~#b~0.base|))} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12733#(<= main_~i~1 (+ (div (+ (select |#length| |main_~#b~0.base|) (* |main_~#b~0.offset| (- 1)) (- 4)) 4) 1))} is VALID [2020-07-29 01:01:16,767 INFO L280 TraceCheckUtils]: 183: Hoare triple {12733#(<= main_~i~1 (+ (div (+ (select |#length| |main_~#b~0.base|) (* |main_~#b~0.offset| (- 1)) (- 4)) 4) 1))} assume !(~i~1 < 32); {12737#(<= 31 (div (+ (select |#length| |main_~#b~0.base|) (* |main_~#b~0.offset| (- 1)) (- 4)) 4))} is VALID [2020-07-29 01:01:16,768 INFO L280 TraceCheckUtils]: 184: Hoare triple {12737#(<= 31 (div (+ (select |#length| |main_~#b~0.base|) (* |main_~#b~0.offset| (- 1)) (- 4)) 4))} ~i~1 := 0; {12737#(<= 31 (div (+ (select |#length| |main_~#b~0.base|) (* |main_~#b~0.offset| (- 1)) (- 4)) 4))} is VALID [2020-07-29 01:01:16,769 INFO L280 TraceCheckUtils]: 185: Hoare triple {12737#(<= 31 (div (+ (select |#length| |main_~#b~0.base|) (* |main_~#b~0.offset| (- 1)) (- 4)) 4))} assume !!(~i~1 < 32); {12737#(<= 31 (div (+ (select |#length| |main_~#b~0.base|) (* |main_~#b~0.offset| (- 1)) (- 4)) 4))} is VALID [2020-07-29 01:01:16,770 INFO L280 TraceCheckUtils]: 186: Hoare triple {12737#(<= 31 (div (+ (select |#length| |main_~#b~0.base|) (* |main_~#b~0.offset| (- 1)) (- 4)) 4))} SUMMARY for call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L30 {12737#(<= 31 (div (+ (select |#length| |main_~#b~0.base|) (* |main_~#b~0.offset| (- 1)) (- 4)) 4))} is VALID [2020-07-29 01:01:16,771 INFO L280 TraceCheckUtils]: 187: Hoare triple {12737#(<= 31 (div (+ (select |#length| |main_~#b~0.base|) (* |main_~#b~0.offset| (- 1)) (- 4)) 4))} assume !(#t~mem5 != ~i~1);havoc #t~mem5; {12737#(<= 31 (div (+ (select |#length| |main_~#b~0.base|) (* |main_~#b~0.offset| (- 1)) (- 4)) 4))} is VALID [2020-07-29 01:01:16,772 INFO L280 TraceCheckUtils]: 188: Hoare triple {12737#(<= 31 (div (+ (select |#length| |main_~#b~0.base|) (* |main_~#b~0.offset| (- 1)) (- 4)) 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12737#(<= 31 (div (+ (select |#length| |main_~#b~0.base|) (* |main_~#b~0.offset| (- 1)) (- 4)) 4))} is VALID [2020-07-29 01:01:16,773 INFO L280 TraceCheckUtils]: 189: Hoare triple {12737#(<= 31 (div (+ (select |#length| |main_~#b~0.base|) (* |main_~#b~0.offset| (- 1)) (- 4)) 4))} assume !!(~i~1 < 32); {12737#(<= 31 (div (+ (select |#length| |main_~#b~0.base|) (* |main_~#b~0.offset| (- 1)) (- 4)) 4))} is VALID [2020-07-29 01:01:16,774 INFO L280 TraceCheckUtils]: 190: Hoare triple {12737#(<= 31 (div (+ (select |#length| |main_~#b~0.base|) (* |main_~#b~0.offset| (- 1)) (- 4)) 4))} SUMMARY for call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L30 {12737#(<= 31 (div (+ (select |#length| |main_~#b~0.base|) (* |main_~#b~0.offset| (- 1)) (- 4)) 4))} is VALID [2020-07-29 01:01:16,774 INFO L280 TraceCheckUtils]: 191: Hoare triple {12737#(<= 31 (div (+ (select |#length| |main_~#b~0.base|) (* |main_~#b~0.offset| (- 1)) (- 4)) 4))} assume !(#t~mem5 != ~i~1);havoc #t~mem5; {12737#(<= 31 (div (+ (select |#length| |main_~#b~0.base|) (* |main_~#b~0.offset| (- 1)) (- 4)) 4))} is VALID [2020-07-29 01:01:16,775 INFO L280 TraceCheckUtils]: 192: Hoare triple {12737#(<= 31 (div (+ (select |#length| |main_~#b~0.base|) (* |main_~#b~0.offset| (- 1)) (- 4)) 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12737#(<= 31 (div (+ (select |#length| |main_~#b~0.base|) (* |main_~#b~0.offset| (- 1)) (- 4)) 4))} is VALID [2020-07-29 01:01:16,776 INFO L280 TraceCheckUtils]: 193: Hoare triple {12737#(<= 31 (div (+ (select |#length| |main_~#b~0.base|) (* |main_~#b~0.offset| (- 1)) (- 4)) 4))} assume !!(~i~1 < 32); {12737#(<= 31 (div (+ (select |#length| |main_~#b~0.base|) (* |main_~#b~0.offset| (- 1)) (- 4)) 4))} is VALID [2020-07-29 01:01:16,777 INFO L280 TraceCheckUtils]: 194: Hoare triple {12737#(<= 31 (div (+ (select |#length| |main_~#b~0.base|) (* |main_~#b~0.offset| (- 1)) (- 4)) 4))} SUMMARY for call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L30 {12737#(<= 31 (div (+ (select |#length| |main_~#b~0.base|) (* |main_~#b~0.offset| (- 1)) (- 4)) 4))} is VALID [2020-07-29 01:01:16,778 INFO L280 TraceCheckUtils]: 195: Hoare triple {12737#(<= 31 (div (+ (select |#length| |main_~#b~0.base|) (* |main_~#b~0.offset| (- 1)) (- 4)) 4))} assume !(#t~mem5 != ~i~1);havoc #t~mem5; {12737#(<= 31 (div (+ (select |#length| |main_~#b~0.base|) (* |main_~#b~0.offset| (- 1)) (- 4)) 4))} is VALID [2020-07-29 01:01:16,779 INFO L280 TraceCheckUtils]: 196: Hoare triple {12737#(<= 31 (div (+ (select |#length| |main_~#b~0.base|) (* |main_~#b~0.offset| (- 1)) (- 4)) 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12737#(<= 31 (div (+ (select |#length| |main_~#b~0.base|) (* |main_~#b~0.offset| (- 1)) (- 4)) 4))} is VALID [2020-07-29 01:01:16,780 INFO L280 TraceCheckUtils]: 197: Hoare triple {12737#(<= 31 (div (+ (select |#length| |main_~#b~0.base|) (* |main_~#b~0.offset| (- 1)) (- 4)) 4))} assume !!(~i~1 < 32); {12737#(<= 31 (div (+ (select |#length| |main_~#b~0.base|) (* |main_~#b~0.offset| (- 1)) (- 4)) 4))} is VALID [2020-07-29 01:01:16,781 INFO L280 TraceCheckUtils]: 198: Hoare triple {12737#(<= 31 (div (+ (select |#length| |main_~#b~0.base|) (* |main_~#b~0.offset| (- 1)) (- 4)) 4))} SUMMARY for call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L30 {12783#(and (<= 0 (+ (* 4 main_~i~1) |main_~#b~0.offset|)) (<= 31 (div (+ (select |#length| |main_~#b~0.base|) (* |main_~#b~0.offset| (- 1)) (- 4)) 4)))} is VALID [2020-07-29 01:01:16,782 INFO L280 TraceCheckUtils]: 199: Hoare triple {12783#(and (<= 0 (+ (* 4 main_~i~1) |main_~#b~0.offset|)) (<= 31 (div (+ (select |#length| |main_~#b~0.base|) (* |main_~#b~0.offset| (- 1)) (- 4)) 4)))} assume !(#t~mem5 != ~i~1);havoc #t~mem5; {12783#(and (<= 0 (+ (* 4 main_~i~1) |main_~#b~0.offset|)) (<= 31 (div (+ (select |#length| |main_~#b~0.base|) (* |main_~#b~0.offset| (- 1)) (- 4)) 4)))} is VALID [2020-07-29 01:01:16,784 INFO L280 TraceCheckUtils]: 200: Hoare triple {12783#(and (<= 0 (+ (* 4 main_~i~1) |main_~#b~0.offset|)) (<= 31 (div (+ (select |#length| |main_~#b~0.base|) (* |main_~#b~0.offset| (- 1)) (- 4)) 4)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12790#(and (<= 31 (div (+ (select |#length| |main_~#b~0.base|) (* |main_~#b~0.offset| (- 1)) (- 4)) 4)) (<= (+ (div |main_~#b~0.offset| (- 4)) 1) main_~i~1))} is VALID [2020-07-29 01:01:16,785 INFO L280 TraceCheckUtils]: 201: Hoare triple {12790#(and (<= 31 (div (+ (select |#length| |main_~#b~0.base|) (* |main_~#b~0.offset| (- 1)) (- 4)) 4)) (<= (+ (div |main_~#b~0.offset| (- 4)) 1) main_~i~1))} assume !!(~i~1 < 32); {12794#(and (<= 31 (div (+ (select |#length| |main_~#b~0.base|) (* |main_~#b~0.offset| (- 1)) (- 4)) 4)) (< main_~i~1 32) (<= (+ (div |main_~#b~0.offset| (- 4)) 1) main_~i~1))} is VALID [2020-07-29 01:01:16,788 INFO L280 TraceCheckUtils]: 202: Hoare triple {12794#(and (<= 31 (div (+ (select |#length| |main_~#b~0.base|) (* |main_~#b~0.offset| (- 1)) (- 4)) 4)) (< main_~i~1 32) (<= (+ (div |main_~#b~0.offset| (- 4)) 1) main_~i~1))} assume !(4 + (~#b~0.offset + 4 * ~i~1) <= #length[~#b~0.base] && 0 <= ~#b~0.offset + 4 * ~i~1); {12035#false} is VALID [2020-07-29 01:01:16,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1360 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 1327 trivial. 0 not checked. [2020-07-29 01:01:16,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-29 01:01:16,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 17 [2020-07-29 01:01:16,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929726868] [2020-07-29 01:01:16,855 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 203 [2020-07-29 01:01:16,856 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:01:16,856 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-29 01:01:16,913 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:01:16,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-29 01:01:16,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:01:16,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-29 01:01:16,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2020-07-29 01:01:16,914 INFO L87 Difference]: Start difference. First operand 174 states and 182 transitions. Second operand 8 states. [2020-07-29 01:01:17,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:01:17,250 INFO L93 Difference]: Finished difference Result 173 states and 181 transitions. [2020-07-29 01:01:17,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:01:17,250 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 203 [2020-07-29 01:01:17,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:01:17,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:01:17,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2020-07-29 01:01:17,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:01:17,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2020-07-29 01:01:17,253 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2020-07-29 01:01:17,317 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:01:17,318 INFO L225 Difference]: With dead ends: 173 [2020-07-29 01:01:17,318 INFO L226 Difference]: Without dead ends: 0 [2020-07-29 01:01:17,319 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2020-07-29 01:01:17,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-29 01:01:17,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-29 01:01:17,319 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:01:17,319 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-29 01:01:17,319 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-29 01:01:17,320 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-29 01:01:17,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:01:17,320 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 01:01:17,320 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:01:17,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:01:17,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:01:17,321 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-29 01:01:17,321 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-29 01:01:17,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:01:17,321 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 01:01:17,321 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:01:17,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:01:17,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:01:17,321 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:01:17,321 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:01:17,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-29 01:01:17,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-29 01:01:17,322 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 203 [2020-07-29 01:01:17,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:01:17,322 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:01:17,322 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-29 01:01:17,322 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:01:17,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:01:17,524 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2020-07-29 01:01:17,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.07 01:01:17 BoogieIcfgContainer [2020-07-29 01:01:17,531 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-29 01:01:17,532 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:01:17,533 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:01:17,533 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:01:17,533 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:00:31" (3/4) ... [2020-07-29 01:01:17,536 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-29 01:01:17,543 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2020-07-29 01:01:17,543 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure foo [2020-07-29 01:01:17,543 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2020-07-29 01:01:17,549 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2020-07-29 01:01:17,549 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2020-07-29 01:01:17,549 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2020-07-29 01:01:17,550 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-07-29 01:01:17,589 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-29 01:01:17,590 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:01:17,592 INFO L168 Benchmark]: Toolchain (without parser) took 46671.00 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 567.8 MB). Free memory was 961.6 MB in the beginning and 1.1 GB in the end (delta: -106.4 MB). Peak memory consumption was 461.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:01:17,592 INFO L168 Benchmark]: CDTParser took 0.59 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:01:17,593 INFO L168 Benchmark]: CACSL2BoogieTranslator took 303.22 ms. Allocated memory is still 1.0 GB. Free memory was 961.6 MB in the beginning and 950.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:01:17,593 INFO L168 Benchmark]: Boogie Preprocessor took 105.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -168.0 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:01:17,594 INFO L168 Benchmark]: RCFGBuilder took 513.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:01:17,594 INFO L168 Benchmark]: TraceAbstraction took 45676.32 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 438.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.4 MB). Peak memory consumption was 451.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:01:17,594 INFO L168 Benchmark]: Witness Printer took 57.32 ms. Allocated memory is still 1.6 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:01:17,596 INFO L336 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.59 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 303.22 ms. Allocated memory is still 1.0 GB. Free memory was 961.6 MB in the beginning and 950.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 105.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -168.0 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 513.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 45676.32 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 438.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.4 MB). Peak memory consumption was 451.2 MB. Max. memory is 11.5 GB. * Witness Printer took 57.32 ms. Allocated memory is still 1.6 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 16]: 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: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed 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 - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 8 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 45.6s, OverallIterations: 23, TraceHistogramMax: 20, AutomataDifference: 21.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 545 SDtfs, 2191 SDslu, 1394 SDs, 0 SdLazy, 4602 SolverSat, 522 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1575 GetRequests, 1237 SyntacticMatches, 24 SemanticMatches, 314 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1254 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=174occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 23 MinimizatonAttempts, 332 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 15.8s InterpolantComputationTime, 2429 NumberOfCodeBlocks, 2051 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 2388 ConstructedInterpolants, 160 QuantifiedInterpolants, 757577 SizeOfPredicates, 55 NumberOfNonLiveVariables, 2887 ConjunctsInSsa, 198 ConjunctsInUnsatCore, 41 InterpolantComputations, 8 PerfectInterpolantSequences, 6091/6670 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 RESULT: Ultimate proved your program to be correct! Received shutdown request...